Minimum Fill-in and Treewidth for Graphs Modularly Decomposable into Chordal Graphs.

Elias Dahlhaus

Browse the full WG paper archive.