SIAM Journal on Discrete Mathematics
Making an Arbitrary Filled Graph Minimal by Removing Fill Edges
SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
Approximating the Bandwidth for Asteroidal Triple-Free Graphs
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Recognizing weakly triangulated graphs by edge separability
Nordic Journal of Computing
Generating All the Minimal Separators of a Graph
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Maximum Cardinality Search for Computing Minimal Triangulations
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Efficient Implementation of a Minimal Triangulation Algorithm
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Recognizing Weakly Triangulated Graphs by Edge Separability
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Hybrid backtracking bounded by tree-decomposition of constraint networks
Artificial Intelligence
Two tricks to triangulate chordal probe graphs in polynomial time
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Representing a concept lattice by a graph
Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
A wide-range algorithm for minimal triangulation from an arbitrary ordering
Journal of Algorithms
Discrete Applied Mathematics
On a generalization of triangulated graphs for domains decomposition of CSPs
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Discrete Applied Mathematics
Representing a concept lattice by a graph
Discrete Applied Mathematics
A wide-range algorithm for minimal triangulation from an arbitrary ordering
Journal of Algorithms
Treewidth computations I. Upper bounds
Information and Computation
A note on minimal d-separation trees for structural learning
Artificial Intelligence
Triangulation and clique separator decomposition of claw-free graphs
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Algorithms for unipolar and generalized split graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |