| 2026 | ICALP | Fine-Grained Complexity of Computing Degree-Constrained Spanning Trees. | Narek Bojikian, Alexander Firbas, Robert Ganian, Hung P. Hoang, Krisztina Szilgyi |
| 2026 | STACS | A Polynomial Kernel for Face Cover on Non-Embedded Planar Graphs. | Thekla Hamm, Sukanya Pandey, Krisztina Szilgyi |
| 2025 | ISAAC | Pathfinding in Self-Deleting Graphs. | Michal Dvork, Dusan Knop, Michal Opler, Jan Pokorn, Ondrej Such, Krisztina Szilgyi |
| 2024 | SOFSEM | Parameterized Algorithms for Covering by Arithmetic Progressions. | Ivan Bliznets, Jesper Nederlof, Krisztina Szilgyi |
| 2024 | SOFSEM | Algorithms and Turing Kernels for Detecting and Counting Small Patterns in Unit Disk Graphs. | Jesper Nederlof, Krisztina Szilgyi |
| 2024 | WG | XNLP-Hardness of Parameterized Problems on Planar Graphs. | Hans L. Bodlaender, Krisztina Szilgyi |
| 2022 | STACS | Tight Bounds for Counting Colorings and Connected Edge Sets Parameterized by Cutwidth. | Carla Groenland, Isja Mannens, Jesper Nederlof, Krisztina Szilgyi |
| 2021 | WG | On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem. | Isja Mannens, Jesper Nederlof, Cline M. F. Swennenhuis, Krisztina Szilgyi |