#### Filter Results:

- Full text PDF available (24)

#### Publication Year

2000

2019

- This year (11)
- Last 5 years (52)
- Last 10 years (89)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn 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)

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)

- Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh
- IEEE 53rd Annual Symposium on Foundations of…
- 2012

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

In this paper we extend the classical notion of strong and weak backdoor sets for SAT and CSP by allowing that different instantiations of the backdoor variables result in instances that belong to… (More)

- Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh
- The Multivariate Algorithmic Revolution and…
- 2012

Data reduction techniques are widely applied to deal with computationally hard problems in real world applications. It has been a long-standing challenge to formally express the efficiency and… (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)

- Abhimanyu M. Ambalath, Radheshyam Balasundaram, +4 authors M. S. Ramanujan
- IPEC
- 2010

The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every color in the graph… (More)

- Neeldhara Misra, Fahad Panolan, Saket Saurabh
- MFCS
- 2013

The correlation clustering problem is a fundamental problem in both theory and practice, and it involves identifying clusters of objects in a data set based on their similarity. A traditional… (More)