| Publication | Date of Publication | Type |
|---|
| Graph extremities defined by search algorithms | 2018-08-20 | Paper |
| An introduction to clique minimal separator decomposition | 2018-08-20 | Paper |
| Computing a clique tree with the algorithm maximal label search | 2018-08-20 | Paper |
| The normal graph conjecture for two classes of sparse graphs | 2018-03-22 | Paper |
| Moplex elimination orderings | 2016-07-01 | Paper |
| The Dilworth number of auto-chordal bipartite graphs | 2015-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501362 | 2015-08-03 | Paper |
| GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH | 2015-04-29 | Paper |
| Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds | 2015-04-28 | Paper |
| Hermes: a simple and efficient algorithm for building the AOC-poset of a binary relation | 2015-02-05 | Paper |
| Organizing the atoms of the clique separator decomposition into an atom tree | 2014-09-08 | Paper |
| The Normal Graph Conjecture for Classes of Sparse Graphs | 2013-12-06 | Paper |
| Dismantlable Lattices in the Mirror | 2013-05-31 | Paper |
| A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph | 2013-03-28 | Paper |
| Triangulation and Clique Separator Decomposition of Claw-Free Graphs | 2012-11-06 | Paper |
| A Peep through the Looking Glass: Articulation Points in Lattices | 2012-09-10 | Paper |
| A general label search to investigate classical graph search algorithms | 2011-01-21 | Paper |
| Maximal Label Search Algorithms to Compute Perfect and Minimal Elimination Orderings | 2010-03-17 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2010-01-12 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree | 2009-01-08 | Paper |
| Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs | 2008-08-13 | Paper |
| A local approach to concept generation | 2007-10-12 | Paper |
| Performances of Galois Sub-hierarchy-building Algorithms | 2007-09-03 | Paper |
| Extremities and orderings defined by generalized graph search algorithms | 2007-05-29 | Paper |
| Formal Concept Analysis | 2007-02-12 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| Maximal sub-triangulation in pre-processing phylogenetic data | 2006-08-18 | Paper |
| A wide-range algorithm for minimal triangulation from an arbitrary ordering | 2006-04-28 | Paper |
| Generalized domination in closure systems | 2006-04-28 | Paper |
| A vertex incremental approach for maintaining chordality | 2006-03-29 | Paper |
| Formal Concept Analysis | 2005-12-02 | Paper |
| Representing a concept lattice by a graph | 2004-11-12 | Paper |
| Maximum cardinality search for computing minimal triangulations of graphs | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414480 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4709056 | 2003-06-20 | Paper |
| Asteroidal triples of moplexes | 2002-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721974 | 2001-07-11 | Paper |
| Recognizing weakly triangulated graphs by edge separability | 2001-04-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4944976 | 2000-06-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252378 | 1999-06-17 | Paper |
| Separability generalizes Dirac's theorem | 1998-11-17 | Paper |
