Generating All the Minimal Separators of a Graph
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Discovering patterns of medical practice in large administrative health databases
Data & Knowledge Engineering
Representing a concept lattice by a graph
Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
Discrete Applied Mathematics
Minimal proper interval completions
Information Processing Letters
Minimal interval completion through graph exploration
Theoretical Computer Science
Discrete Applied Mathematics
Representing a concept lattice by a graph
Discrete Applied Mathematics
Separator orders in interval, cocomparability, and AT-free graphs
Discrete Applied Mathematics
A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph
Information Processing Letters
Minimal proper interval completions
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Ultimate generalizations of LexBFS and LEX m
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Lexicographic breadth first search – a survey
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Minimal interval completion through graph exploration
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Triangulation and clique separator decomposition of claw-free graphs
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
On the recognition of k-equistable graphs
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Moplex orderings generated by the LexDFS algorithm
Discrete Applied Mathematics
Hi-index | 0.05 |