pdfformat: 

@InProceedings{fomin_et_al:LIPIcs:2011:3345, author = {Fedor V. Fomin and Geevarghese Philip and Yngve Villanger}, title = {{Minimum Fillin of Sparse Graphs: Kernelization and Approximation}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)}, pages = {164175}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897347}, ISSN = {18688969}, year = {2011}, volume = {13}, editor = {Supratik Chakraborty and Amit Kumar}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3345}, URN = {urn:nbn:de:0030drops33451}, doi = {10.4230/LIPIcs.FSTTCS.2011.164}, annote = {Keywords: Minimum FillIn, Approximation, Kernelization, Sparse graphs } }
Keywords:  Minimum FillIn, Approximation, Kernelization, Sparse graphs  
Seminar:  IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)  
Issue date:  2011  
Date of publication:  2011 