29 citations · 63 across the 22 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.DS2018
What is known about Vertex Cover Kernelization?
Michael R. Fellows, Lars Jaffke, Aliz Izabella Király +2
We are pleased to dedicate this survey on kernelization of the Vertex Cover problem, to Professor Juraj Hromkovič on the occasion of his 60th birthday. The Vertex Cover problem is…
cs.DS2018
A Complexity Dichotomy for Critical Values of the b-Chromatic Number of Graphs
Lars Jaffke, Paloma T. Lima
A -coloring of a graph is a proper coloring of its vertices such that each color class contains a vertex that has at least one neighbor in all the other color classes. The b…
cs.CC2018★ 1 cited
Generalized distance domination problems and their complexity on graphs of bounded mim-width
Lars Jaffke, O-joung Kwon, Torstein J. F. Strømme +1
We generalize the family of -problems and locally checkable vertex partition problems to their distance versions, which naturally captures well-known problems such as dista…