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 proceedingConference contributionAcademicpeer-review

18 Citations (Scopus)
24 Downloads (Pure)
Original languageEnglish
Title of host publicationIARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India
EditorsSupratik Chakraborty, Amit Kumar
PublisherDagstuhl
Pages217-228
Number of pages12
DOIs
Publication statusPublished - 2011
Externally publishedYes
EventIARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011 - IIT, Bombay, India
Duration: 12 Dec 201114 Dec 2011

Publication series

NameLIPIcs
PublisherSchloss Dagstuhl - Leibniz-Zentrum für Informatik
Volume13

Conference

ConferenceIARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011
Abbreviated titleFSTTCS 2011
CountryIndia
CityBombay
Period12/12/1114/12/11

Cite this