6 citations · 6 across the 1 of their papers we have counts for
1 paper
Rob Gysel
Kloks, Kratsch, and Spinrad showed how treewidth and minimum-fill, NP-hard combinatorial optimization problems related to minimal triangulations, are broken into subproblems by blo…