#### Filter Results:

- Full text PDF available (163)

#### Publication Year

2002

2018

- This year (50)
- Last 5 years (137)
- Last 10 years (237)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Marek Cygan, Fedor V. Fomin, +5 authors Saket Saurabh
- Springer International Publishing
- 2015

- Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos
- 2009 50th Annual IEEE Symposium on Foundations ofâ€¦
- 2009

In a parameterized problem, every instance <i>I</i> comes with a positive integer <i>k</i>. The problem is said to admit a polynomial kernel if, in polynomial time, one can reduce the size of theâ€¦ (More)

- Michael Dom, Daniel Lokshtanov, Saket Saurabh
- ICALP
- 2009

In parameterized complexity each problem instance comes with a parameter k, and a parameterized problem is said to admit a polynomial kernel if there are polynomial time preprocessing rules thatâ€¦ (More)

- Noga Alon, Daniel Lokshtanov, Saket Saurabh
- ICALP
- 2009

We present a randomized subexponential time, polynomial space parameterized algorithm for the k-Weighted Feedback Arc Set in Tournaments (k-FAST) problem. We also show that our algorithm can beâ€¦ (More)

- Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
- SODA
- 2014

Let M = (E, I) be a matroid and let S = {S1, . . . , St} be a family of subsets of E of size p. A subfamily Åœ âŠ† S is q-representative for S if for every set Y âŠ† E of size at most q, if there is a setâ€¦ (More)

Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [<i>J. ACM 2005</i>] as a tool to obtainâ€¦ (More)

The <i>k</i>-Leaf Out-Branching problem is to find an out-branching, that is a rooted oriented spanning tree, with at least <i>k</i> leaves in a given digraph. The problem has recently received muchâ€¦ (More)

- Venkatesh Raman, Saket Saurabh
- Theor. Comput. Sci.
- 2006

The parameterized feedback vertex (arc) set problem is to find whether there are k vertices (arcs) in a given graph whose removal makes the graph acyclic. The parameterized complexity of this problemâ€¦ (More)

- Daniel Lokshtanov, N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh
- ACM Trans. Algorithms
- 2014

We investigate the parameterized complexity of <scp>Vertex Cover</scp> parameterized by the difference between the size of the optimal solution and the value of the linear programming (LP) relaxationâ€¦ (More)

- Daniel Lokshtanov, DÃ¡niel Marx, Saket Saurabh
- SODA
- 2011

A central problem in parameterized algorithms is to obtain algorithms with running time <i>f</i>(<i>k</i>) · <i>n</i><sup><i>O</i>(1)</sup> such that <i>f</i> is as slow growing function of theâ€¦ (More)