Somnath Sikdar
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
17
Venues
11
Active years
2003–2016
Best venue rank
A*
Where they publish
Papers
17 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2016 | STACS | Kernelization and Sparseness: the Case of Dominating Set. | Pl Grns Drange, Markus Sortland Dregi, Fedor V. Fomin, Stephan Kreutzer, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Felix Reidl, Fernando Snchez Villaamil, Saket Saurabh, Sebastian Siebertz, Somnath Sikdar |
| 2014 | ICALP | A Faster Parameterized Algorithm for Treedepth. | Felix Reidl, Peter Rossmanith, Fernando Snchez Villaamil, Somnath Sikdar |
| 2013 | ESA | Kernelization Using Structural Parameters on Sparse Graph Classes. | Jakub Gajarsk, Petr Hlinen, Jan Obdrzlek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Snchez Villaamil, Somnath Sikdar |
| 2013 | ICALP | Linear Kernels and Single-Exponential Algorithms via Protrusion Decompositions. | Eun Jung Kim, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau, Somnath Sikdar |
| 2012 | ALENEX | Evaluation of an MSO-Solver. | Alexander Langer, Felix Reidl, Peter Rossmanith, Somnath Sikdar |
| 2012 | STACS | Lower Bounds on the Complexity of MSO_1 Model-Checking. | Robert Ganian, Petr Hlinen, Alexander Langer, Jan Obdrzlek, Peter Rossmanith, Somnath Sikdar |
| 2011 | TAMC | Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory - (Extended Abstract). | Alexander Langer, Peter Rossmanith, Somnath Sikdar |
| 2010 | WALCOM | FPT Algorithms for Connected Feedback Vertex Set. | Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar |
| 2009 | CSR | The Budgeted Unique Coverage Problem and Color-Coding. | Neeldhara Misra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar |
| 2009 | ESA | Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels. | Geevarghese Philip, Venkatesh Raman, Somnath Sikdar |
| 2009 | IWOCA | Simpler Parameterized Algorithm for OCT. | Daniel Lokshtanov, Saket Saurabh, Somnath Sikdar |
| 2008 | FAW | The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants. | Michael Dom, Somnath Sikdar |
| 2008 | ISAAC | Knig Deletion Sets and Vertex Covers above the Matching Size. | Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar |
| 2007 | FAW | The Parameterized Complexity of the Induced Matching Problem in Planar Graphs. | Hannes Moser, Somnath Sikdar |
| 2007 | ISAAC | The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number. | Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar, C. R. Subramanian |
| 2007 | ISAAC | The Parameterized Complexity of the Unique Coverage Problem. | Hannes Moser, Venkatesh Raman, Somnath Sikdar |
| 2003 | INDOCRYPT | A New (2, n)-Visual Threshold Scheme for Color Images. | Avishek Adhikari, Somnath Sikdar |