Scholar
Krisztina Szilágyi
Google Scholar ID: BFAH-KgAAAAJ
Czech Technical University
algorithms
graph theory
complexity
parameterized complexity
Follow
Homepage
↗
Google Scholar
↗
Citations & Impact
All-time
Citations
24
H-index
2
i10-index
1
Publications
12
Co-authors
8
list available
Contact
CV
Open ↗
LinkedIn
Open ↗
Publications
6 items
Not All Degree Constraints Are Created Equal when Computing Spanning Trees
2026
Cited
0
How Close is a Tree to a Euclidean Minimum Spanning Tree?
2026
Cited
0
A Polynomial Kernel for Face Cover on Non-Embedded Planar Graphs
arXiv.org · 2026
Cited
0
Pathfinding in Self-Deleting Graphs
2025
Cited
0
Fine-Grained Complexity of Computing Degree-Constrained Spanning Trees
2025
Cited
0
XALP-completeness of Parameterized Problems on Planar Graphs
2024
Cited
0
Co-authors
7 total
Jesper Nederlof
Utrecht University
Carla Groenland
TU Delft
Hans L. Bodlaender
Professor Computer Science, Utrecht University
Narek Bojikian
Humboldt University of Berlin
Robert Ganian
TU Wien
Hung P. Hoang
Postdoc at TU Wien
Alexander Firbas
PreDoc Researcher, TU Wien
