32 citations · 33 across the 2 of their papers we have counts for
2 papers
cs.DM2009★ 32 cited
Graph-based data clustering: a quadratic-vertex problem kernel for s-Plex Cluster Vertex Deletion
René van Bevern
We introduce the s-Plex Cluster Vertex Deletion problem. Like the Cluster Vertex Deletion problem, it is NP-hard and motivated by graph-based data clustering. While the task in Clu…
cs.CC2009★ 1 cited
A Generalization of Nemhauser and Trotter's Local Optimization Theorem
Michael R. Fellows, Jiong Guo, Hannes Moser +1
The Nemhauser-Trotter local optimization theorem applies to the NP-hard Vertex Cover problem and has applications in approximation as well as parameterized algorithmics. We present…