| Publication | Date of Publication | Type |
|---|
| Bipartite completion of colored graphs avoiding chordless cycles of given lengths | 2022-06-21 | Paper |
| Completing colored graphs to meet a target property | 2021-06-07 | Paper |
| Some completion problems for graphs without chordless cycles of prescribed lengths | 2019-09-19 | Paper |
| Structure and linear-time recognition of 4-leaf powers | 2018-11-05 | Paper |
| On the contour of bipartite graphs | 2018-05-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4635984 | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4604131 | 2018-02-23 | Paper |
| Graph modification problem for some classes of graphs | 2016-12-09 | Paper |
| Geodeticity of the contour of chordal bipartite graphs | 2016-10-17 | Paper |
| Improved algorithms for weakly chordal graphs | 2015-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501285 | 2015-08-03 | Paper |
| Hamiltonian Spider Intersection Graphs Are Cycle Extendable | 2014-04-10 | Paper |
| Completing Colored Graphs to Meet a Target Property | 2013-12-06 | Paper |
| Finding and listing induced paths and cycles | 2013-03-12 | Paper |
| Finding a sun in building-free graphs | 2012-12-27 | Paper |
| Maximum induced matching problem on hhd-free graphs | 2012-03-19 | Paper |
| Strongly chordal and chordal bipartite graphs are sandwich monotone | 2011-12-15 | Paper |
| On graphs without a \(C_{4}\) or a diamond | 2011-04-19 | Paper |
| On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two | 2011-02-18 | Paper |
| New Min-Max Theorems for Weakly Chordal and Dually Chordal Graphs | 2011-01-10 | Paper |
| A min-max property of chordal bipartite graphs with applications | 2010-10-07 | Paper |
| Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone | 2009-07-23 | Paper |
| Leaf Powers and Their Properties: Using the Trees | 2009-01-29 | Paper |
| The Complexity of the List Partition Problem for Graphs | 2008-12-05 | Paper |
| A new characterization of HH-free graphs | 2008-09-04 | Paper |
| Chordal bipartite completion of colored graphs | 2008-05-13 | Paper |
| Cycle Extendability and Hamiltonian Cycles in Chordal Graph Classes | 2007-09-06 | Paper |
| On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs | 2007-09-03 | Paper |
| The induced matching and chain subgraph cover problems for convex bipartite graphs | 2007-09-03 | Paper |
| An \(O( n^{3})\)-time recognition algorithm for hhds-free graphs | 2007-07-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3424773 | 2007-03-05 | Paper |
| A note on the recognition of bisplit graphs | 2006-09-14 | Paper |
| Disjoint clique cutsets in graphs without long holes | 2005-05-04 | Paper |
| Planar domination graphs | 2003-07-29 | Paper |
| Recognition of some perfectly orderable graph classes | 2003-06-10 | Paper |
| Finding a maximum induced matching in weakly chordal graphs | 2003-06-09 | Paper |
| Dirac-type characterizations of graphs without long chordless cycles | 2002-12-02 | Paper |
| Finding houses and holes in graphs | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952597 | 2000-05-10 | Paper |
| Weakly Triangulated Comparability Graphs | 1999-10-28 | Paper |
| A linear time algorithm to recognize circular permutation graphs | 1996-12-09 | Paper |
| A characterization of some graph classes with no long holes | 1996-07-28 | Paper |
| Algorithms for weakly triangulated graphs | 1995-06-06 | Paper |
