Scholar
Robert Ganian
Google Scholar ID: nNem5xIAAAAJ
TU Wien
Algorithms
Parameterized Complexity
Artificial Intelligence
Follow
Homepage
↗
Google Scholar
↗
Citations & Impact
All-time
Citations
1,716
H-index
23
i10-index
65
Publications
20
Co-authors
0
Publications
18 items
A Uniform Algorithm for Strict NP on Bounded-Treedepth Graphs
2026
Cited
0
Perfect Rectangular Tilings with Two Colors
2026
Cited
0
The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern
2026
Cited
0
Not All Degree Constraints Are Created Equal when Computing Spanning Trees
2026
Cited
0
Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset
2026
Cited
0
Two-Layer Drawings with a Tree on Top: Vertex Splits and Fixed-Parameter Algorithms
2026
Cited
0
A Fixed-Parameter Algorithm for Extending Upward Planar Drawings
2026
Cited
0
New Complexity-Theoretic Frontiers of Tractability for Neural Network Training
2026
Cited
0
Load more
