On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem. - Isja Mannens; Jesper Nederlof; Céline M. F. Swennenhuis; Krisztina Szilágyi (WG, 2021)

Tight Bounds for Counting Colorings and Connected Edge Sets Parameterized by Cutwidth. - Carla Groenland; Isja Mannens; Jesper Nederlof; Krisztina Szilágyi (STACS, 2022)

Parameterized Algorithms for Covering by Arithmetic Progressions. - Ivan Bliznets; Jesper Nederlof; Krisztina Szilágyi (SOFSEM, 2024)

XNLP-Hardness of Parameterized Problems on Planar Graphs. - Hans L. Bodlaender; Krisztina Szilágyi (WG, 2024)

Algorithms and Turing kernels for detecting and counting small patterns in unit disk graphs. - Jesper Nederlof; Krisztina Szilágyi (J. Comput. Syst. Sci., 2025)

Fine-Grained Complexity of Computing Degree-Constrained Spanning Trees. - Narek Bojikian; Alexander Firbas; Robert Ganian; Hung P. Hoang 001; Krisztina Szilágyi (CoRR, 2025)

Pathfinding in Self-Deleting Graphs. - Michal Dvorák; Dusan Knop; Michal Opler; Jan Pokorný; Ondrej Suchý 001; Krisztina Szilágyi (CoRR, 2025)