| Publication | Date of Publication | Type |
|---|
| PACE solver description: Zygosity | 2025-09-24 | Paper |
Recognition of linear and star variants of leaf powers is in P
Graph-Theoretic Concepts in Computer Science | 2023-05-05 | Paper |
Independent set in \(P_5\)-free graphs in polynomial time
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
An algorithm for the maximum weight independent set problem on outerstring graphs
Computational Geometry | 2018-01-22 | Paper |
Hardness of computing width parameters based on branch decompositions over the vertex set
Electronic Notes in Discrete Mathematics | 2016-10-14 | Paper |
Hardness of computing width parameters based on branch decompositions over the vertex set
Theoretical Computer Science | 2016-01-21 | Paper |
Solving #SAT and MAXSAT by Dynamic Programming
Journal of Artificial Intelligence Research | 2015-10-29 | Paper |
Solving MaxSAT and \#SAT on structured CNF formulas
Lecture Notes in Computer Science | 2014-09-26 | Paper |
The point-set embeddability problem for plane graphs
International Journal of Computational Geometry & Applications | 2014-08-11 | Paper |
The point-set embeddability problem for plane graphs
Proceedings of the twenty-eighth annual symposium on Computational geometry | 2014-08-07 | Paper |
Faster algorithms for vertex partitioning problems parameterized by clique-width
Theoretical Computer Science | 2014-04-29 | Paper |
Graph classes with structured neighborhoods and algorithmic applications
Theoretical Computer Science | 2014-01-13 | Paper |
Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
Theoretical Computer Science | 2014-01-13 | Paper |
Upper Bounds on Boolean-Width with Applications to Exact Algorithms
Parameterized and Exact Computation | 2013-12-10 | Paper |
| scientific article; zbMATH DE number 6180528 (Why is no real title available?) | 2013-06-25 | Paper |
Feedback vertex set on graphs of low clique-width
European Journal of Combinatorics | 2013-01-24 | Paper |
\(k\)-gap interval graphs
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
Finding good decompositions for dynamic programming on dense graphs
Parameterized and Exact Computation | 2012-06-15 | Paper |
Graph classes with structured neighborhoods and algorithmic applications
Graph-Theoretic Concepts in Computer Science | 2011-12-16 | Paper |
Boolean-width of graphs
Theoretical Computer Science | 2011-10-10 | Paper |
On the Boolean-width of a graph: structure and applications
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
Faster algorithms on branch and clique decompositions
Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
\(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth
Discrete Applied Mathematics | 2010-05-25 | Paper |
Recognizing digraphs of Kelly-width 2
Discrete Applied Mathematics | 2010-05-25 | Paper |
Boolean-width of graphs
Parameterized and Exact Computation | 2010-01-14 | Paper |
Feedback vertex set on graphs of low cliquewidth
Lecture Notes in Computer Science | 2009-12-11 | Paper |
Characterization and Recognition of Digraphs of Bounded Kelly-width
Graph-Theoretic Concepts in Computer Science | 2008-07-01 | Paper |
