Martin Vatshelle

Comput. Geom., 2017

2015

Solving #SAT and MAXSAT by Dynamic Programming.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2015

Hardness of computing width parameters based on branch decompositions over the vertex set.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Constructions of k-critical P5-free graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

An Algorithm for the Maximum Weight Independent Set Problem onOutersting Graphs.

[BibT_eX]

[DOI]

J. Mark Keil

Joseph S. B. Mitchell

Dinabandhu Pradhan

Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014

Faster algorithms for vertex partitioning problems parameterized by clique-width.

[BibT_eX]

[DOI]

Sang-il Oum

Theor. Comput. Sci., 2014

Independent Set in <i>P</i><sub>5</sub>-Free Graphs in Polynomial Time.

[BibT_eX]

[DOI]

Daniel Lokshtanov

Yngve Villanger

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Solving MaxSAT and #SAT on Structured CNF Formulas.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014

2013

Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Graph classes with structured neighborhoods and algorithmic applications.

[BibT_eX]

[DOI]

Rémy Belmonte

Theor. Comput. Sci., 2013

The Point-Set Embeddability Problem for Plane graphs.

[BibT_eX]

[DOI]

Therese Biedl

Int. J. Comput. Geom. Appl., 2013

Feedback vertex set on graphs of low clique-width.

[BibT_eX]

[DOI]

Eur. J. Comb., 2013

Faster Algorithms Parameterized by Clique-width.

[BibT_eX]

[DOI]

Sang-il Oum

CoRR, 2013

Upper Bounds on Boolean-Width with Applications to Exact Algorithms.

[BibT_eX]

[DOI]

Yuri Rabinovich

Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

2012

k-Gap Interval Graphs.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

2011

Boolean-width of graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Finding Good Decompositions for Dynamic Programming on Dense Graphs.

[BibT_eX]

[DOI]

Eivind Magnus Hvidevold

Sadia Sharmin

Proceedings of the Parameterized and Exact Computation - 6th International Symposium, 2011

2010

Recognizing digraphs of Kelly-width 2.

[BibT_eX]

[DOI]

Daniel Meister

Discret. Appl. Math., 2010

H-join decomposable graphs and algorithms with runtime single exponential in rankwidth.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

On graph classes with logarithmic boolean-width

[BibT_eX]

[DOI]

Rémy Belmonte

CoRR, 2010

On the Boolean-Width of a Graph: Structure and Applications.

[BibT_eX]

[DOI]

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Faster Algorithms on Branch and Clique Decompositions.

[BibT_eX]

[DOI]

Hans L. Bodlaender

Erik Jan van Leeuwen

Johan M. M. van Rooij

Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

2009

Fast FPT algorithms for vertex subset and vertex partitioning problems using neighborhood unions

[BibT_eX]

[DOI]

CoRR, 2009

Feedback Vertex Set on Graphs of Low Cliquewidth.

[BibT_eX]

[DOI]

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

2007

Characterization and Recognition of Digraphs of Bounded Kelly-width.

[BibT_eX]

[DOI]

Daniel Meister