31 citations · 116 across the 28 of their papers we have counts for
3 papers · 1 filter
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…
Finding Points in General Position
Vincent Froese, Iyad Kanj, André Nichterlein +1
We study computational aspects of the General Position Subset Selection problem defined as follows: Given a set of points in the plane, find a maximum-cardinality subset of points…
Prices Matter for the Parameterized Complexity of Shift Bribery
Robert Bredereck, Jiehua Chen, Piotr Faliszewski +2
In the Shift Bribery problem, we are given an election (based on preference orders), a preferred candidate , and a budget. The goal is to ensure that wins by shifting hi…