| Publication | Date of Publication | Type |
|---|
| Finding and counting small induced subgraphs efficiently | 2024-02-28 | Paper |
| Diametral path graphs | 2024-02-28 | Paper |
| Dominoes | 2024-01-05 | Paper |
| Rankings of graphs | 2024-01-05 | Paper |
| Approximating the bandwidth for asteroidal triple-free graphs | 2023-05-08 | Paper |
| Refined notions of parameterized enumeration kernels with applications to matching cut enumeration | 2021-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009482 | 2021-08-04 | Paper |
| Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms | 2020-06-29 | Paper |
| Enumeration of minimal connected dominating sets for chordal graphs | 2020-04-21 | Paper |
| Enumeration and maximum number of minimal dominating sets for chordal graphs | 2019-08-13 | Paper |
| Enumeration and maximum number of maximal irredundant sets for chordal graphs | 2019-07-17 | Paper |
| Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2 | 2019-05-21 | Paper |
| Treewidth and pathwidth of permutation graphs | 2019-03-29 | Paper |
| Space-efficient biconnected components and recognition of outerplanar graphs | 2019-03-11 | Paper |
| Enumeration of maximal irredundant sets for claw-free graphs | 2018-12-04 | Paper |
| Exact algorithms for weak Roman domination | 2018-09-17 | Paper |
| Computing square roots of graphs with low maximum degree | 2018-09-17 | Paper |
| Finding cactus roots in polynomial time | 2018-08-03 | Paper |
| Independent sets in asteroidal triple-free graphs | 2018-07-04 | Paper |
| Output-polynomial enumeration on graphs of bounded (local) linear MIM-width | 2018-04-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608619 | 2018-03-21 | Paper |
| Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2 | 2018-01-04 | Paper |
| Enumeration and maximum number of maximal irredundant sets for chordal graphs | 2018-01-04 | Paper |
| Enumeration and maximum number of minimal connected vertex covers in graphs | 2017-11-14 | Paper |
| A Linear Kernel for Finding Square Roots of Almost Planar Graphs | 2017-10-17 | Paper |
| Enumerating Minimal Connected Dominating Sets in Graphs of Bounded Chordality | 2017-09-29 | Paper |
| A linear kernel for finding square roots of almost planar graphs | 2017-09-07 | Paper |
| Enumeration of Maximal Irredundant Sets for Claw-Free Graphs | 2017-07-21 | Paper |
| Exact exponential algorithms to find tropical connected sets of minimum size | 2017-05-11 | Paper |
| Enumerating Minimal Tropical Connected Sets | 2017-04-04 | Paper |
| Squares of low clique number | 2017-02-14 | Paper |
| Minimal dominating sets in interval graphs and trees | 2016-11-24 | Paper |
| Finding Cactus Roots in Polynomial Time | 2016-09-29 | Paper |
| Finding shortest paths between graph colourings | 2016-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2816043 | 2016-07-01 | Paper |
| Finding and counting small induced subgraphs efficiently | 2016-06-16 | Paper |
| Bandwidth of chain graphs | 2016-06-09 | Paper |
| An approximation algorithm for clustering graphs with dominating diametral path | 2016-06-01 | Paper |
| Total domination and transformation | 2016-05-26 | Paper |
| Faster Algorithms to Enumerate Hypergraph Transversals | 2016-05-03 | Paper |
| Enumerating minimal connected dominating sets in graphs of bounded chordality | 2016-05-02 | Paper |
| Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs | 2016-04-04 | Paper |
| Parameterized algorithms for finding square roots | 2016-03-29 | Paper |
| Output-polynomial enumeration on graphs of bounded (local) linear MIM-width | 2016-01-11 | Paper |
| Enumerating minimal dominating sets in chordal bipartite graphs | 2015-12-10 | Paper |
| Algorithms solving the matching cut problem | 2015-12-08 | Paper |
| A measure & conquer approach for the analysis of exact algorithms | 2015-11-11 | Paper |
| Algorithms Solving the Matching Cut Problem | 2015-09-21 | Paper |
| End-Vertices of Graph Search Algorithms | 2015-09-21 | Paper |
| Exact Exponential Algorithms to Find a Tropical Connected Set of Minimum Size | 2015-09-15 | Paper |
| Finding Shortest Paths Between Graph Colourings | 2015-09-15 | Paper |
| An incremental polynomial time algorithm to enumerate all minimal edge dominating sets | 2015-09-02 | Paper |
| List coloring in the absence of a linear forest | 2015-03-02 | Paper |
| Exact Algorithms to Clique-Colour Graphs | 2015-01-13 | Paper |
| On exact algorithms for treewidth | 2014-12-05 | Paper |
| Exact algorithms for Kayles | 2014-12-02 | Paper |
| Enumerating minimal subset feedback vertex sets | 2014-11-19 | Paper |
| Exponential time algorithms for the \textsc{minimum dominating set} problem on some graph classes | 2014-11-18 | Paper |
| Exponential time algorithms for the minimum dominating set problem on some graph classes | 2014-11-18 | Paper |
| Finding clubs in graph classes | 2014-08-22 | Paper |
| Subset feedback vertex sets in chordal graphs | 2014-04-28 | Paper |
| Exact Algorithms for Weak Roman Domination | 2014-01-17 | Paper |
| Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization | 2014-01-16 | Paper |
| Detecting induced minors in AT-free graphs | 2014-01-09 | Paper |
| Minimal dominating sets in graph classes: combinatorial bounds and enumeration | 2013-12-11 | Paper |
| The Jump Number Problem: Exact and Parameterized | 2013-12-10 | Paper |
| Sparse Square Roots | 2013-12-06 | Paper |
| An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets | 2013-08-06 | Paper |
| Computing optimal Steiner trees in polynomial space | 2013-08-05 | Paper |
| Colorings with few colors: counting, enumeration and combinatorial bounds | 2013-08-01 | Paper |
| Cliques and Clubs | 2013-06-07 | Paper |
| Detecting Induced Minors in AT-Free Graphs | 2013-03-21 | Paper |
| Fully decomposable split graphs | 2013-01-24 | Paper |
| An Exact Algorithm for Subset Feedback Vertex Set on Chordal Graphs | 2013-01-07 | Paper |
| A note on exact algorithms for vertex ordering problems on graphs | 2012-12-06 | Paper |
| Colouring AT-Free Graphs | 2012-09-25 | Paper |
| On the parameterized complexity of coloring graphs in the absence of a linear forest | 2012-09-13 | Paper |
| Bicolored independent sets and bicliques | 2012-07-20 | Paper |
| Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration | 2012-06-15 | Paper |
| On independent sets and bicliques in graphs | 2012-04-26 | Paper |
| Parameterized algorithm for eternal vertex cover | 2012-03-19 | Paper |
| An exact algorithm for the maximum leaf spanning tree problem | 2012-01-09 | Paper |
| Exact Algorithms for Kayles | 2011-12-16 | Paper |
| List Coloring in the Absence of a Linear Forest | 2011-12-16 | Paper |
| Bandwidth on AT-free graphs | 2011-12-07 | Paper |
| Branch and recharge: exact algorithms for generalized domination | 2011-09-20 | Paper |
| Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack | 2011-08-23 | Paper |
| Enumerating Minimal Subset Feedback Vertex Sets | 2011-08-12 | Paper |
| Exact algorithms for \(L(2,1)\)-labeling of graphs | 2011-03-02 | Paper |
| Exact exponential algorithms. | 2010-11-18 | Paper |
| Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds | 2010-11-16 | Paper |
| Sort and Search: exact algorithms for generalized domination | 2010-08-20 | Paper |
| Measure and conquer | 2010-08-16 | Paper |
| Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing | 2010-06-22 | Paper |
| A Parameterized Route to Exact Puzzles: Breaking the 2 n -Barrier for Irredundance | 2010-05-28 | Paper |
| Fundamentals of Computation Theory | 2010-04-20 | Paper |
| Iterative compression and exact algorithms | 2010-03-09 | Paper |
| An Exact Algorithm for the Maximum Leaf Spanning Tree Problem | 2010-01-14 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2010-01-12 | Paper |
| Bandwidth on AT-Free Graphs | 2009-12-17 | Paper |
| Fully Decomposable Split Graphs | 2009-12-11 | Paper |
| Bandwidth of bipartite permutation graphs in polynomial time | 2009-12-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396567 | 2009-09-19 | Paper |
| Convex Recoloring Revisited: Complexity and Exact Algorithms | 2009-07-23 | Paper |
| Exact Algorithms for Treewidth and Minimum Fill-In | 2009-06-22 | Paper |
| On a property of minimal triangulations | 2009-06-17 | Paper |
| Branch and Recharge: Exact Algorithms for Generalized Domination | 2009-02-17 | Paper |
| Iterative Compression and Exact Algorithms | 2009-02-03 | Paper |
| On Independent Sets and Bicliques in Graphs | 2009-01-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5503435 | 2009-01-15 | Paper |
| Solving connected dominating set faster than \(2^n\) | 2008-12-02 | Paper |
| Faster Steiner Tree Computation in Polynomial-Space | 2008-11-25 | Paper |
| Exact Algorithms for L(2,1)-Labeling of Graphs | 2008-09-17 | Paper |
| Feedback vertex set on AT-free graphs | 2008-09-10 | Paper |
| A new characterization of HH-free graphs | 2008-09-04 | Paper |
| An Exact Algorithm for the Minimum Dominating Clique Problem | 2008-06-03 | Paper |
| Solving Connected Dominating Set Faster Than 2 n | 2008-04-17 | Paper |
| Bandwidth of Bipartite Permutation Graphs in Polynomial Time | 2008-04-15 | Paper |
| On Exact Algorithms for Treewidth | 2008-03-11 | Paper |
| An exact algorithm for the minimum dominating clique problem | 2007-10-18 | Paper |
| Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes | 2007-09-07 | Paper |
| Exact algorithms for graph homomorphisms | 2007-09-06 | Paper |
| Optimal Linear Arrangement of Interval Graphs | 2007-09-05 | Paper |
| BetweenO(nm) andO(nalpha) | 2007-05-03 | Paper |
| Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs | 2007-05-03 | Paper |
| Fundamentals of Computation Theory | 2006-10-20 | Paper |
| Improved bottleneck domination algorithms | 2006-08-14 | Paper |
| Minimal fill in O(\(n^{2.69}\)) time | 2006-03-29 | Paper |
| On algorithms for (\(P_5\), gem)-free graphs | 2006-03-20 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2005-12-08 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| On the structure of (\(P_{5}\),\,gem)-free graphs | 2005-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471290 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471361 | 2004-07-28 | Paper |
| On treewidth approximations. | 2004-03-14 | Paper |
| Algorithms for graphs with small octopus | 2004-01-26 | Paper |
| Additive Tree Spanners | 2004-01-08 | Paper |
| On the domination search number | 2003-06-10 | Paper |
| Approximating minimum cocolorings. | 2003-01-21 | Paper |
| Dominating Pair Graphs | 2003-01-05 | Paper |
| Approximating Bandwidth by Mixing Layouts of Interval Graphs | 2003-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4782702 | 2002-12-02 | Paper |
| Kayles and Nimbers | 2002-09-30 | Paper |
| On claw-free asteroidal triple-free graphs | 2002-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766679 | 2002-07-14 | Paper |
| On the structure of graphs with bounded asteroidal number | 2002-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766686 | 2002-07-09 | Paper |
| A generalization of AT-free graphs and a generic algorithm for solving triangulation problems | 2002-05-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2741345 | 2001-09-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2741348 | 2001-09-23 | Paper |
| Efficient algorithms for graphs with few \(P_4\)'s | 2001-07-18 | Paper |
| Approximating the Bandwidth for Asteroidal Triple-Free Graphs | 2000-12-18 | Paper |
| Tree-visibility orders | 2000-11-02 | Paper |
| Domination and total domination on asteroidal triple-free graphs | 2000-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4944994 | 2000-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4944739 | 2000-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4251056 | 2000-04-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942652 | 2000-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942656 | 2000-03-16 | Paper |
| Chordality and 2-factors in tough graphs | 2000-01-30 | Paper |
| On the vertex ranking problem for trapezoid, circular-arc and other graphs | 2000-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4266533 | 1999-10-03 | Paper |
| Independent Sets in Asteroidal Triple-Free Graphs | 1999-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232780 | 1999-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218149 | 1999-03-02 | Paper |
| Treewidth and Minimum Fill-in on d-Trapezoid Graphs | 1998-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4373684 | 1998-10-19 | Paper |
| On treewidth and minimum fill-in of asteroidal triple-free graphs | 1998-07-23 | Paper |
| Rankings of Graphs | 1998-05-11 | Paper |
| Listing all Minimal Separators of a Graph | 1998-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4378629 | 1998-03-31 | Paper |
| Measuring the vulnerability for classes of intersection graphs | 1998-02-16 | Paper |
| Width two posets are reconstructible | 1997-11-05 | Paper |
| 1-tough cocomparability graphs are hamiltonian | 1997-08-10 | Paper |
| Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph | 1997-02-28 | Paper |
| Toughness, hamiltonicity and split graphs | 1997-01-26 | Paper |
| Minimal non-neighborhood-perfect graphs | 1996-07-14 | Paper |
| Treewidth of Chordal Bipartite Graphs | 1996-05-28 | Paper |
| Treewidth and Pathwidth of Permutation Graphs | 1996-02-20 | Paper |
| Towards the reconstruction of posets | 1995-08-24 | Paper |
| On the complexity of graph reconstruction | 1995-02-14 | Paper |
| A counterexample about poset reconstruction | 1994-11-27 | Paper |
| Dominating cliques in chordal graphs | 1994-09-15 | Paper |
| On cocolourings and cochromatic numbers of graphs | 1994-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281510 | 1994-03-10 | Paper |
| Domination on Cocomparability Graphs | 1993-10-14 | Paper |
| The complexity of coloring games on perfect graphs | 1993-04-22 | Paper |
| Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3997600 | 1992-09-17 | Paper |
| Some extremal results in cochromatic and dichromatic theory | 1992-06-27 | Paper |
| Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs | 1990-01-01 | Paper |
| Domination in convex and chordal bipartite graphs | 1990-01-01 | Paper |
| Finding the minimum bandwidth of an interval graph | 1987-01-01 | Paper |
| On domination problems for permutation and other graphs | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3772258 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3782805 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3741647 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4724636 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3694712 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3715153 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3346325 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3679238 | 1984-01-01 | Paper |
