%0 Conference Paper %1 conf/fsttcs/FominPV11 %A Fomin, Fedor V. %A Philip, Geevarghese %A Villanger, Yngve %B FSTTCS %D 2011 %E Chakraborty, Supratik %E Kumar, Amit %I Schloss Dagstuhl - Leibniz-Zentrum für Informatik %K dblp %P 164-175 %T Minimum Fill-in of Sparse Graphs: Kernelization and Approximation. %U http://dblp.uni-trier.de/db/conf/fsttcs/fsttcs2011.html#FominPV11 %V 13 %@ 978-3-939897-34-7

@inproceedings{conf/fsttcs/FominPV11, added-at = {2018-08-23T00:00:00.000+0200}, author = {Fomin, Fedor V. and Philip, Geevarghese and Villanger, Yngve}, biburl = {https://www.bibsonomy.org/bibtex/2287033689140e3168692f795e1645e4a/dblp}, booktitle = {FSTTCS}, crossref = {conf/fsttcs/2011}, editor = {Chakraborty, Supratik and Kumar, Amit}, ee = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.164}, interhash = {0f064b8a608ff95496242bdb9a613981}, intrahash = {287033689140e3168692f795e1645e4a}, isbn = {978-3-939897-34-7}, keywords = {dblp}, pages = {164-175}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, series = {LIPIcs}, timestamp = {2020-02-12T11:51:42.000+0100}, title = {Minimum Fill-in of Sparse Graphs: Kernelization and Approximation.}, url = {http://dblp.uni-trier.de/db/conf/fsttcs/fsttcs2011.html#FominPV11}, volume = 13, year = 2011 }