|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
No Growbag Graphs found.
|
|
|
|
|
Results
Found 20 publication records. Showing 20 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Eun Jung Kim, Christophe Paul, Geevarghese Philip |
A single-exponential FPT algorithm for the $K_4$-minor cover problem  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Marek Cygan, Geevarghese Philip, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk |
Dominating set is fixed parameter tractable in claw-free graphs.  |
Theor. Comput. Sci.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Bredereck, André Nichterlein, Rolf Niedermeier, Geevarghese Philip |
Pattern-Guided Data Anonymization and Clustering.  |
MFCS  |
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 | Robert Bredereck, André Nichterlein, Rolf Niedermeier, Geevarghese Philip |
The Effect of Homogeneity on the Complexity of k-Anonymity.  |
FCT  |
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, Geevarghese Philip, Yngve Villanger |
Minimum Fill-in of Sparse Graphs: Kernelization and Approximation.  |
FSTTCS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Geevarghese Philip, Venkatesh Raman, Yngve Villanger |
A Quartic Kernel for Pathwidth-One Vertex Deletion  |
CoRR  |
2010 |
DBLP 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 | Marek Cygan, Geevarghese Philip, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk |
Dominating Set is Fixed Parameter Tractable in Claw-free Graphs  |
CoRR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Geevarghese Philip, Venkatesh Raman, Yngve Villanger |
A Quartic Kernel for Pathwidth-One Vertex Deletion.  |
WG  |
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 | Henning Fernau, Fedor V. Fomin, Geevarghese Philip, Saket Saurabh |
The Curse of Connectivity: t-Total Vertex (Edge) Cover.  |
COCOON  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Matthias Mnich, Geevarghese Philip, Saket Saurabh |
Ranking and Drawing in Subexponential Time.  |
IWOCA  |
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 | Geevarghese Philip, Venkatesh Raman, Somnath Sikdar |
Polynomial Kernels for Dominating Set in $K_{i,j}$-free and d-degenerate Graphs  |
CoRR  |
2009 |
DBLP 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 | Geevarghese Philip, Venkatesh Raman, Somnath Sikdar |
Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels.  |
ESA  |
2009 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #20 of 20 (100 per page; Change: )
|
|