3 citations · 3 across the 1 of their papers we have counts for
2 papers
cs.DS2011★ 3 cited
Contracting Graphs to Paths and Trees
Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque +2
Vertex deletion and edge deletion problems play a central role in Parameterized Complexity. Examples include classical problems like Feedback Vertex Set, Odd Cycle Transversal, and…
cs.DS2011
Obtaining a Bipartite Graph by Contracting Few Edges
Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov +1
We initiate the study of the Bipartite Contraction problem from the perspective of parameterized complexity. In this problem we are given a graph and an integer , and the ta…