Daniel Meister. Computing Treewidth and Minimum Fill-In for Permutation Graphs in Linear Time. In Dieter Kratsch, editor, Graph-Theoretic Concepts in Computer Science, 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers. Volume 3787 of Lecture Notes in Computer Science, pages 91-102, Springer, 2005. [doi]
Abstract is missing.