114 citations · 306 across the 50 of their papers we have counts for
Showing 2011 · cs.CCShow all
2 papers · 2 filters
cs.CC2011★ 12 cited
Subexponential fixed-parameter tractability of cluster editing
Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk +2
In the Correlation Clustering, also known as Cluster Editing, we are given an undirected n-vertex graph G and a positive integer k. The task is to decide if G can be transformed in…
cs.CC2011★ 12 cited
Hierarchies of Inefficient Kernelizability
Danny Hermelin, Stefan Kratsch, Karolina Sołtys +2
The framework of Bodlaender et al. (ICALP 2008) and Fortnow and Santhanam (STOC 2008) allows us to exclude the existence of polynomial kernels for a range of problems under reasona…