Obtaining a bipartite graph by contracting few edges

Pinar Heggernes; Pim van 't Hof; Daniel Lokshtanov; Christophe Paul

doi:10.4230/LIPIcs.FSTTCS.2011.217

Obtaining a bipartite graph by contracting few edges

Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

19 Citations (Scopus)

43 Downloads (Pure)

Original language	English
Title of host publication	IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India
Editors	Supratik Chakraborty, Amit Kumar
Publisher	Dagstuhl
Pages	217-228
Number of pages	12
DOIs	https://doi.org/10.4230/LIPIcs.FSTTCS.2011.217
Publication status	Published - 2011
Externally published	Yes
Event	IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011 - IIT, Bombay, India Duration: 12 Dec 2011 → 14 Dec 2011

Publication series

Name	LIPIcs
Publisher	Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Volume	13

Conference

Conference	IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011
Abbreviated title	FSTTCS 2011
Country/Territory	India
City	Bombay
Period	12/12/11 → 14/12/11

Access to Document

10.4230/LIPIcs.FSTTCS.2011.217Licence: CC BY

39Final published version, 482 KBLicence: CC BY

Cite this

Heggernes, P., van 't Hof, P., Lokshtanov, D., & Paul, C. (2011). Obtaining a bipartite graph by contracting few edges. In S. Chakraborty, & A. Kumar (Eds.), IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India (pp. 217-228). (LIPIcs; Vol. 13). Dagstuhl. https://doi.org/10.4230/LIPIcs.FSTTCS.2011.217

@inproceedings{eae19cd6b2754180b82e7b2c73f5c7c2,

title = "Obtaining a bipartite graph by contracting few edges",

author = "Pinar Heggernes and {van 't Hof}, Pim and Daniel Lokshtanov and Christophe Paul",

year = "2011",

doi = "10.4230/LIPIcs.FSTTCS.2011.217",

language = "English",

series = "LIPIcs",

publisher = "Dagstuhl",

pages = "217--228",

editor = "Supratik Chakraborty and Amit Kumar",

booktitle = "IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India",

address = "Germany",

note = "IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, FSTTCS 2011 ; Conference date: 12-12-2011 Through 14-12-2011",

}

Heggernes, P, van 't Hof, P, Lokshtanov, D & Paul, C 2011, Obtaining a bipartite graph by contracting few edges. in S Chakraborty & A Kumar (eds), IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India. LIPIcs, vol. 13, Dagstuhl, pp. 217-228, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, Bombay, India, 12/12/11. https://doi.org/10.4230/LIPIcs.FSTTCS.2011.217

Obtaining a bipartite graph by contracting few edges. / Heggernes, Pinar; van 't Hof, Pim; Lokshtanov, Daniel et al.
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India. ed. / Supratik Chakraborty; Amit Kumar. Dagstuhl, 2011. p. 217-228 (LIPIcs; Vol. 13).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Obtaining a bipartite graph by contracting few edges

AU - Heggernes, Pinar

AU - van 't Hof, Pim

AU - Lokshtanov, Daniel

AU - Paul, Christophe

PY - 2011

Y1 - 2011

U2 - 10.4230/LIPIcs.FSTTCS.2011.217

DO - 10.4230/LIPIcs.FSTTCS.2011.217

M3 - Conference contribution

T3 - LIPIcs

SP - 217

EP - 228

BT - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India

A2 - Chakraborty, Supratik

A2 - Kumar, Amit

PB - Dagstuhl

T2 - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011

Y2 - 12 December 2011 through 14 December 2011

ER -