| Publication | Date of Publication | Type |
|---|
| Classes of intersection digraphs with good algorithmic properties | 2024-03-25 | Paper |
| Complexity of graph covering problems | 2024-01-05 | Paper |
| Recognition of linear and star variants of leaf powers is in P | 2023-05-05 | Paper |
| Typical sequences revisited -- computing width parameters of graphs | 2023-04-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874334 | 2023-02-07 | Paper |
| Practical algorithms on partial k-trees with an application to domination-like problems | 2023-01-18 | Paper |
| Node multiway cut and subset feedback vertex set on graphs of bounded mim-width | 2022-12-21 | Paper |
| Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning | 2022-12-09 | Paper |
| Memory requirements for table computations in partial k-tree algorithms | 2022-12-09 | Paper |
| The perfect matching cut problem revisited | 2022-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089215 | 2022-07-18 | Paper |
| The perfect matching cut problem revisited | 2022-06-08 | Paper |
| On Dasgupta's hierarchical clustering objective and its relation to other graph parameters | 2022-05-20 | Paper |
| Node multiway cut and subset feedback vertex set on graphs of bounded mim-width | 2022-05-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009468 | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3304141 | 2020-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111880 | 2020-05-27 | Paper |
| Mim-width. I. Induced path problems | 2020-04-21 | Paper |
| Linear MIM-width of trees | 2020-02-24 | Paper |
| Mim-width. II. The feedback vertex set problem | 2020-01-16 | Paper |
| Mim-width. III. Graph powers and generalized distance domination problems | 2019-11-13 | Paper |
| The teaching size: computable teachers and learners for universal languages | 2019-08-23 | Paper |
| FPT algorithms for domination in sparse graphs and beyond | 2019-05-02 | Paper |
| Maximum matching width: new characterizations and a fast algorithm for dominating set | 2018-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4634397 | 2018-04-10 | Paper |
| A width parameter useful for chordal and co-comparability graphs | 2017-11-16 | Paper |
| Maximum matching width: new characterizations and a fast algorithm for dominating set | 2017-09-29 | Paper |
| Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees | 2017-09-11 | Paper |
| A width parameter useful for chordal and co-comparability graphs | 2017-05-05 | Paper |
| Recognizability equals definability for graphs of bounded treewidth and bounded chordality | 2016-10-14 | Paper |
| Between treewidth and clique-width | 2016-06-28 | Paper |
| Computational complexity of covering three-vertex multigraphs | 2015-12-08 | Paper |
| Solving #SAT and MAXSAT by Dynamic Programming | 2015-10-29 | Paper |
| Between Treewidth and Clique-Width | 2015-09-09 | Paper |
| MOD-2 INDEPENDENCE AND DOMINATION IN GRAPHS | 2015-04-29 | Paper |
| Computational Complexity of Covering Three-Vertex Multigraphs | 2014-10-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921757 | 2014-10-13 | Paper |
| The graph formulation of the union-closed sets conjecture | 2014-10-08 | Paper |
| Solving MaxSAT and #SAT on Structured CNF Formulas | 2014-09-26 | Paper |
| The graph formulation of the union-closed sets conjecture | 2014-06-11 | Paper |
| Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems | 2014-01-13 | Paper |
| Upper Bounds on Boolean-Width with Applications to Exact Algorithms | 2013-12-10 | Paper |
| Connecting Terminals and 2-Disjoint Connected Subgraphs | 2013-12-06 | Paper |
| Feedback vertex set on graphs of low clique-width | 2013-01-24 | Paper |
| Chordal digraphs | 2013-01-07 | Paper |
| FPT Algorithms for Domination in Biclique-Free Graphs | 2012-09-25 | Paper |
| Mike Fellows: Weaving the Web of Mathematics and Adventure | 2012-09-05 | Paper |
| Finding Good Decompositions for Dynamic Programming on Dense Graphs | 2012-06-15 | Paper |
| On the complexity of reconstructing H-free graphs from their Star Systems | 2011-10-12 | Paper |
| Boolean-width of graphs | 2011-10-10 | Paper |
| On the Boolean-Width of a Graph: Structure and Applications | 2010-11-16 | Paper |
| Generalized Graph Clustering: Recognizing (p,q)-Cluster Graphs | 2010-11-16 | Paper |
| Recognizing digraphs of Kelly-width 2 | 2010-05-25 | Paper |
| \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth | 2010-05-25 | Paper |
| Branchwidth of chordal graphs | 2010-04-28 | Paper |
| Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm | 2010-04-28 | Paper |
| Fundamentals of Computation Theory | 2010-04-20 | Paper |
| Theoretical Computer Science | 2010-02-23 | Paper |
| Chordal Digraphs | 2010-01-21 | Paper |
| Boolean-Width of Graphs | 2010-01-14 | Paper |
| Feedback Vertex Set on Graphs of Low Cliquewidth | 2009-12-11 | Paper |
| Interval Completion Is Fixed Parameter Tractable | 2009-11-06 | Paper |
| Edge-maximal graphs of branchwidth \(k\): The \(k\)-branches | 2009-06-17 | Paper |
| Leaf Powers and Their Properties: Using the Trees | 2009-01-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549635 | 2009-01-05 | Paper |
| Two Birds with One Stone: The Best of Branchwidth and Treewidth with One Algorithm | 2008-09-18 | Paper |
| Generation of Graphs with Bounded Branchwidth | 2008-09-04 | Paper |
| Characterization and Recognition of Digraphs of Bounded Kelly-width | 2008-07-01 | Paper |
| Towards a Taxonomy of Techniques for Designing Parameterized Algorithms | 2008-06-03 | Paper |
| Locally constrained graph homomorphisms and equitable partitions | 2008-05-13 | Paper |
| On the Complexity of Reconstructing H-free Graphs from Their Star Systems | 2008-04-15 | Paper |
| Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor | 2007-08-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5757085 | 2007-08-24 | Paper |
| Planar decompositions and the crossing number of graphs with an excluded minor | 2007-07-16 | Paper |
| Edge-maximal graphs of branchwidth k | 2007-05-29 | Paper |
| Tree-decompositions of small pathwidth | 2007-05-29 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Computing Minimal Triangulations in Time O(nalpha log n) = o(n2.376) | 2006-06-01 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2005-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4661878 | 2005-03-30 | Paper |
| Tree-decompositions of small pathwidth | 2005-02-22 | Paper |
| Graph searching, elimination trees, and a generalization of bandwidth | 2005-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4825539 | 2004-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472519 | 2004-08-04 | Paper |
| Iterated colorings of graphs. | 2004-03-14 | Paper |
| Graph coloring on coarse grained multicomputers | 2003-09-25 | Paper |
| Multicoloring trees. | 2003-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414498 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4707790 | 2003-06-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766681 | 2002-07-22 | Paper |
| A practical algorithm for making filled graphs minimal | 2000-12-12 | Paper |
| Memory requirements for table computations in partial \(k\)-tree algorithms | 2000-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4944971 | 2000-06-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4219028 | 2000-06-04 | Paper |
| Independent sets with domination constraints | 2000-03-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3836524 | 1999-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250226 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4223772 | 1999-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4209364 | 1999-01-11 | Paper |
| Covering regular graphs | 1998-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4373685 | 1998-06-11 | Paper |
| Algorithms for Vertex Partitioning Problems on Partial k-Trees | 1998-02-09 | Paper |
| Making an arbitrary filled graph minimal by removing fill edges | 1998-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4301873 | 1994-10-03 | Paper |
| Efficient sets in partial \(k\)-trees | 1993-11-30 | Paper |
