Minimal Elimination Ordering Inside a Given Chordal Graph

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

Computing minimal triangulations in time O(nα log n) = o(n2.376)

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms

A wide-range algorithm for minimal triangulation from an arbitrary ordering

Journal of Algorithms

Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs

Discrete Applied Mathematics

Tree decomposition and discrete optimization problems: A survey

Cybernetics and Systems Analysis

Sequential and parallel triangulating algorithms for Elimination Game and new insights on Minimum Degree

Theoretical Computer Science

Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions

Theoretical Computer Science

Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs

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

Minimum fill-in and treewidth of split+ke and split+kv graphs

Discrete Applied Mathematics

Minimum fill-in and treewidth of split+ke and split+kv graphs

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation

Discovering treewidth

SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science

Simple and efficient modifications of elimination orderings

PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing