@InProceedings{heggernes_et_al:LIPIcs.FSTTCS.2011.217,
author = {Heggernes, Pinar and van 't Hof, Pim and Lokshtanov, Daniel and Paul, Christophe},
title = {{Obtaining a Bipartite Graph by Contracting Few Edges}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {217--228},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.217},
URN = {urn:nbn:de:0030-drops-33579},
doi = {10.4230/LIPIcs.FSTTCS.2011.217},
annote = {Keywords: fixed parameter tractability, graph modification problems, edge contractions, bipartite graphs}
}