58 citations · 151 across the 35 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.CC2017
Kernelization of Constraint Satisfaction Problems: A Study through Universal Algebra
Victor Lagerkvist, Magnus Wahlström
A kernelization algorithm for a computational problem is a procedure which compresses an instance into an equivalent instance whose size is bounded with respect to a complexity par…
cs.DS2017
Path-contractions, edge deletions and connectivity preservation
Gregory Gutin, M. S. Ramanujan, Felix Reidl +1
We study several problems related to graph modification problems under connectivity constraints from the perspective of parameterized complexity: {\sc (Weighted) Biconnectivity Del…