13 citations · 59 across the 31 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.CC2015
Fractals for Kernelization Lower Bounds
Till Fluschnik, Danny Hermelin, André Nichterlein +1
The composition technique is a popular method for excluding polynomial-size problem kernels for NP-hard parameterized problems. We present a new technique exploiting triangle-based…
cs.DS2015
Parameterized Complexity of Critical Node Cuts
Danny Hermelin, Moshe Kaspi, Christian Komusiewicz +1
We consider the following natural graph cut problem called Critical Node Cut (CNC): Given a graph on vertices, and two positive integers and , determine whether …