A New (2, n)-Visual Threshold Scheme for Color Images. - Avishek Adhikari; Somnath Sikdar (INDOCRYPT, 2003)

Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems. - Venkatesh Raman 001; Saket Saurabh 001; Somnath Sikdar (ICTCS, 2005)

Parameterizing MAX SNP Problems Above Guaranteed Values. - Meena Mahajan; Venkatesh Raman 001; Somnath Sikdar (IWPEC, 2006)

The Parameterized Complexity of the Induced Matching Problem in Planar Graphs. - Hannes Moser; Somnath Sikdar (FAW, 2007)

The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number. - Sounaka Mishra; Venkatesh Raman 001; Saket Saurabh 001; Somnath Sikdar; C. R. Subramanian 001 (ISAAC, 2007)

The Parameterized Complexity of the Unique Coverage Problem. - Hannes Moser; Venkatesh Raman 001; Somnath Sikdar (ISAAC, 2007)

Parameterized complexity of the induced subgraph problem in directed graphs. - Venkatesh Raman 001; Somnath Sikdar (Inf. Process. Lett., 2007)

Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques. - Venkatesh Raman 001; Saket Saurabh 001; Somnath Sikdar (Theory Comput. Syst., 2007)

The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants. - Michael Dom; Somnath Sikdar (FAW, 2008)

König Deletion Sets and Vertex Covers above the Matching Size. - Sounaka Mishra; Venkatesh Raman 001; Saket Saurabh 001; Somnath Sikdar (ISAAC, 2008)

The Budgeted Unique Coverage Problem and Color-Coding. - Neeldhara Misra; Venkatesh Raman 001; Saket Saurabh 001; Somnath Sikdar (CSR, 2009)

Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels. - Geevarghese Philip; Venkatesh Raman 001; Somnath Sikdar (ESA, 2009)

Simpler Parameterized Algorithm for OCT. - Daniel Lokshtanov; Saket Saurabh 001; Somnath Sikdar (IWOCA, 2009)

On the Directed Degree-Preserving Spanning Tree Problem. - Daniel Lokshtanov; Venkatesh Raman 001; Saket Saurabh 001; Somnath Sikdar (IWPEC, 2009)

Polynomial Kernels for Dominating Set in Ki,j-free and d-degenerate Graphs - Geevarghese Philip; Venkatesh Raman 001; Somnath Sikdar (CoRR, 2009)

The parameterized complexity of the induced matching problem. - Hannes Moser; Somnath Sikdar (Discret. Appl. Math., 2009)

Parameterizing above or below guaranteed values. - Meena Mahajan; Venkatesh Raman 001; Somnath Sikdar (J. Comput. Syst. Sci., 2009)

Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory - (Extended Abstract). - Alexander Langer; Peter Rossmanith; Somnath Sikdar (TAMC, 2011)

The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover. - Sounaka Mishra; Venkatesh Raman 001; Saket Saurabh 001; Somnath Sikdar; C. R. Subramanian 001 (Algorithmica, 2011)

Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory - Alexander Langer; Peter Rossmanith; Somnath Sikdar (CoRR, 2011)

Lower Bounds on the Complexity of MSO1 Model-Checking - Robert Ganian; Petr Hlinený; Alexander Langer; Jan Obdrzálek; Peter Rossmanith; Somnath Sikdar (CoRR, 2011)

On the directed Full Degree Spanning Tree problem. - Daniel Lokshtanov; Venkatesh Raman 001; Saket Saurabh 001; Somnath Sikdar (Discret. Optim., 2011)

Evaluation of an MSO-Solver. - Alexander Langer; Felix Reidl; Peter Rossmanith; Somnath Sikdar (ALENEX, 2012)

Lower Bounds on the Complexity of MSO_1 Model-Checking. - Robert Ganian; Petr Hlinený; Alexander Langer; Jan Obdrzálek; Peter Rossmanith; Somnath Sikdar (STACS, 2012)

The Parameterized Complexity of Stabbing Rectangles. - Michael Dom; Michael R. Fellows; Frances A. Rosamond; Somnath Sikdar (Algorithmica, 2012)

