|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 3 occurrences of 3 keywords
|
|
|
|
|
Results
Found 15 publication records. Showing 15 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh |
Planar F-Deletion: Approximation and Optimal FPT Algorithms  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Neeldhara Misra, Venkatesh Raman, Saket Saurabh |
Lower bounds on kernelization. |
Discrete Optimization |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh |
Hitting forbidden minors: Approximation and Kernelization. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh |
On Parameterized Independent Feedback Vertex Set. |
COCOON |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | S. Arumugam, K. Raja Chandrasekar, Neeldhara Misra, Geevarghese Philip, Saket Saurabh |
Algorithmic Aspects of Dominator Colorings in Graphs. |
IWOCA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh |
Hitting forbidden minors: Approximation and Kernelization |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Raman, Bal Sri Shankar |
Solving minones-2-sat as Fast as vertex cover. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Abhimanyu M. Ambalath, Radheshyam Balasundaram, Chintan Rao H., Venkata Koppula, Neeldhara Misra, Geevarghese Philip, M. S. Ramanujan |
On the Kernelization Complexity of Colorful Motifs. |
IPEC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar |
FPT Algorithms for Connected Feedback Vertex Set. |
WALCOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh |
Imbalance Is Fixed Parameter Tractable. |
COCOON |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh |
The effect of girth on the kernelization complexity of Connected Dominating Set. |
FSTTCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar |
FPT Algorithms for Connected Feedback Vertex Set |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Matthias Mnich, Frances A. Rosamond, Saket Saurabh |
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number. |
Theory Comput. Syst. |
2009 |
DBLP DOI BibTeX RDF |
Max-leaf, Well-quasiordering, Bandwidth, Kernelization, Parameterized complexity |
| 1 | Neeldhara Misra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar |
The Budgeted Unique Coverage Problem and Color-Coding. |
CSR |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, Saket Saurabh |
Graph Layout Problems Parameterized by Vertex Cover. |
ISAAC |
2008 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #15 of 15 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")