121 citations · 181 across the 38 of their papers we have counts for
3 papers · 1 filter
Tight Lower Bounds for Problems Parameterized by Rank-width
Benjamin Bergougnoux, Tuukka Korhonen, Jesper Nederlof
We show that there is no time algorithm for Independent Set on -vertex graphs with rank-width , unless the Exponential Time Hypothesis (ETH) fails. Our…
Makespan Scheduling of Unit Jobs with Precedence Constraints in time
Jesper Nederlof, Céline M. F. Swennenhuis, Karol Węgrzycki
In a classical scheduling problem, we are given a set of jobs of unit length along with precedence constraints and the goal is to find a schedule of these jobs on identical…
Bounding generalized coloring numbers of planar graphs using coin models
Jesper Nederlof, Michał Pilipczuk, Karol Węgrzycki
We study Koebe orderings of planar graphs: vertex orderings obtained by modelling the graph as the intersection graph of pairwise internally-disjoint discs in the plane, and orderi…