Somnath Sikdar

Blair D. Sullivan

J. Comput. Syst. Sci., 2019

2018

Moderately exponential time algorithms for the maximum bounded-degree-1 set problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

2017

Kernelization using structural parameters on sparse graph classes.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2017

2016

Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2016

Are there any good digraph width measures?

[BibT_eX]

[DOI]

J. Comb. Theory B, 2016

Kernelization and Sparseness: the Case of Dominating Set.

[BibT_eX]

[DOI]

Pål Grønås Drange

Markus Sortland Dregi

Sebastian Siebertz

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

2015

Fast Biclustering by Dual Parameterization.

[BibT_eX]

[DOI]

Pål Grønås Drange

Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015

2014

Lower bounds on the complexity of MSO<sub>1</sub> model-checking.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2014

Practical algorithms for MSO model-checking on tree-decomposable graphs.

[BibT_eX]

[DOI]

Comput. Sci. Rev., 2014

Overlapping Communities in Social Networks.

[BibT_eX]

[DOI]

CoRR, 2014

Kernelization and Sparseness: the case of Dominating Set.

[BibT_eX]

[DOI]

CoRR, 2014

Structural Sparsity of Complex Networks: Random Graph Models and Linear Algorithms.

[BibT_eX]

[DOI]

Erik D. Demaine

Blair D. Sullivan

CoRR, 2014

Finite Integer Index of Pathwidth and Treewidth.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

A Faster Parameterized Algorithm for Treedepth.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013

The Parameterized Complexity of Unique Coverage and Its Variants.

[BibT_eX]

[DOI]

Algorithmica, 2013

2012

Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond.

[BibT_eX]

[DOI]

Geevarghese Philip

ACM Trans. Algorithms, 2012

FPT algorithms for Connected Feedback Vertex Set.

[BibT_eX]

[DOI]

J. Comb. Optim., 2012

Linear Kernels on Graphs Excluding Topological Minors

[BibT_eX]

[DOI]

CoRR, 2012

The Parameterized Complexity of Stabbing Rectangles.

[BibT_eX]

[DOI]

Algorithmica, 2012

Lower Bounds on the Complexity of MSO_1 Model-Checking.

[BibT_eX]

[DOI]

Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

Evaluation of an MSO-Solver.

[BibT_eX]

[DOI]

Proceedings of the 14th Meeting on Algorithm Engineering & Experiments, 2012

2011

On the directed Full Degree Spanning Tree problem.

[BibT_eX]

[DOI]

Discret. Optim., 2011

Lower Bounds on the Complexity of MSO1 Model-Checking

[BibT_eX]

[DOI]

CoRR, 2011

Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory

[BibT_eX]

[DOI]

Alexander Langer

CoRR, 2011

The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover.

[BibT_eX]

[DOI]

Algorithmica, 2011

Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory - (Extended Abstract).

[BibT_eX]

[DOI]

Alexander Langer

Proceedings of the Theory and Applications of Models of Computation, 2011

2009

Parameterizing above or below guaranteed values.

[BibT_eX]

[DOI]

Meena Mahajan

J. Comput. Syst. Sci., 2009

The parameterized complexity of the induced matching problem.

[BibT_eX]

[DOI]

Hannes Moser

Discret. Appl. Math., 2009

Polynomial Kernels for Dominating Set in K<sub>i,j</sub>-free and d-degenerate Graphs

[BibT_eX]

[DOI]

Geevarghese Philip

CoRR, 2009

On the Directed Degree-Preserving Spanning Tree Problem.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009

Simpler Parameterized Algorithm for OCT.

[BibT_eX]

[DOI]

Daniel Lokshtanov

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels.

[BibT_eX]

[DOI]

Geevarghese Philip

Proceedings of the Algorithms, 2009

The Budgeted Unique Coverage Problem and Color-Coding.

[BibT_eX]

[DOI]

Proceedings of the Computer Science, 2009

2008

König Deletion Sets and Vertex Covers above the Matching Size.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants.

[BibT_eX]

[DOI]

Michael Dom

Proceedings of the Frontiers in Algorithmics, Second Annual International Workshop, 2008

2007

Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2007

Parameterized complexity of the induced subgraph problem in directed graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2007

The Parameterized Complexity of the Unique Coverage Problem.

[BibT_eX]

[DOI]

Hannes Moser

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

The Parameterized Complexity of the Induced Matching Problem in Planar Graphs.

[BibT_eX]

[DOI]

Hannes Moser

Proceedings of the Frontiers in Algorithmics, First Annual International Workshop, 2007

2006

Parameterizing MAX SNP Problems Above Guaranteed Values.

[BibT_eX]

[DOI]

Meena Mahajan

Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006

2005

Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 9th Italian Conference, 2005

2003

A New (2, n)-Visual Threshold Scheme for Color Images.

[BibT_eX]

[DOI]

Avishek Adhikari