| Publication | Date of Publication | Type |
|---|
| Computing optimal leaf roots of chordal cographs in linear time | 2024-10-08 | Paper |
| Complexity Results for Matching Cut Problems in Graphs Without Long Induced Paths | 2024-05-03 | Paper |
| Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs | 2024-04-21 | Paper |
| On the \(d\)-claw vertex deletion problem | 2024-01-25 | Paper |
| Maximizing Matching Cuts | 2023-12-20 | Paper |
| Computing Optimal Leaf Roots of Chordal Cographs in Linear Time | 2023-08-21 | Paper |
| On the \(d\)-claw vertex deletion problem | 2023-03-30 | Paper |
| Leaf powers | 2022-12-21 | Paper |
| The perfect matching cut problem revisited | 2022-09-01 | Paper |
| The perfect matching cut problem revisited | 2022-06-08 | Paper |
| Refined notions of parameterized enumeration kernels with applications to matching cut enumeration | 2021-10-28 | Paper |
| Matching cut in graphs with large minimum degree | 2021-04-19 | Paper |
| Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms | 2020-06-29 | Paper |
| Color-line and proper color-line graphs | 2020-04-21 | Paper |
| Matching cut in graphs with large minimum degree | 2020-02-24 | Paper |
| Hardness and structural results for half-squares of restricted tree convex bipartite graphs | 2019-10-17 | Paper |
| Map graphs having witnesses of large girth | 2019-05-17 | Paper |
| A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter | 2019-05-02 | Paper |
| Structure and linear-time recognition of 4-leaf powers | 2018-11-05 | Paper |
| On the complete width and edge clique cover problems | 2018-07-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636534 | 2018-04-19 | Paper |
| Hardness and structural results for half-squares of restricted tree convex bipartite graphs | 2017-10-23 | Paper |
| Good characterizations and linear time recognition for 2-probe block graphs | 2017-09-12 | Paper |
| Characterization and recognition of some opposition and coalition graph classes | 2016-11-24 | Paper |
| A unified approach to recognize squares of split graphs | 2016-09-12 | Paper |
| Algorithms solving the matching cut problem | 2015-12-08 | Paper |
| On the complete width and edge clique cover problems | 2015-10-29 | Paper |
| Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs | 2015-09-25 | Paper |
| Algorithms Solving the Matching Cut Problem | 2015-09-21 | Paper |
| Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs | 2015-09-09 | Paper |
| Characterizing and recognizing probe block graphs | 2015-01-28 | Paper |
| Forests and trees among Gallai graphs | 2014-11-20 | Paper |
| A note on efficient domination in a superclass of \(P_5\)-free graphs | 2014-04-17 | Paper |
| On opposition graphs, coalition graphs, and bipartite permutation graphs | 2014-04-02 | Paper |
| Complexity and algorithms for recognizing polar and monopolar graphs | 2014-03-13 | Paper |
| Complexity results for rainbow matchings | 2014-02-11 | Paper |
| Extremal graphs having no stable cutset | 2013-06-07 | Paper |
| Integral mixed unit interval graphs | 2013-04-25 | Paper |
| A good characterization of squares of strongly chordal split graphs | 2013-04-04 | Paper |
| Mixed unit interval graphs | 2012-10-26 | Paper |
| Integral Mixed Unit Interval Graphs | 2012-09-25 | Paper |
| Complexity of finding graph roots with girth conditions | 2012-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5389994 | 2012-04-24 | Paper |
| Path-bicolorable graphs | 2012-01-24 | Paper |
| Recognizing Polar Planar Graphs Using New Results for Monopolarity | 2011-12-16 | Paper |
| Two characterizations of chain partitioned probe graphs | 2011-11-17 | Paper |
| Exact leaf powers | 2010-07-07 | Paper |
| The square of a block graph | 2010-04-27 | Paper |
| Hardness Results and Efficient Algorithms for Graph Powers | 2010-01-21 | Paper |
| Structure and linear time recognition of 3-leaf powers | 2010-01-18 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2010-01-12 | Paper |
| Path-bicolorable graphs. (Extended abstract) | 2010-01-07 | Paper |
| A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers | 2009-12-09 | Paper |
| Simplicial powers of graphs | 2009-11-25 | Paper |
| Probe threshold and probe trivially perfect graphs | 2009-11-06 | Paper |
| Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes | 2009-07-09 | Paper |
| Simplicial Powers of Graphs | 2009-01-27 | Paper |
| On stable cutsets in claw-free graphs and planar graphs | 2008-08-08 | Paper |
| Probe Ptolemaic Graphs | 2008-07-10 | Paper |
| Characterisations and Linear-Time Recognition of Probe Cographs | 2008-07-01 | Paper |
| Probe split graphs | 2008-05-27 | Paper |
| The subchromatic index of graphs | 2008-02-28 | Paper |
| On the complexity of 4-coloring graphs without long induced paths | 2008-01-07 | Paper |
| Graph classes related to chordal graphs and chordal bipartite graphs | 2007-05-29 | Paper |
| Distance-Hereditary 5-Leaf Powers | 2007-05-29 | Paper |
| On probe classes of graphs | 2007-05-29 | Paper |
| Tree spanners for bipartite graphs and probe interval graphs | 2007-03-05 | Paper |
| New applications of clique separator decomposition for the maximum weight stable set problem | 2007-02-26 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| Fundamentals of Computation Theory | 2006-10-20 | Paper |
| Bisplit graphs | 2005-10-10 | Paper |
| Split-Perfect Graphs: Characterizations and Algorithmic Use | 2005-02-28 | Paper |
| Tree spanners on chordal graphs: complexity and algorithms | 2004-10-27 | Paper |
| Consequences of an algorithm for bridged graphs | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448765 | 2004-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448755 | 2004-02-18 | Paper |
| Graph Subcolorings: Complexity and Algorithms | 2004-01-08 | Paper |
| Splitting a graph into disjoint induced paths or cycles. | 2003-09-25 | Paper |
| Stability number of bull- and chair-free graphs revisited | 2003-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4425951 | 2003-09-14 | Paper |
| On stable cutsets in line graphs | 2003-07-30 | Paper |
| Bipartite-perfect graphs | 2003-06-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4533373 | 2002-09-26 | Paper |
| The NP-completeness of (1,r)-subcolorability of cubic graphs | 2002-07-14 | Paper |
| On \(\alpha\)-redundant vertices in \(P_{5}\)-free graphs | 2002-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766671 | 2002-07-14 | Paper |
| Bipartite-perfect graphs | 2001-09-23 | Paper |
| \(P_4\)-colorings and \(P_4\)-bipartite graphs | 2001-06-18 | Paper |
| On stable cutsets in graphs | 2001-06-13 | Paper |
| Some conjectures on perfect graphs | 2001-06-04 | Paper |
| Optimal tree 3-spanners in directed path graphs | 2001-05-02 | Paper |
| On \(P_4\)-transversals of perfect graphs | 2001-02-13 | Paper |
| Recognizing the \(P_4\)-structure of block graphs | 2000-07-16 | Paper |
| Recognizing Perfect 2-Split Graphs | 2000-03-19 | Paper |
| Efficiently recognizing the \(P_4\)-structure of trees and of bipartite graphs without short cycles | 2000-01-01 | Paper |
| A good characterization of cograph contractions | 1999-10-17 | Paper |
| Tree- and forest-perfect graphs | 1999-09-22 | Paper |
| Recognizing the \(P_4\)-structure of bipartite graphs | 1999-08-02 | Paper |
| Graph Classes: A Survey | 1999-05-24 | Paper |
| The complexity of some problems related to GRAPH 3-COLORABILITY | 1999-03-22 | Paper |
| Duchet-type theorems for powers of HHD-free graphs | 1998-04-28 | Paper |
| Cycle-perfect graphs are perfect | 1997-06-22 | Paper |
| Gallai graphs and anti-Gallai graphs | 1997-06-22 | Paper |
| Wing-triangulated graphs are perfect | 1997-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4885538 | 1996-07-16 | Paper |
| Mortality of iterated Gallai graphs | 1994-10-10 | Paper |
| Iterated \(k\)-line graphs | 1994-09-26 | Paper |
| Perfect k‐line graphs and k‐total graphs | 1993-12-13 | Paper |
| On inverse problems for the cycle graph operator | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3347716 | 1982-01-01 | Paper |
| Complexity and algorithms for matching cut problems in graphs without long induced paths and cycles | N/A | Paper |
