Algorithms (ALGO) cluster
Eindhoven University of Technology
5600 MB Eindhoven the Netherlands
Workplace: MetaForum 7.122
Email: c dot m dot f dot swennenhuis at tue dot nl (from 1st of January 2024, replace the last with gmail)
Wednesday December 13 I presented our latest scheduling result at the global Scheduling Seminar! I talked about a subexponential time algorithm for a scheduling problem with precedence constraints. You can watch the talk at either the Scheduling Seminar website or on Youtube.
From Januari 2024 I will no longer work at TU/e and I will no longer be reachable at my academic email address. In need you can contact me either via my gmail (cmf + lastname at gmail) or LinkedIn.
December 2nd 2023 I successfully defended my doctoral dissertation Fine-Grained Parameterized Complexity of Scheduling and Sequencing Problems!
I still have plenty of copies of my dissertation, so if you're interested let me
know and I'll send you one.
Céline Swennenhuis was a postdoctoral researcher at Eindhoven University of Technology, under the supervision of Bart Jansen. She successfully defended her PhD thesis called Fine-Grained Parameterized Complexity of Scheduling and Sequencing Problems at December 2nd 2022. She was supervised by Jesper Nederlof (daily supervisor, co-promotor) and Frits Spieksma (promotor). She visited the group of Fedor Fomin at Bergen University from April 2022 to July 2022. She received her MSc. in Applied Mathematics cum laude (with a specialization in optimization) from Delft University of Technology in 2018.
See also my DBLP page.
2023
Roel Lambers, Rudi Pendavingh, Frits Spieksma, Céline M.F. Swennenhuis.
Scheduling Jobs that Change over Time.
(arXiv)
Jesper Nederlof, Céline M.F. Swennenhuis and Karol Węgrzycki.
A Subexponential Time Algorithm for Makespan Scheduling of Unit Jobs with Precedence Constraints.
(arXiv)
2022
Céline M.F. Swennenhuis.
Doctoral Dissertation: Fine-Grained Parameterized Complexity of Scheduling and Sequencing Problems.
(Link)
Jesper Nederlof, Michal Pilipczuk, Céline M.F. Swennenhuis and Karol Węgrzycki.
Isolation schemes for problems on
decomposable graphs.
(STACS '22)
(arXiv)
2021
Hans L. Bodlaender, Carla Groenland, Jesper Nederlof and Céline M.F. Swennenhuis.
Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space.
(FOCS'21)
(arXiv)
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.
Journal version in SIAM Journal on Computing, 2023
(SODA'21)
(arXiv)
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.
(WG'21)
(arXiv)
Hans L. Bodlaender, Carla Groenland, Céline M.F. Swennenhuis.
Parameterized Complexities of Dominating and Independent Set Reconfiguration.
(IPEC'21)
(arXiv)
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.
Journal version in SIAM Journal on Discrete Mathematics, 2023
(WG 2020, best paper award )
(WG'20)
(arXiv)
Jesper Nederlof and Céline M.F. Swennenhuis.
On the Fine-Grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan.
Journal version in Algorithmica 2022
(IPEC'20)
(arXiv)
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)
Bachelor/Master/PhD Thesis
Doctoral Dissertation: Fine-Grained Parameterized Complexity of Scheduling and Sequencing Problems. (Link)
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)
| Year | Venue | Title | Slides | Recorded Talk |
|---|---|---|---|---|
| 2023 | Scheduling Seminar | A Subexponential Time Algorithm for Makespan Scheduling of Unit Jobs with Precedence Constraints | (Pdf) | Youtube |
| Utrecht University Algorithms Seminar | A Subexponential Time Algorithm for Makespan Scheduling of Unit Jobs with Precedence Constraints | |||
| Max Planck Institute for Informatics (MPI) Saarbrücken | A Subexponential Time Algorithm for Makespan Scheduling of Unit Jobs with Precedence Constraints | (Pdf) | ||
| TU Eindhoven CO seminar | A Subexponential Time Algorithm for Makespan Scheduling of Unit Jobs with Precedence Constraints | (Pdf) | ||
| Dutch Days of Combinatorics 2023 | Bin Packing with the Help of Additive Combinatorics | (Pdf) | ||
| 2022 | Defense of Doctoral Dissertation | A Short Introduction into Fine-Grained and Parameterized Complexity | (Pdf) | |
| DIAMANT Symposium Autumn 2022 | Makespan Scheduling of Unit Jobs with Precedence Constraints in O(1.995^n) time | (Pdf) | ||
| Discrete Math and Optimization Seminar, TU Delft | Makespan Scheduling of Unit Jobs with Precedence Constraints in O(1.995^n) time | (Pdf) | ||
| Utrecht University Algorithms Seminar | Makespan Scheduling of Unit Jobs with Precedence Constraints in O(1.995^n) time | (Pdf) | ||
| Algorithms Seminar of University of Bergen | Bin Packing with a Constant Number of Bins | (Pdf) | ||
| Advances in Parameterized Graph Algorithms (APGA) | Parameterized Complexities of Independent Set Reconfiguration | (Pdf) | ||
| FOCS | Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space | (Pdf) | Youtube | |
| 2021 | Workshop `Parameterized complexity and discrete optimization' | Bin Packing with a Constant Number of Bins | (Pdf) | Youtube |
| Utrecht University Algorithms Seminar | Parameterized Complexities of Independent Set Reconfiguration | (Pdf) | ||
| IPEC | Parameterized 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) | ||
| SODA 2021 | A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins | |||
| 2020 | WG | Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space | (Pdf) | |
| IPEC | Parameterized Complexity of Partial Scheduling | (Pdf) | ||
| Utrecht University Algorithms Seminar | 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 |
2022-2023 (TU/e)
Q1: Linear Optimization (TA, with Rudi Pendavingh)
2021-2022 (TU/e)
Q1: Linear Optimization (TA, with Rudi Pendavingh)
Q3: Graphs & Algorithms (TA, with Laura Sanità)
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)