Skip to main content

2 Result(s)

within Computer Science Remove this filter Math Applications in Computer Science Remove this filter Pranabendu Misra Remove this filter Chapter Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Parameterized Approximations via d-Skew-Symmetric Multicut

    In this paper we design polynomial time approximation algorithms for several parameterized problems such as Odd Cycle Transversal, Almost 2-SAT, Above Guarantee Vertex Cover and Deletion q-Horn Backdoor Set Detec...

    Sudeshna Kolay, Pranabendu Misra… in Mathematical Foundations of Computer Scien… (2014)

  2. No Access

    Chapter and Conference Paper

    Faster Exact Algorithms for Some Terminal Set Problems

    Many problems on graphs can be expressed in the following language: given a graph G = (V,E) and a terminal set T ⊆ V, find a minimum size set S ⊆ V which intersects all “structures” (such as cycles or paths) pass...

    Rajesh Chitnis, Fedor V. Fomin, Daniel Lokshtanov… in Parameterized and Exact Computation (2013)