Minimum Fill-in of Sparse Graphs: Kernelization and Approximation

Fedor V. Fomin, Geevarghese Philip, Yngve Villanger. Minimum Fill-in of Sparse Graphs: Kernelization and Approximation. In Supratik Chakraborty, Amit Kumar, editors, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India. Volume 13 of LIPIcs, pages 164-175, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2011. [doi]

Abstract

Abstract is missing.