Somnath Sikdar

53 papers A 5B 7C 2Misc 4Journal 30Unranked 5
YearRankTypeTitle / Venue / Authors
2019 J jnl
Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs.
J. Comput. Syst. Sci.
Erik D. Demaine, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar, Blair D. Sullivan
2018 J jnl
Moderately exponential time algorithms for the maximum bounded-degree-1 set problem.
Discret. Appl. Math.
Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung, Yi-Zhi Liu, Peter Rossmanith, Somnath Sikdar
2017 J jnl
Kernelization using structural parameters on sparse graph classes.
J. Comput. Syst. Sci.
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar
2016 J jnl
Are there any good digraph width measures?
J. Comb. Theory B
Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
2016 A conf
Kernelization and Sparseness: the Case of Dominating Set.
STACS
Pål Grønås Drange, Markus Sortland Dregi, Fedor V. Fomin, Stephan Kreutzer, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Felix Reidl, Fernando Sánchez Villaamil, Saket Saurabh, Sebastian Siebertz, Somnath Sikdar
2016 J jnl
Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions.
ACM Trans. Algorithms
Eun Jung Kim, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau, Somnath Sikdar
2015 B conf
Fast Biclustering by Dual Parameterization.
IPEC
Pål Grønås Drange, Felix Reidl, Fernando Sánchez Villaamil, Somnath Sikdar
2015 J jnl
Fast Biclustering by Dual Parameterization.
CoRR
Pål Grønås Drange, Felix Reidl, Fernando Sánchez Villaamil, Somnath Sikdar
2014 — conf
A Faster Parameterized Algorithm for Treedepth.
ICALP (1)
Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar
2014 J jnl
A Faster Parameterized Algorithm for Treedepth.
CoRR
Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar
2014 B conf
Finite Integer Index of Pathwidth and Treewidth.
IPEC
Jakub Gajarský, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar
2014 J jnl
Kernelization and Sparseness: the case of Dominating Set.
CoRR
Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Stephan Kreutzer, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Felix Reidl, Saket Saurabh, Fernando Sánchez Villaamil, Somnath Sikdar
2014 J jnl
Lower bounds on the complexity of MSO
J. Comput. Syst. Sci.
Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
2014 J jnl
Overlapping Communities in Social Networks.
CoRR
Jan Dreier, Philipp Kuinke, Rafael Przybylski, Felix Reidl, Peter Rossmanith, Somnath Sikdar
2014 J jnl
Practical algorithms for MSO model-checking on tree-decomposable graphs.
Comput. Sci. Rev.
Alexander Langer, Felix Reidl, Peter Rossmanith, Somnath Sikdar
2014 J jnl
Structural Sparsity of Complex Networks: Random Graph Models and Linear Algorithms.
CoRR
Erik D. Demaine, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar, Blair D. Sullivan
2013 J jnl
Kernelization Using Structural Parameters on Sparse Graph Classes
CoRR
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar
2013 A conf
Kernelization Using Structural Parameters on Sparse Graph Classes.
ESA
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar
2013 — conf
Linear Kernels and Single-Exponential Algorithms via Protrusion Decompositions.
ICALP (1)
Eun Jung Kim, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau, Somnath Sikdar
2013 J jnl
The Parameterized Complexity of Unique Coverage and Its Variants.
Algorithmica
Neeldhara Misra, Hannes Moser, Venkatesh Raman, Saket Saurabh, Somnath Sikdar
2012 A conf
Evaluation of an MSO-Solver.
ALENEX
Alexander Langer, Felix Reidl, Peter Rossmanith, Somnath Sikdar
2012 J jnl
FPT algorithms for Connected Feedback Vertex Set.
J. Comb. Optim.
Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar
2012 J jnl
Linear Kernels on Graphs Excluding Topological Minors
CoRR
Alexander Langer, Felix Reidl, Peter Rossmanith, Somnath Sikdar
2012 J jnl
Linear kernels and single-exponential algorithms via protrusion decompositions
CoRR
Eun Jung Kim, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau, Somnath Sikdar
2012 A conf
Lower Bounds on the Complexity of MSO_1 Model-Checking.
STACS
Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
2012 J jnl
Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond.
ACM Trans. Algorithms
Geevarghese Philip, Venkatesh Raman, Somnath Sikdar
2012 J jnl
The Parameterized Complexity of Stabbing Rectangles.
Algorithmica
Michael Dom, Michael R. Fellows, Frances A. Rosamond, Somnath Sikdar
2011 J jnl
Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory
CoRR
Alexander Langer, Peter Rossmanith, Somnath Sikdar
2011 C conf
Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory - (Extended Abstract).
TAMC
Alexander Langer, Peter Rossmanith, Somnath Sikdar
2011 J jnl
Lower Bounds on the Complexity of MSO1 Model-Checking
CoRR
Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
2011 J jnl
On the directed Full Degree Spanning Tree problem.
Discret. Optim.
Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, Somnath Sikdar
2011 J jnl
The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover.
Algorithmica
Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar, C. R. Subramanian
2010 B conf
Are There Any Good Digraph Width Measures?
IPEC
Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
2010 J jnl
Are there any good digraph width measures?
CoRR
Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar
2010 B conf
FPT Algorithms for Connected Feedback Vertex Set.
WALCOM
Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar
2009 J jnl
FPT Algorithms for Connected Feedback Vertex Set
CoRR
Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar
2009 — conf
On the Directed Degree-Preserving Spanning Tree Problem.
IWPEC
Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, Somnath Sikdar
2009 J jnl
Parameterizing above or below guaranteed values.
J. Comput. Syst. Sci.
Meena Mahajan, Venkatesh Raman, Somnath Sikdar
2009 J jnl
Polynomial Kernels for Dominating Set in K
CoRR
Geevarghese Philip, Venkatesh Raman, Somnath Sikdar
2009 C conf
Simpler Parameterized Algorithm for OCT.
IWOCA
Daniel Lokshtanov, Saket Saurabh, Somnath Sikdar
2009 A conf
Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels.
ESA
Geevarghese Philip, Venkatesh Raman, Somnath Sikdar
2009 Misc conf
The Budgeted Unique Coverage Problem and Color-Coding.
CSR
Neeldhara Misra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar
2009 J jnl
The parameterized complexity of the induced matching problem.
Discret. Appl. Math.
Hannes Moser, Somnath Sikdar
2008 B conf
König Deletion Sets and Vertex Covers above the Matching Size.
ISAAC
Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar
2008 Misc conf
The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants.
FAW
Michael Dom, Somnath Sikdar
2007 J jnl
Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques.
Theory Comput. Syst.
Venkatesh Raman, Saket Saurabh, Somnath Sikdar
2007 J jnl
Parameterized complexity of the induced subgraph problem in directed graphs.
Inf. Process. Lett.
Venkatesh Raman, Somnath Sikdar
2007 B conf
The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number.
ISAAC
Sounaka Mishra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar, C. R. Subramanian
2007 Misc conf
The Parameterized Complexity of the Induced Matching Problem in Planar Graphs.
FAW
Hannes Moser, Somnath Sikdar
2007 B conf
The Parameterized Complexity of the Unique Coverage Problem.
ISAAC
Hannes Moser, Venkatesh Raman, Somnath Sikdar
2006 — conf
Parameterizing MAX SNP Problems Above Guaranteed Values.
IWPEC
Meena Mahajan, Venkatesh Raman, Somnath Sikdar
2005 — conf
Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems.
ICTCS
Venkatesh Raman, Saket Saurabh, Somnath Sikdar
2003 Misc conf
A New (2, n)-Visual Threshold Scheme for Color Images.
INDOCRYPT
Avishek Adhikari, Somnath Sikdar