| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q5005173 | 2021-08-04 | Paper |
| Interval-Permutation Segment Graphs | 2019-08-27 | Paper |
| On recognition of threshold tolerance graphs and their complements | 2016-11-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2816133 | 2016-07-01 | Paper |
| Recognizing Threshold Tolerance Graphs in $$O(n^2)$$ Time | 2015-09-09 | Paper |
| Improved algorithms for weakly chordal graphs | 2015-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501778 | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5747380 | 2014-02-14 | Paper |
| Finding a sun in building-free graphs | 2012-12-27 | Paper |
| On graphs without a \(C_{4}\) or a diamond | 2011-04-19 | Paper |
| Linear-time recognition of Helly circular-arc models and graphs | 2011-03-02 | Paper |
| Fundamentals of Computation Theory | 2010-04-20 | Paper |
| A new characterization of HH-free graphs | 2008-09-04 | Paper |
| Finding Triangles in Restricted Classes of Graphs | 2007-05-29 | Paper |
| BetweenO(nm) andO(nalpha) | 2007-05-03 | Paper |
| Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs | 2007-05-03 | Paper |
| Formal Concept Analysis | 2007-02-12 | Paper |
| Algorithms for the homogeneous set sandwich problem | 2006-11-06 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| Polynomial time recognition of unit circular-arc graphs | 2006-04-28 | 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 |
| Formal Concept Analysis | 2005-12-02 | Paper |
| Recognition algorithms for orders of small width and graphs of small Dilworth number | 2005-04-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829024 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471290 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471361 | 2004-07-28 | Paper |
| Recognizing quasi-triangulated graphs. | 2004-03-29 | Paper |
| Robust algorithms for restricted domains | 2004-03-14 | Paper |
| A note on computing graph closures | 2004-02-14 | Paper |
| Scalar aggregation in inconsistent databases. | 2003-08-17 | Paper |
| Efficient graph representations | 2003-07-15 | Paper |
| Recognition of some perfectly orderable graph classes | 2003-06-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768336 | 2002-07-22 | Paper |
| Forbidden subgraph decomposition | 2002-05-28 | Paper |
| Domination graphs: Examples and counterexamples | 2002-04-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768334 | 2002-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4506382 | 2000-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952597 | 2000-05-10 | Paper |
| Modular decomposition and transitive orientation | 2000-04-04 | Paper |
| Construction of a simple elimination scheme for a chordal comparability graph in linear time | 1999-11-07 | Paper |
| Weakly Triangulated Comparability Graphs | 1999-10-28 | Paper |
| Graph Classes: A Survey | 1999-05-24 | Paper |
| On treewidth and minimum fill-in of asteroidal triple-free graphs | 1998-07-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128916 | 1997-08-03 | Paper |
| Visibility graphs of towers | 1997-03-18 | Paper |
| Nonredundant 1’s in $\Gamma $-Free Matrices | 1995-07-03 | Paper |
| Algorithms for weakly triangulated graphs | 1995-06-06 | Paper |
| On the 2-Chain Subgraph Cover and Related Problems | 1994-11-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138902 | 1994-09-19 | Paper |
| An O(n2) Algorithm for Undirected Split Decomposition | 1994-05-24 | Paper |
| Recognition of Circle Graphs | 1994-03-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140413 | 1993-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138973 | 1993-10-20 | Paper |
| Doubly lexical ordering of dense 0--1 matrices | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028102 | 1993-03-28 | Paper |
| \(P_ 4\)-trees and substitution decomposition | 1993-01-17 | Paper |
| Note on recognition of matroid systems | 1992-06-27 | Paper |
| Cycle-free partial orders and chordal comparability graphs | 1992-06-27 | Paper |
| Transitive closure for restricted classes of partial orders | 1992-06-27 | Paper |
| Finding large holes | 1992-06-27 | Paper |
| Incremental modular decomposition | 1989-01-01 | Paper |
| Prime Testing for the Split Decomposition of a Graph | 1989-01-01 | Paper |
| Circular-arc graphs with clique cover number two | 1988-01-01 | Paper |
| Edge subdivision and dimension | 1988-01-01 | Paper |
| Bipartite permutation graphs | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3797239 | 1987-01-01 | Paper |
| An improved edge bound on the interval number of a graph | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3801571 | 1987-01-01 | Paper |
| The minimum dummy task problem | 1986-01-01 | Paper |
| Worst-case analysis of a scheduling algorithm | 1985-01-01 | Paper |
| Worst case analysis of a graph coloring algorithm | 1985-01-01 | Paper |
| On Comparability and Permutation Graphs | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3670598 | 1983-01-01 | Paper |
