Research Interests
Research Interests
Broadly speaking, I am interested in graph algorithms and their complexity, in particular parameterized complexity. I am also interested in graph drawing and other discrete geometry problems.
T. Hamm, S. Pandey, K. Sz. A Polynomial Kernel for Face Cover on Non-Embedded Planar Graphs. (accepted to STACS 2026) arxiv version
M. Dvořák, D. Knop, M. Opler, J. Pokorný, O. Suchý, K. Sz. Density of Traceable Graphs. (submitted) arxiv version
N. Bojikian, A. Firbas, R. Ganian, H. Hoang, K. Sz. Fine-Grained Complexity of Computing Degree-Constrained Spanning Trees. (submitted) arxiv version
H. L. Bodlaender, K. Sz. XALP-completeness of Parameterized Problems on Planar Graphs. (to appear in Discrete Applied Mathematics) arxiv version
M. Dvořák, D. Knop, M. Opler, J. Pokorný, O. Suchý, K. Szilágyi. Pathfinding in Self-Deleting Graphs. In Proceedings of 36th International Symposium on Algorithms and Computation (ISAAC 2025), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.
PhD thesis: Parameterized Complexity of Restricted Variants of Some Classical Problems, Utrecht University, 2024.
H. L. Bodlaender, K. Sz. XNLP-hardness of Parameterized Problems on Planar Graphs. In Proceedings of 50th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2024), Springer International Publishing, 2024. arxiv version
I. Bliznets, J. Nederlof, K. Sz. Parameterized Algorithms for Covering by Arithmetic Progressions. In Proceedings of 49th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2024), Springer Nature Switzerland, 2024. arxiv version
J. Nederlof, K. Sz. Algorithms and Turing Kernels for Detecting and Counting Small Patterns in Unit Disk Graphs. In Proceedings of 49th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2024), Springer Nature Switzerland, 2024. Best Paper Award, invited to the special issue of Journal of Computer and System Sciences
C. Groenland, J. Nederlof, I. Mannens, K. Sz. Tight Bounds for Counting Colorings and Connected Edge Sets Parameterized by Cutwidth. In Proceedings of 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022), Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2022.
I. Mannens, J. Nederlof, C. Swennenhuis, K. Sz. On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem. In Proceedings of 47th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2021), Springer, Cham, 2021.