Parallel Machine Scheduling with a Single Resource per Job. - Teun Janssen; Céline M. F. Swennenhuis; Abdoul Bitar; Thomas Bosman; Dion Gijswijt; Leo van Iersel; Stéphane Dauzère-Pérès; Claude Yugma (CoRR, 2018)

Parameterized Complexity of Partial Scheduling. - Jesper Nederlof; Céline M. F. Swennenhuis (CoRR, 2019)

Parameterized Complexities of Dominating and Independent Set Reconfiguration. - Hans L. Bodlaender; Carla Groenland; Céline M. F. Swennenhuis (IPEC, 2021)

On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem. - Isja Mannens; Jesper Nederlof; Céline M. F. Swennenhuis; Krisztina Szilágyi (WG, 2021)

Isolation Schemes for Problems on Decomposable Graphs. - Jesper Nederlof; Michal Pilipczuk; Céline M. F. Swennenhuis; Karol Wegrzycki (STACS, 2022)

On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan. - Jesper Nederlof; Céline M. F. Swennenhuis (Algorithmica, 2022)

Makespan Scheduling of Unit Jobs with Precedence Constraints in O(1.995n) time. - Jesper Nederlof; Céline M. F. Swennenhuis; Karol Wegrzycki (CoRR, 2022)

Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space. - Jesper Nederlof; Michal Pilipczuk; Céline M. F. Swennenhuis; Karol Wegrzycki (SIAM J. Discret. Math., 2023)

A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics. - Jesper Nederlof; Jakub Pawlewicz; Céline M. F. Swennenhuis; Karol Wegrzycki (SIAM J. Comput., 2023)

Steiner Tree Parameterized by Multiway Cut and Even Less. - Bart M. P. Jansen; Céline M. F. Swennenhuis (ESA, 2024)

Parameterized problems complete for nondeterministic FPT time and logarithmic space. - Hans L. Bodlaender; Carla Groenland; Jesper Nederlof; Céline M. F. Swennenhuis (Inf. Comput., 2024)

A Subexponential Time Algorithm for Makespan Scheduling of Unit Jobs with Precedence Constraints. - Jesper Nederlof; Céline M. F. Swennenhuis; Karol Wegrzycki (SODA, 2025)