#### Filter Results:

- Full text PDF available (52)

#### Publication Year

2008

2018

- This year (8)
- Last 5 years (53)
- Last 10 years (73)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Daniel Lokshtanov, Maria Chudnovsky, +8 authors Jan Arne Telle
- 2009

i Acknowledgements First of all, I would like to thank my supervisor Pinar Heggernes for her help and guidance, both with my reasearch and with all other aspects of being a graduate student. This… (More)

We study the recently introduced Connected Feedback Vertex Set (CFVS) problem from the view-point of parameterized algorithms. CFVS is the connected variant of the classical Feedback Vertex Set… (More)

- Neeldhara Misra, Arshed Nabeel, Harman Singh
- AAMAS
- 2015

In this work, we initiate a detailed study of the parameterized complexity of Minimax Approval Voting. We demonstrate that the problem is W[2]-hard when parameterized by the size of the committee to… (More)

- Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh
- ArXiv
- 2012

Let F be a finite set of graphs. In the F-Deletion problem, we are given an n-vertex, m-edge graph G and an integer k as input, and asked whether at most k vertices can be deleted from G such that… (More)

- Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh
- Journal of Graph Theory
- 2013

According to the classical Erdős–Pósa theorem, given a positive integer k, every graph G either contains k vertex disjoint cycles or a set of at most O(k log k) vertices that hits all its cycles.… (More)

In the framework of parameterized complexity, one of the most commonly used structural parameters is the treewidth of the input graph. The reason for this is that most natural graph problems turn out… (More)

We study a general class of problems called F -Deletion problems. In an F -Deletion problem, we are asked whether a subset of at most k vertices can be deleted from a graph G such that the resulting… (More)

- Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh
- COCOON
- 2011

We investigate a generalization of the classical Feedback Vertex Set (FVS) problem from the point of view of parameterized algorithms. Independent Feedback Vertex Set (IFVS) is the “independent”… (More)

- Palash Dey, Neeldhara Misra, Y. Narahari
- AAMAS
- 2015

In the Possible Winner problem in computational social choice theory, we are given a set of partial preferences and the question is whether a distinguished candidate could be made winner by extending… (More)

- Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh
- IPEC
- 2013

Graph modification problems such as vertex deletion, edge deletion or edge contractions are a fundamental class of optimization problems. Recently, the parameterized complexity of the contractibility… (More)