| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q5005172 | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5005173 | 2021-08-04 | Paper |
| Min-Orderable Digraphs | 2020-10-28 | Paper |
| Bipartite Analogues of Comparability and Cocomparability Graphs | 2020-10-27 | Paper |
| Complete inverted files for efficient text retrieval and analysis | 2020-04-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4643857 | 2018-05-29 | Paper |
| A note on finding minimum mean cycle | 2017-08-16 | Paper |
| On recognition of threshold tolerance graphs and their complements | 2016-11-24 | Paper |
| Simple DFS on the complement of a graph and on partially complemented digraphs | 2016-10-06 | Paper |
| Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker--Boland Subgraphs | 2016-01-15 | Paper |
| Linear-Time Recognition of Probe Interval Graphs | 2015-10-30 | Paper |
| Recognizing Threshold Tolerance Graphs in $$O(n^2)$$ Time | 2015-09-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501779 | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501778 | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501338 | 2015-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4982366 | 2015-04-09 | Paper |
| Certifying algorithms | 2014-10-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5747380 | 2014-02-14 | Paper |
| On Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs | 2013-12-06 | Paper |
| Position heaps: a simple and dynamic text indexing data structure | 2011-05-03 | Paper |
| Linear-time recognition of Helly circular-arc models and graphs | 2011-03-02 | Paper |
| An implicit representation of chordal comparability graphs in linear time | 2010-05-25 | Paper |
| \(O(m\log n)\) split decomposition of strongly-connected graphs | 2010-05-25 | Paper |
| \(O(m \log n)\) split decomposition of strongly connected graphs | 2010-01-07 | Paper |
| Linear-Time Recognition of Probe Interval Graphs | 2009-10-29 | Paper |
| Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure | 2009-07-07 | Paper |
| An Implicit Representation of Chordal Comparabilty Graphs in Linear-Time | 2008-09-04 | Paper |
| On cliques of Helly Circular-arc Graphs | 2008-06-05 | Paper |
| Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs | 2007-05-03 | Paper |
| Formal Concept Analysis | 2007-02-12 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| Polynomial time recognition of unit circular-arc graphs | 2006-04-28 | Paper |
| Decompositions and forcing relations in graphs and other combinatorial structures | 2006-03-09 | Paper |
| Formal Concept Analysis | 2005-12-02 | Paper |
| Linear-time modular decomposition of directed graphs | 2005-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829024 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471290 | 2004-07-28 | Paper |
| Linear-time recognition of circular-arc graphs | 2004-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4533374 | 2002-09-26 | Paper |
| Efficient and practical algorithms for sequential modular decomposition | 2002-07-08 | Paper |
| Nesting of prime substructures in \(k-\)ary relations | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4506382 | 2000-09-18 | Paper |
| Modular decomposition and transitive orientation | 2000-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4362733 | 1998-03-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128916 | 1997-08-03 | Paper |
| An \(O(n^ 2)\) incremental algorithm for modular decomposition of graphs and 2-structures | 1995-11-27 | Paper |
| A \(k\)-structure generalization of the theory of 2-structures | 1994-09-25 | Paper |
| An O(n2) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs | 1994-04-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3217631 | 1984-01-01 | Paper |
