| Publication | Date of Publication | Type |
|---|
| LexBFS-orderings and powers of graphs | 2024-06-05 | Paper |
| Homogeneously orderable graphs and the Steiner tree problem | 2024-02-28 | Paper |
| Finding dominating induced matchings in \(P_{10}\)-free graphs in polynomial time | 2024-02-20 | Paper |
| Dually chordal graphs | 2024-01-05 | Paper |
| Short disjoint cycles in graphs with degree constraints | 2024-01-05 | Paper |
| The algorithmic use of hypertree structure and maximum neighbourhood orderings | 2024-01-05 | Paper |
| Combining decomposition approaches for the maximum weight stable set problem | 2023-05-19 | Paper |
| Dually and strongly chordal graphs | 2022-12-21 | Paper |
| Leaf powers | 2022-12-21 | Paper |
| Finding dominating induced matchings in \(P_9\)-free graphs in polynomial time | 2022-07-26 | Paper |
| Distance approximating trees for chordal and dually chordal graphs (extended abstract) | 2021-12-20 | Paper |
| Maximum weight independent sets for (\(S_{1,2,4}\),triangle)-free graphs in polynomial time | 2021-07-22 | Paper |
| Efficient domination for classes of \(P_6\)-free graphs | 2021-06-07 | Paper |
| Finding dominating induced matchings in \(S_{1, 1, 5}\)-free graphs in polynomial time | 2020-07-07 | Paper |
| Finding dominating induced matchings in \(S_{2, 2, 3}\)-free graphs in polynomial time | 2020-06-29 | Paper |
| On efficient domination for some classes of \(H\)-free chordal graphs | 2020-05-29 | Paper |
| Dominating induced matchings in \(S_{1 , 2 , 4}\)-free graphs | 2020-04-21 | Paper |
| On efficient domination for some classes of \(H\)-free bipartite graphs | 2019-11-06 | Paper |
| A dichotomy for weighted efficient dominating sets with bounded degree vertices | 2018-12-05 | Paper |
| Structure and linear-time recognition of 4-leaf powers | 2018-11-05 | Paper |
| Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs | 2018-10-26 | Paper |
| Efficient domination and efficient edge domination: a brief survey | 2018-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4635985 | 2018-04-23 | Paper |
| On efficient domination for some classes of \(H\)-free chordal graphs | 2018-04-09 | Paper |
| Maximum weight independent set for \(\ell\)claw-free graphs in polynomial time | 2018-02-22 | Paper |
| Maximum weight independent sets for (\(P_7\),triangle)-free graphs in polynomial time | 2018-01-11 | Paper |
| Bounding the Clique‐Width of H‐Free Chordal Graphs | 2017-09-26 | Paper |
| Finding dominating induced matchings in \(P_8\)-free graphs in polynomial time | 2017-05-02 | Paper |
| Weighted Efficient Domination for $P_5$-Free and $P_6$-Free Graphs | 2017-01-04 | Paper |
| Weighted Efficient Domination for $$P_6$$ -Free and for $$P_5$$ -Free Graphs | 2016-12-22 | Paper |
| Bounding the clique-width of \(H\)-free split graphs | 2016-11-02 | Paper |
| Efficient Domination for Some Subclasses of $$P_6$$ -free Graphs in Polynomial Time | 2016-10-21 | Paper |
| Bounding the clique-width of \(H\)-free split graphs | 2016-10-14 | Paper |
| Bounded Clique-Width of ($S_{1,2,2}$,Triangle)-Free Graphs | 2016-08-05 | Paper |
| Clique cycle-transversals in distance-hereditary graphs | 2016-06-22 | Paper |
| Weighted efficient domination in two subclasses of \(P_6\)-free graphs | 2016-02-04 | Paper |
| Maximum weight independent sets in odd-hole-free graphs without dart or without bull | 2015-09-24 | Paper |
| The Dilworth number of auto-chordal bipartite graphs | 2015-09-24 | Paper |
| Bounding the Clique-Width of H-free Chordal Graphs | 2015-09-16 | Paper |
| Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds | 2015-04-28 | Paper |
| Weighted Efficient Domination in Classes of $P_6$-free Graphs | 2015-03-20 | Paper |
| Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs | 2014-12-09 | Paper |
| Addendum to: ``Maximum weight independent sets in hole- and co-chair-free graphs | 2014-12-09 | Paper |
| Dominating induced matchings for \(P_7\)-free graphs in linear time | 2014-12-02 | Paper |
| A note on efficient domination in a superclass of \(P_5\)-free graphs | 2014-04-17 | Paper |
| Corrigendum to ``Cycle transversals in perfect graphs and cographs | 2013-12-11 | Paper |
| New Polynomial Cases of the Weighted Efficient Domination Problem | 2013-09-20 | Paper |
| Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs | 2013-03-21 | Paper |
| Cycle transversals in perfect graphs and cographs | 2013-02-19 | Paper |
| Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences | 2012-05-04 | Paper |
| Maximum weight independent sets in hole- and co-chair-free graphs | 2012-03-09 | Paper |
| Path-bicolorable graphs | 2012-01-24 | Paper |
| Dominating Induced Matchings for P 7-free Graphs in Linear Time | 2011-12-16 | Paper |
| On distance-3 matchings and induced matchings | 2011-04-19 | Paper |
| Independent Sets of Maximum Weight in Apple-Free Graphs | 2011-03-15 | Paper |
| Exact leaf powers | 2010-07-07 | Paper |
| Characterising \((k,\ell )\)-leaf powers | 2010-05-05 | Paper |
| Efficient Edge Domination on Hole-Free Graphs in Polynomial Time | 2010-04-27 | Paper |
| Rooted directed path graphs are leaf powers | 2010-04-27 | Paper |
| Fundamentals of Computation Theory | 2010-04-20 | Paper |
| On independent vertex sets in subclasses of apple-free graphs | 2010-02-23 | 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 | 2010-01-07 | Paper |
| On Distance-3 Matchings and Induced Matchings | 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 |
| The complete inclusion structure of leaf power classes | 2009-11-25 | Paper |
| Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes | 2009-07-09 | Paper |
| Maximum induced matchings for chordal graphs in linear time | 2009-05-13 | Paper |
| Structure and stability number of chair-, co-P- and gem-free graphs revisited | 2009-03-23 | Paper |
| Independent Sets of Maximum Weight in Apple-Free Graphs | 2009-01-29 | Paper |
| Simplicial Powers of Graphs | 2009-01-27 | Paper |
| On k- Versus (k + 1)-Leaf Powers | 2009-01-27 | Paper |
| On (k,ℓ)-Leaf Powers | 2008-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5387674 | 2008-05-27 | Paper |
| Ptolemaic Graphs and Interval Graphs Are Leaf Powers | 2008-04-15 | Paper |
| On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem | 2008-01-07 | Paper |
| Generalized Powers of Graphs and Their Algorithmic Use | 2007-09-07 | Paper |
| The induced matching and chain subgraph cover problems for convex bipartite graphs | 2007-09-03 | Paper |
| On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem | 2007-08-30 | Paper |
| Distance-Hereditary 5-Leaf Powers | 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 |
| Clique-width for 4-vertex forbidden subgraphs | 2006-10-25 | Paper |
| Fundamentals of Computation Theory | 2006-10-20 | Paper |
| Fundamentals of Computation Theory | 2006-10-20 | Paper |
| On algorithms for (\(P_5\), gem)-free graphs | 2006-03-20 | Paper |
| New graph classes of bounded clique-width | 2006-02-08 | Paper |
| GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH | 2005-10-19 | Paper |
| Bisplit graphs | 2005-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5463359 | 2005-08-04 | Paper |
| Split-Perfect Graphs: Characterizations and Algorithmic Use | 2005-02-28 | Paper |
| On the structure of (\(P_{5}\),\,gem)-free graphs | 2005-02-22 | Paper |
| Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width | 2005-02-22 | Paper |
| On minimal prime extensions of a four-vertex graph in a prime graph | 2005-01-13 | Paper |
| Tree spanners on chordal graphs: complexity and algorithms | 2004-10-27 | Paper |
| (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization. | 2004-03-29 | Paper |
| On the structure and stability number of \(P_{5}\)- and co-chair-free graphs | 2003-12-04 | 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 variations of \(P_{4}\)-sparse graphs | 2003-09-09 | Paper |
| On linear and circular structure of (claw, net)-free graphs | 2003-09-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414485 | 2003-07-25 | Paper |
| Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4782740 | 2002-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4533373 | 2002-09-26 | Paper |
| A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs | 2002-07-21 | Paper |
| On \(\alpha\)-redundant vertices in \(P_{5}\)-free graphs | 2002-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766671 | 2002-07-14 | Paper |
| A note on \(\alpha\)-redundant vertices in graphs | 2001-09-03 | Paper |
| On stable cutsets in graphs | 2001-06-13 | Paper |
| Linear time algorithms for Hamiltonian problems on (claw, net)-free graphs | 2001-03-19 | Paper |
| Recognizing the \(P_4\)-structure of block graphs | 2000-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4944993 | 2000-06-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942657 | 2000-03-16 | Paper |
| Efficiently recognizing the \(P_4\)-structure of trees and of bipartite graphs without short cycles | 2000-01-01 | Paper |
| Powers of hhd-free graphs∗ | 1999-10-27 | Paper |
| Tree- and forest-perfect graphs | 1999-09-22 | Paper |
| On the stability number of claw-free \(P_5\)-free and more general graphs | 1999-09-22 | Paper |
| Recognizing the \(P_4\)-structure of bipartite graphs | 1999-08-02 | Paper |
| Convexity and HHD-Free Graphs | 1999-06-27 | Paper |
| Graph Classes: A Survey | 1999-05-24 | Paper |
| The complexity of some problems related to GRAPH 3-COLORABILITY | 1999-03-22 | Paper |
| Distance Approximating Trees for Chordal and Dually Chordal Graphs | 1999-02-02 | Paper |
| Dually Chordal Graphs | 1998-09-21 | Paper |
| The algorithmic use of hypertree structure and maximum neighbourhood orderings | 1998-08-02 | Paper |
| Homogeneously orderable graphs | 1998-07-23 | Paper |
| Duchet-type theorems for powers of HHD-free graphs | 1998-04-28 | Paper |
| LexBFS-orderings and powers of chordal graphs | 1998-01-19 | Paper |
| \(r\)-dominating cliques in graphs with hypertree structure | 1997-07-07 | Paper |
| Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs | 1997-05-20 | Paper |
| Partitions of graphs into one or two independent sets and cliques | 1996-12-12 | Paper |
| Perfect elimination orderings of chordal powers of graphs | 1996-11-07 | Paper |
| Short disjoint cycles in graphs with degree constraints | 1996-07-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4840182 | 1995-07-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281625 | 1994-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4694738 | 1993-06-29 | Paper |
| Classes of bipartite graphs related to chordal graphs | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3974856 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3351395 | 1990-01-01 | Paper |
| Bipartite permutation graphs | 1987-01-01 | Paper |
| On domination problems for permutation and other graphs | 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/Q3797239 | 1987-01-01 | Paper |
| Uniform simulations of nondeterministic real time multitape turing machines | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4724636 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3737468 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3789570 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3731620 | 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/Q3677799 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3731031 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3346325 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3679238 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3339304 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3314998 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3657451 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3662617 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3745281 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3938502 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3948592 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3920666 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3916024 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3938523 | 1981-01-01 | Paper |
| On a Property of Homogeneous Gaussian L-Fields | 1980-01-01 | Paper |
| A relation between space, return and dual return complexities | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4195704 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3208085 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4194463 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4164823 | 1977-01-01 | Paper |
