At TU Delft, I supervise bachelor and master students in topics in discrete mathematics (combinatorics, graph theory) and theoretical computer science (algorithms, complexity, game theory). Feel free to contact me if you want to hear about possible projects, or if you want to propose one yourself! I also teach the following two courses:

• Discrete Wiskunde TW1-31 (first year bachelor course, in Dutch). 

• Probabilistic and Extremal Combinatorics (mastermath, in English).

I don't have funding for research internships and cannot help with visa applications. In the past, I have supervised two ENS students for (in-person) research internships.

PhD students:

• Paul Bastide, 2022-2025 (ongoing), co-supervised with Marthe Bonamy.

• Rohinee Joshi, 2025-(ongoing), co-supervised with Anurag Bishnoi.

Previous bachelor's students:

• Jordi Velthuizen (TU Delft, 2024): A shortcut to the shortest even cycle.

• Jeroen op de Beek (TU Delft, 2024): Domination Games on King Graphs.

Previous master’s students:

• Lander Verlinde (TU Delft, 2023-2024): Polynomial Methods for Grid Covering Problems, co-supervised with Anurag Bisnoi.
  Current: PhD student with Rajko Nenadov (Auckland, New Zealand).

• Gabriëlle Zwaneveld (Utrecht University, 2022-2023): on graph reconstruction from partial information. In particular, she solved a conjecture about recognizing trees for large graphs!
  Current: PhD student with Krystal Guo (Amsterdam).

• Jorke de Vlas (Utrecht University, 2022-2023) working on parameterized complexity of Perfect Phylogeny, co-supervised with Hans Bodlaender.
  Current: PhD student with Peter Jonsson (Linköping, Sweden).

• Paul Bastide (ENS Rennes, 2021-2022) working on distance reconstruction. We also proved various results about saturation, chains and antichains and reconstruction from connected triples.
  Current: PhD student with Marthe Bonamy and me.

• Hugo Jacob (ENS Paris-Saclay, 2021-2022) working on parameterized complexity, co-supervised with Hans Bodlaender. We worked on complexity classes for path-like and tree-like problems, studied computing tree partition width and gave a logspace list colouring algorithm for trees.
  Current: PhD student in Montpellier, France.

• Lucas Meijer (Utrecht University, 2021-2022) working on faster colouring algorithms, co-supervised with Jesper Nederlof. Lucas now holds the fastest (exact) algorithm for 3-colouring.
  Current: PhD student with Till Miltzow (Utrecht).

I also was the examiner / second supervisor for Mike de Vries (now PhD student in Utrecht with Ivan Kryven), Niek Mooij (now PhD student in Utrecht with Ivan Kryven) and Nils van de Berg (now PhD student in Eindhoven with Aida Abiad).