Krisztina Szilágyi

Hi! I'm Krisztina, a computer science postdoc at the Czech Technical University in Prague. I'm a part of the G^2OAT research group, supervised by Dušan Knop.  

Before moving to computer science I studied mathematics, and now I'm working in the intersection of the two. My PhD advisors were Jesper Nederlof and Hans L. Bodlaender. I am mainly working on parameterized complexity of graph problems, and I am particularly interested in geometric intersection graphs.

For a more detailed CV, see here.

• 2024- : Postdoc at Czech Technical University in Prague, supervisor: Dušan Knop

• 2020-2024: Computer science PhD at Utrecht University, advisors: Hans L. Bodlaender, Jesper Nederlof

• 2018-2020: Mathematics Master studies at Berlin Mathematical School/Freie Universität Berlin

• 2015-2018: Mathematics Bachelor studies at University of Cambridge

2025

• August 2025: our paper, Pathfinding in Self-Deleting Graphs, was accepted to ISAAC 2025

• July 2025: spent a month at Max Planck Institute for Informatics, hosted by Karol Węgrzycki, and working with Florian Hörsch, Daniel Neuen and Marta Piecyk.

2024

• December 2024: attended HOMONOLO, a workshop organized by our colleagues at Charles University

• November 2024: started my postdoc in Prague at Czech Technical University 

• September 2024: successfully defended my thesis! The thesis title is Parameterized Complexity of Restricted Variants of Some Classical Problems. The defense took place on September 18, in Utrecht.

• After submitting my thesis, I travelled a bit during the summer:

  • Research visit to Karlsruhe, visiting Marvin Künnemann

  • Research visit to Prague, visiting Dušan Knop

  • WG 2024 (Slovenia), presented our paper

  • HALG 2024 (Warsaw), poster presentation

  • Research visit to Vienna, visiting Robert Ganian

  • EPIT 2024 Summer School (France)