Céline M. F. Swennenhuis

Publication Activity (10 Years)

Years Active: 2018-2024
Publications (10 Years): 23

Top Topics

Precedence Constraints

Independent Set

Parameterized Complexity

Top Venues

Publications

Hans L. Bodlaender, Carla Groenland, Jesper Nederlof, Céline M. F. Swennenhuis
Parameterized problems complete for nondeterministic FPT time and logarithmic space. Inf. Comput. 300 (2024)
Bart M. P. Jansen, Céline M. F. Swennenhuis
Steiner Tree Parameterized by Multiway Cut and Even Less. CoRR (2024)
Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki
Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space. SIAM J. Discret. Math. 37 (3) (2023)
Jesper Nederlof, Céline M. F. Swennenhuis, Karol Wegrzycki
A Subexponential Time Algorithm for Makespan Scheduling of Unit Jobs with Precedence Constraints. CoRR (2023)
Jesper Nederlof, Jakub Pawlewicz, Céline M. F. Swennenhuis, Karol Wegrzycki
A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics. SIAM J. Comput. 52 (6) (2023)
Jesper Nederlof, Céline M. F. Swennenhuis
On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan. Algorithmica 84 (8) (2022)
Hans L. Bodlaender, Carla Groenland, Jesper Nederlof, Céline M. F. Swennenhuis
Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space. FOCS (2022)
Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki
Isolation Schemes for Problems on Decomposable Graphs. STACS (2022)
Jesper Nederlof, Céline M. F. Swennenhuis, Karol Wegrzycki
) time. CoRR (2022)
Jesper Nederlof, Jakub Pawlewicz, Céline M. F. Swennenhuis, Karol Wegrzycki
A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics. SODA (2021)
Isja Mannens, Jesper Nederlof, Céline M. F. Swennenhuis, Krisztina Szilágyi
On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem. CoRR (2021)
Hans L. Bodlaender, Carla Groenland, Céline M. F. Swennenhuis
Parameterized Complexities of Dominating and Independent Set Reconfiguration. IPEC (2021)
Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki
Isolation schemes for problems on decomposable graphs. CoRR (2021)
Hans L. Bodlaender, Carla Groenland, Jesper Nederlof, Céline M. F. Swennenhuis
Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space. FOCS (2021)
Hans L. Bodlaender, Carla Groenland, Céline M. F. Swennenhuis
Parameterized Complexities of Dominating and Independent Set Reconfiguration. CoRR (2021)
Hans L. Bodlaender, Carla Groenland, Jesper Nederlof, Céline M. F. Swennenhuis
Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space. CoRR (2021)
Isja Mannens, Jesper Nederlof, Céline M. F. Swennenhuis, Krisztina Szilágyi
On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem. WG (2021)
Jesper Nederlof, Jakub Pawlewicz, Céline M. F. Swennenhuis, Karol Wegrzycki
A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics. CoRR (2020)
Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki
Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space. WG (2020)
Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki
Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space. CoRR (2020)
Jesper Nederlof, Céline M. F. Swennenhuis
On the Fine-Grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan. IPEC (2020)
Jesper Nederlof, Céline M. F. Swennenhuis
Parameterized Complexity of Partial Scheduling. CoRR (2019)
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
Parallel Machine Scheduling with a Single Resource per Job. CoRR (2018)