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