New Results on Minimal Triangulations
Has parts
Paper I: Reprinted from Journal of Algorithms, 58(1), Anne Berry, Jean-Paul Bordat, Pinar Heggernes, Genevieve Simonet, and Yngve Villanger, A wide-range algorithm for minimal triangulation from an arbitrary ordering, 33-66, Copyright 2006, with permission from ElsevierPaper II: "Reprinted from Discrete Mathematics, 306(3), Anne Berry, Pinar Heggernes and Yngve Villanger, A Vertex Incremental Approach for Maintening Chordiality. 318-336, Copyright 2006, with permission from Elsevier.
Paper III: Reprinted from Discrete Mathematics, 306(3), Yngve Villanger, Lex M versus MCS-M, 393-400, Copyright 2006, with permission from Elsevier.
Paper IV: Reprinted from SIAM Discrete Mathematics, 19(4), Heggernes, Pinar, Telle, Jan Arne, and Villanger, Yngve. Computing minimal triangulation in Time[...]. pages 900-913, Copyright 2006, with permission from SIAM Journals.
Paper V: Reprinted from SIAM Journal on computing, Fomin, Fedor V., Todinca, Ioan, Kratsch, Dieter and Villanger Yngve, Exact algorithms for treewidth and minimum fill-in, To be published, Copyright 2006, with permission from SIAM Journals.