| Publication | Date of Publication | Type |
|---|
| Finding and counting small induced subgraphs efficiently | 2024-02-28 | Paper |
| Rankings of graphs | 2024-01-05 | Paper |
| Dominoes | 2024-01-05 | Paper |
| Counting independent sets in graphs with bounded bipartite pathwidth | 2023-10-12 | Paper |
| Approximating the bandwidth for asteroidal triple-free graphs | 2023-05-08 | Paper |
| Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs | 2023-03-30 | Paper |
| Vertex ranking of asteroidal triple-free graphs | 2023-01-25 | Paper |
| Counting Weighted Independent Sets beyond the Permanent | 2021-06-28 | Paper |
| Counting independent sets in graphs with bounded bipartite pathwidth | 2020-02-24 | Paper |
| Quasimonotone graphs | 2019-11-27 | Paper |
| Counting Perfect Matchings and the Switch Chain | 2019-08-29 | Paper |
| Counting independent sets in cocomparability graphs | 2019-02-13 | Paper |
| Counting independent sets in graphs with bounded bipartite pathwidth | 2018-12-07 | Paper |
| On rank-width of even-hole-free graphs | 2018-11-30 | Paper |
| Quasimonotone graphs | 2018-11-22 | Paper |
| On the switch Markov chain for perfect matchings | 2018-07-16 | Paper |
| Independent sets in asteroidal triple-free graphs | 2018-07-04 | Paper |
| On the Switch Markov Chain for Perfect Matchings | 2018-05-17 | Paper |
| On treewidth approximations | 2016-07-01 | Paper |
| Finding and counting small induced subgraphs efficiently | 2016-06-16 | Paper |
| Vertex ranking of asteroidal triple-free graphs | 2016-06-09 | Paper |
| Bandwidth of chain graphs | 2016-06-09 | Paper |
| Graph classes and the switch Markov chain for matchings | 2016-02-19 | Paper |
| Partitioning a graph into disjoint cliques and a triangle-free graph | 2015-07-06 | Paper |
| An FPT Certifying Algorithm for the Vertex-Deletion Problem | 2014-01-17 | Paper |
| On the Stable Degree of Graphs | 2012-11-06 | Paper |
| Colouring AT-Free Graphs | 2012-09-25 | Paper |
| Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number | 2012-09-13 | Paper |
| Parameterized algorithms for the independent set problem in some hereditary graph classes | 2011-05-19 | Paper |
| On a disparity between relative cliquewidth and relative NLC-width | 2010-05-25 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2010-01-12 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2010-01-12 | Paper |
| Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences | 2009-06-23 | Paper |
| On a property of minimal triangulations | 2009-06-17 | Paper |
| Random walks on the vertices of transportation polytopes with constant number of sources | 2009-03-04 | Paper |
| Feedback vertex set on AT-free graphs | 2008-09-10 | Paper |
| On stable cutsets in claw-free graphs and planar graphs | 2008-08-08 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| Computing the branchwidth of interval graphs | 2005-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471315 | 2004-07-28 | Paper |
| On treewidth approximations. | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448745 | 2004-02-18 | Paper |
| Algorithms for graphs with small octopus | 2004-01-26 | Paper |
| Additive Tree Spanners | 2004-01-08 | Paper |
| Splitting a graph into disjoint induced paths or cycles. | 2003-09-25 | Paper |
| On the domination search number | 2003-06-10 | Paper |
| On the structure of graphs with bounded asteroidal number | 2002-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766679 | 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 |
| On the structure of graphs with bounded asteroidal number | 2001-09-23 | Paper |
| Partial orders on weak orders convex subsets | 2001-07-22 | 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 |
| https://portal.mardi4nfdi.de/entity/Q4498392 | 2000-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4944739 | 2000-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942652 | 2000-03-16 | Paper |
| On the vertex ranking problem for trapezoid, circular-arc and other graphs | 2000-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4251049 | 1999-11-02 | 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 |
| Recognizing interval digraphs and interval bigraphs in polynomial time | 1998-06-23 | Paper |
| Rankings of Graphs | 1998-05-11 | Paper |
| Measuring the vulnerability for classes of intersection graphs | 1998-02-16 | Paper |
| Partial orders and their convex subsets | 1997-06-10 | Paper |
| The minimum broadcast time problem for several processor networks | 1997-02-28 | Paper |
| Toughness, hamiltonicity and split graphs | 1997-01-26 | Paper |
| HAMILTONian circuits in chordal bipartite graphs | 1996-11-13 | Paper |
| On edge perfectness and classes of bipartite graphs | 1996-03-25 | Paper |
| Alternating cycle-free matchings | 1994-05-15 | Paper |
| Polynomial time algorithms for Hamiltonian problems on bipartite distance-hereditary graphs | 1993-12-15 | Paper |
| A note on balanced immunity | 1993-05-17 | Paper |
| Domination in convex and chordal bipartite graphs | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3782804 | 1987-01-01 | Paper |
| The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3731620 | 1986-01-01 | Paper |
| Thick Forests | N/A | Paper |
