| Publication | Date of Publication | Type |
|---|
Graph extremities defined by search algorithms
Algorithms | 2018-08-20 | Paper |
An introduction to clique minimal separator decomposition
Algorithms | 2018-08-20 | Paper |
Computing a clique tree with the algorithm maximal label search
Algorithms | 2018-08-20 | Paper |
The normal graph conjecture for two classes of sparse graphs
Graphs and Combinatorics | 2018-03-22 | Paper |
| Moplex elimination orderings | 2016-07-01 | Paper |
The Dilworth number of auto-chordal bipartite graphs
Graphs and Combinatorics | 2015-09-24 | Paper |
| Two tricks to triangulate chordal probe graphs in polynomial time | 2015-08-03 | Paper |
GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH
International Journal of Foundations of Computer Science | 2015-04-29 | Paper |
Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds
Discrete Applied Mathematics | 2015-04-28 | Paper |
Hermes: a simple and efficient algorithm for building the AOC-poset of a binary relation
Annals of Mathematics and Artificial Intelligence | 2015-02-05 | Paper |
Organizing the atoms of the clique separator decomposition into an atom tree
Discrete Applied Mathematics | 2014-09-08 | Paper |
The normal graph conjecture for classes of sparse graphs
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
Dismantlable lattices in the mirror
Formal Concept Analysis | 2013-05-31 | Paper |
A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph
Information Processing Letters | 2013-03-28 | Paper |
Triangulation and clique separator decomposition of claw-free graphs
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
A peep through the looking glass: articulation points in lattices
Formal Concept Analysis | 2012-09-10 | Paper |
A general label search to investigate classical graph search algorithms
Discrete Applied Mathematics | 2011-01-21 | Paper |
Maximal label search algorithms to compute perfect and minimal elimination orderings
SIAM Journal on Discrete Mathematics | 2010-03-17 | Paper |
The minimum degree heuristic and the minimal triangulation process.
Lecture Notes in Computer Science | 2010-01-12 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree
Theoretical Computer Science | 2009-01-08 | Paper |
Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs
SIAM Journal on Discrete Mathematics | 2008-08-13 | Paper |
A local approach to concept generation
Annals of Mathematics and Artificial Intelligence | 2007-10-12 | Paper |
Performances of Galois Sub-hierarchy-building Algorithms
Formal Concept Analysis | 2007-09-03 | Paper |
Extremities and orderings defined by generalized graph search algorithms
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Formal Concept Analysis
Lecture Notes in Computer Science | 2007-02-12 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Maximal sub-triangulation in pre-processing phylogenetic data
Soft Computing | 2006-08-18 | Paper |
A wide-range algorithm for minimal triangulation from an arbitrary ordering
Journal of Algorithms | 2006-04-28 | Paper |
Generalized domination in closure systems
Discrete Applied Mathematics | 2006-04-28 | Paper |
A vertex incremental approach for maintaining chordality
Discrete Mathematics | 2006-03-29 | Paper |
Formal Concept Analysis
Lecture Notes in Computer Science | 2005-12-02 | Paper |
Representing a concept lattice by a graph
Discrete Applied Mathematics | 2004-11-12 | Paper |
Maximum cardinality search for computing minimal triangulations of graphs
Algorithmica | 2004-10-01 | Paper |
| scientific article; zbMATH DE number 1953077 (Why is no real title available?) | 2003-07-25 | Paper |
| scientific article; zbMATH DE number 1931756 (Why is no real title available?) | 2003-06-20 | Paper |
Asteroidal triples of moplexes
Discrete Applied Mathematics | 2002-02-07 | Paper |
| scientific article; zbMATH DE number 1617254 (Why is no real title available?) | 2001-07-11 | Paper |
Recognizing weakly triangulated graphs by edge separability
Nordic Journal of Computing | 2001-04-17 | Paper |
| scientific article; zbMATH DE number 1420907 (Why is no real title available?) | 2000-06-07 | Paper |
| scientific article; zbMATH DE number 1305489 (Why is no real title available?) | 1999-06-17 | Paper |
Separability generalizes Dirac's theorem
Discrete Applied Mathematics | 1998-11-17 | Paper |
