3 citations · 4 across the 2 of their papers we have counts for
3 papers · 1 filter
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…
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…
Kernels for Feedback Arc Set In Tournaments
Stéphane Bessy, Fedor V. Fomin, Serge Gaspers +4
A tournament T=(V,A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, the Fe…