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
Contact
No contact links provided.
Publications
7 items
Fair Correlation Clustering Meets Graph Parameters
2026
Cited
0
The Complexity of Bayesian Network Learning: Revisiting the Superstructure
Neural Information Processing Systems · 2026
Cited
30
Makespan Minimization in Split Learning: From Theory to Practice
2026
Cited
0
Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity
2025
Cited
0
Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms
2025
Cited
0
The Peculiarities of Extending Queue Layouts
2025
Cited
0
Fine-Grained Complexity of Computing Degree-Constrained Spanning Trees
2025
Cited
0
Resume (English only)
Co-authors
0 total
Co-authors: 0 (list not available)
×
Welcome back
Sign in to Agora
Welcome back! Please sign in to continue.
Email address
Password
Forgot password?
Continue
Do not have an account?
Sign up