Linear Kernels on Graphs Excluding Topological Minors - Alexander Langer; Felix Reidl; Peter Rossmanith; Somnath Sikdar (CoRR, 2012)

FPT algorithms for Connected Feedback Vertex Set. - Neeldhara Misra; Geevarghese Philip; Venkatesh Raman 001; Saket Saurabh 001; Somnath Sikdar (J. Comb. Optim., 2012)

Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond. - Geevarghese Philip; Venkatesh Raman 001; Somnath Sikdar (ACM Trans. Algorithms, 2012)

The Parameterized Complexity of Unique Coverage and Its Variants. - Neeldhara Misra; Hannes Moser; Venkatesh Raman 001; Saket Saurabh 001; Somnath Sikdar (Algorithmica, 2013)

A Faster Parameterized Algorithm for Treedepth. - Felix Reidl; Peter Rossmanith; Fernando Sánchez Villaamil; Somnath Sikdar (ICALP (1), 2014)

Finite Integer Index of Pathwidth and Treewidth. - Jakub Gajarský; Jan Obdrzálek; Sebastian Ordyniak; Felix Reidl; Peter Rossmanith; Fernando Sánchez Villaamil; Somnath Sikdar (IPEC, 2014)

Structural Sparsity of Complex Networks: Random Graph Models and Linear Algorithms. - Erik D. Demaine; Felix Reidl; Peter Rossmanith; Fernando Sánchez Villaamil; Somnath Sikdar; Blair D. Sullivan (CoRR, 2014)

Kernelization and Sparseness: the case of Dominating Set. - Pål Grønås Drange; Markus S. Dregi; Fedor V. Fomin; Stephan Kreutzer; Daniel Lokshtanov; Marcin Pilipczuk; Michal Pilipczuk; Felix Reidl; Saket Saurabh 001; Fernando Sánchez Villaamil; Somnath Sikdar (CoRR, 2014)

Overlapping Communities in Social Networks. - Jan Dreier; Philipp Kuinke; Rafael Przybylski; Felix Reidl; Peter Rossmanith; Somnath Sikdar (CoRR, 2014)

Practical algorithms for MSO model-checking on tree-decomposable graphs. - Alexander Langer; Felix Reidl; Peter Rossmanith; Somnath Sikdar (Comput. Sci. Rev., 2014)

Lower bounds on the complexity of MSO1 model-checking. - Robert Ganian; Petr Hlinený; Alexander Langer; Jan Obdrzálek; Peter Rossmanith; Somnath Sikdar (J. Comput. Syst. Sci., 2014)

Fast Biclustering by Dual Parameterization. - Pål Grønås Drange; Felix Reidl; Fernando Sánchez Villaamil; Somnath Sikdar (IPEC, 2015)

Kernelization and Sparseness: the Case of Dominating Set. - 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 001; Sebastian Siebertz; Somnath Sikdar (STACS, 2016)

Are there any good digraph width measures? - Robert Ganian; Petr Hlinený; Joachim Kneis; Daniel Meister 001; Jan Obdrzálek; Peter Rossmanith; Somnath Sikdar (J. Comb. Theory B, 2016)

Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions. - Eun Jung Kim 002; Alexander Langer; Christophe Paul; Felix Reidl; Peter Rossmanith; Ignasi Sau; Somnath Sikdar (ACM Trans. Algorithms, 2016)

Kernelization using structural parameters on sparse graph classes. - Jakub Gajarský; Petr Hlinený; Jan Obdrzálek; Sebastian Ordyniak; Felix Reidl; Peter Rossmanith; Fernando Sánchez Villaamil; Somnath Sikdar (J. Comput. Syst. Sci., 2017)

Moderately exponential time algorithms for the maximum bounded-degree-1 set problem. - Maw-Shang Chang; Li-Hsuan Chen; Ling-Ju Hung; Yi-Zhi Liu; Peter Rossmanith; Somnath Sikdar (Discret. Appl. Math., 2018)

Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs. - Erik D. Demaine; Felix Reidl; Peter Rossmanith; Fernando Sánchez Villaamil; Somnath Sikdar; Blair D. Sullivan (J. Comput. Syst. Sci., 2019)