|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
No Growbag Graphs found.
|
|
|
|
|
Results
Found 29 publication records. Showing 29 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Michael Dom, Michael R. Fellows, Frances A. Rosamond, Somnath Sikdar |
The Parameterized Complexity of Stabbing Rectangles.  |
Algorithmica  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Langer, Felix Reidl, Peter Rossmanith, Somnath Sikdar |
Linear Kernels on Graphs Excluding Topological Minors |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar |
Lower Bounds on the Complexity of MSO_1 Model-Checking. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, Somnath Sikdar |
On the directed Full Degree Spanning Tree problem. |
Discrete Optimization |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar, C. R. Subramanian |
The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar |
Lower Bounds on the Complexity of MSO1 Model-Checking |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Alexander Langer, Peter Rossmanith, Somnath Sikdar |
Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Alexander Langer, Peter Rossmanith, Somnath Sikdar |
Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory - (Extended Abstract). |
TAMC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar |
Are there any good digraph width measures? |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar |
Are There Any Good Digraph Width Measures? |
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 | 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 | Hannes Moser, Somnath Sikdar |
The parameterized complexity of the induced matching problem. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Meena Mahajan, Venkatesh Raman, Somnath Sikdar |
Parameterizing above or below guaranteed values. |
J. Comput. Syst. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Neeldhara Misra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar |
The Budgeted Unique Coverage Problem and Color-Coding. |
CSR |
2009 |
DBLP DOI 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 |
|
| 1 | Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, Somnath Sikdar |
On the Directed Degree-Preserving Spanning Tree Problem. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Saket Saurabh, Somnath Sikdar |
Simpler Parameterized Algorithm for OCT. |
IWOCA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Dom, Somnath Sikdar |
The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants. |
FAW |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar |
König Deletion Sets and Vertex Covers above the Matching Size. |
ISAAC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesh Raman, Somnath Sikdar |
Parameterized complexity of the induced subgraph problem in directed graphs. |
Inf. Process. Lett. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesh Raman, Saket Saurabh, Somnath Sikdar |
Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques. |
Theory Comput. Syst. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Hannes Moser, Somnath Sikdar |
The Parameterized Complexity of the Induced Matching Problem in Planar Graphs. |
FAW |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar, C. R. Subramanian |
The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number. |
ISAAC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Hannes Moser, Venkatesh Raman, Somnath Sikdar |
The Parameterized Complexity of the Unique Coverage Problem. |
ISAAC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Meena Mahajan, Venkatesh Raman, Somnath Sikdar |
Parameterizing MAX SNP Problems Above Guaranteed Values. |
IWPEC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesh Raman, Saket Saurabh, Somnath Sikdar |
Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems. |
ICTCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Avishek Adhikari, Somnath Sikdar |
A New (2, n)-Visual Threshold Scheme for Color Images. |
INDOCRYPT |
2003 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #29 of 29 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")