Heggernes, Pinar; Van ’T Hof, Pim; Lokshtanov, Daniel; Paul, Christophe Obtaining a bipartite graph by contracting few edges. (English) Zbl 1285.05167 SIAM J. Discrete Math. 27, No. 4, 2143-2156 (2013). MSC: 05C85 68R10 PDFBibTeX XMLCite \textit{P. Heggernes} et al., SIAM J. Discrete Math. 27, No. 4, 2143--2156 (2013; Zbl 1285.05167) Full Text: DOI Link
Heggernes, Pinar; van ’t Hof, Pim; Lokshtanov, Daniel; Paul, Christophe Obtaining a bipartite graph by contracting few edges. (English) Zbl 1246.68132 Chakraborthy, Supraik (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2011), Mumbai, India, December 12–14, 2011. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-34-7). LIPIcs – Leibniz International Proceedings in Informatics 13, 217-228, electronic only (2011). MSC: 68Q25 68R10 05C85 PDFBibTeX XMLCite \textit{P. Heggernes} et al., LIPIcs -- Leibniz Int. Proc. Inform. 13, 217--228 (2011; Zbl 1246.68132) Full Text: DOI
Bodlaender, Hans L.; Heggernes, Pinar; Villanger, Yngve Faster parameterized algorithms for Minimum Fill-in. (English) Zbl 1230.68100 Algorithmica 61, No. 4, 817-838 (2011). MSC: 68Q25 68W40 05C85 PDFBibTeX XMLCite \textit{H. L. Bodlaender} et al., Algorithmica 61, No. 4, 817--838 (2011; Zbl 1230.68100) Full Text: DOI