Céline M.F. Swennenhuis MSc. cmfswennenhuis

PhD candidate at TU/e (Eindhoven University of Technology)

Combinatorial Optimization Group
Eindhoven University of Technology
5600 MB Eindhoven the Netherlands

Workplace: MetaForum 4.104B
Email: c dot m dot f dot swennenhuis at tue dot nl

Academic Background

Céline Swennenhuis is a PhD candidate at Eindhoven University of Technology, under the supervision of Frits Spieksma (promotor) and Jesper Nederlof (co-promotor). She received her MSc. in Applied Mathematics (with a specialization in optimization) from Delft University of Technology in 2018.

Publications & Conferences

Preprints

Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis and Karol Węgrzycki (2021). Isolation schemes for problems on decomposable graphs. Arxiv:https://arxiv.org/abs/2105.01465. (pdf)

2021

Jesper Nederlof, Jakub Pawlewicz, Céline M. F. Swennenhuis and Karol Węgrzycki. A faster exponential time algorithm for bin packing with a constant number of bins via additive combinatorics. In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021, pp. 1682–1701. (pdf)

Isja Mannens, Jesper Nederlof, Céline M. F. Swennenhuis and Krisztina Szilagyi. On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem. In Proceedings of WG 2021, pp. 52-79.  (link)

Hans L. Bodlaender, Carla Groenland, Céline M. F. Swennenhuis (2021). Parameterized Complexities of Dominating and Independent Set Reconfiguration. In Proceedings of 16th International Symposium on Parameterized and Exact Computation (IPEC 2021), (to appear), pp. ??. (preprint)

Hans L. Bodlaender, Carla Groenland, Jesper Nederlof and Céline M. F. Swennenhuis (2021). Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space. In proceedings of 62nd annual IEEE symposium on Foundations of Computer Science (FOCS'21), (to appear), pp. ??. (preprint)

2020

Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis and Karol Węgrzycki. Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space. In Proceedings of International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2020), Virtual Conference, June 24-26, 2020, pp. 27–39. (Best paper award) (pdf)

Jesper Nederlof and Céline M. F. Swennenhuis. On the Fine-Grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan. In Proceedings of 15th International Symposium on Parameterized and Exact Computation (IPEC 2020), Virtual Conference, December 14–18, 2020, pp. 25:1–25:17. (pdf)

Unpublished

Teun Janssen, Céline Swennenhuis, Abdoul Bitar, Thomas Bosman, Dion Gijswijt, Leo van Iersel, Stèphane  Dauzère-Pérès and Claude Yugma. Parallel Machine Scheduling with a Single Resource per Job. Arxiv:https://arxiv.org/abs/1809.05009 (pdf)

Bachelor/Master Thesis

Master Thesis: Parallel Machine Scheduling with a Single Resource per Job. (pdf)

Bachelor Thesis: Space-filling Curves Heuristics for the 4D Travelling Salesman Problem in Chip Manufacturing Machines. (pdf)

Presentations

Year Venue Title Slides Recorded Talk
2021 Utrecht University Parameterix Complexities of Independent Set Reconfiguration (Pdf)
IPEC Parameterix Complexities of Independent Set Reconfiguration (Pdf)
Algorithms Seminar at University of Warsaw Bin Packing with a Constant Number of Bins (Pdf) Youtube
Dutch Seminar on Optimization A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins (Pdf) CWI website
TU Eindhoven CO Seminar Parameterized Complexity of Connected Flow and Many Visits TSP (Pdf)
NETWORKS Training week 11 Parameterized Complexity of Connected Flow and Many Visits TSP (Pdf)
2020 WG Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space (Pdf)
IPEC Parameterized Complexity of Partial Scheduling (Pdf) (Large MWV file)
Utrecht University Parameterized Complexity of Partial Scheduling (Pdf)
NETWORKS Training week 10 A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins (Pdf)
2019 MAPSP Parallel Machine Scheduling (Pdf)
NETWORKS Training week 9 Parameterized Complexity of Partial Scheduling (Pdf)
Lunch Seminar of W.I.S.V. ‘CHRISTIAAN HUYGENS’ Parallel Machine Scheduling

Teaching

2021-2022 (TU/e)

Q1: Linear Optimization (TA, with Rudi Pendavingh)

2020-2021 (TU/e)

Q1: Linear Optimization (TA, with Rudi Pendavingh)

Q3: Graphs & Algorithms (TA, with Laura Sanità)

2019-2020 (TU/e)

Q3: Graphs & Algorithms (TA, with Jesper Nederlof)

2018-2019 (TU/e)

Q3: Graphs & Algorithms (TA, with Jesper Nederlof) Excellent Course Evaluation 2018/2019

2015-2018 (TU Delft)

Q3: Automata, Languages and Computability (TA)

Supervision

Master Student(s)

Jelle Teusink (ongoing)

Bachelor Students

Jelle Teusink (Target Set Selection)

Remon Tullemans (Intermittent Traveling Salesman Problem)

Curriculum Vitae

(Link to CV pdf)