A practical algorithm for making filled graphs minimal

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

Fully dynamic algorithms for chordal graphs and split graphs

ACM Transactions on Algorithms (TALG)

Characterizing and Computing Minimal Cograph Completions

FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics

Solving problems on recursively constructed graphs

ACM Computing Surveys (CSUR)

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

Minimal split completions

Discrete Applied Mathematics

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

Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network

Theoretical Computer Science

Treewidth computations I. Upper bounds

Information and Computation

Characterizing and computing minimal cograph completions

Discrete Applied Mathematics

Fast minimal triangulation algorithm using minimum degree criterion

Theoretical Computer Science

Treewidth: characterizations, applications, and computations

WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science

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

Ultimate generalizations of LexBFS and LEX m

WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science

Minimal split completions of graphs

LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics

Fully dynamic algorithm for chordal graphs with O(1) query-time and O(n 2) update-time

Theoretical Computer Science

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

COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics