Krisztina Szilágyi

According to our database, Krisztina Szilágyi authored at least 9 papers between 2021 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

XALP-completeness of parameterized problems on planar graphs.

Hans L. Bodlaender, Krisztina Szilágyi

Discret. Appl. Math., 2026

A Polynomial Kernel for Face Cover on Non-Embedded Planar Graphs.

Thekla Hamm, Sukanya Pandey, Krisztina Szilágyi

Proceedings of the 43rd International Symposium on Theoretical Aspects of Computer Science, 2026

2025

Fine-Grained Complexity of Computing Degree-Constrained Spanning Trees.

Narek Bojikian, Alexander Firbas, Robert Ganian, Hung P. Hoang, Krisztina Szilágyi

CoRR, March, 2025

Pathfinding in Self-Deleting Graphs.

Michal Dvorák, Dusan Knop, Michal Opler, Jan Pokorný, Ondrej Suchý, Krisztina Szilágyi

Proceedings of the 36th International Symposium on Algorithms and Computation, 2025

2024

XNLP-Hardness of Parameterized Problems on Planar Graphs.

Hans L. Bodlaender, Krisztina Szilágyi

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2024

Algorithms and Turing Kernels for Detecting and Counting Small Patterns in Unit Disk Graphs.

Jesper Nederlof, Krisztina Szilágyi

Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

Parameterized Algorithms for Covering by Arithmetic Progressions.

Ivan Bliznets, Jesper Nederlof, Krisztina Szilágyi

Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

2022

Tight Bounds for Counting Colorings and Connected Edge Sets Parameterized by Cutwidth.

Carla Groenland, Isja Mannens, Jesper Nederlof, Krisztina Szilágyi

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

2021

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

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021