Philip, Geevarghese Algorithms and Complexity, MPI for Informatics, Max Planck Society;
http://drops.dagstuhl.de/opus/volltexte/2011/3345/ (Publisher version)
http://drops.dagstuhl.de/doku/urheberrecht1.html (Copyright transfer agreement)
Fomin, F. V., Philip, G., & Villanger, Y. (2011). Minimum Fill-in of Sparse Graphs: Kernelization and Approximation. In S. Chakraborty, & A. Kumar (Eds.), 31st International Conference on Foundations of Software Technology and Theoretical Computer Science (pp. 164-175). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.FSTTCS.2011.164.