Eduard Eiben
Scholar

Eduard Eiben

Google Scholar ID: VzCxpJcAAAAJ
Lecturer in Computer Science, Royal Holloway, Univeristy of London
AlgorithmsComplexity TheoryParameterized ComplexityGraph TheoryArtificial Intelligence
Homepage↗Google Scholar↗
Citations & Impact
All-time
Citations
727
 
H-index
15
 
i10-index
30
 
Publications
20
 
Co-authors
15
list available
Contact
Emailit@uib.no
Publications
7 items
Stability in Distance Preservation Games on Graphs
2026
Cited
0
Dividing Indivisible Items for the Benefit of All: It is Hard to Be Fair Without Social Awareness
2025
Cited
0
Parameterized Complexity of Temporal Connected Components: Treewidth and k-Path Graphs
2025
Cited
0
Mechanism Design with Outliers and Predictions
2025
Cited
0
Balanced and Fair Partitioning of Friends
2025
Cited
0
FPT algorithms over linear delta-matroids with applications
2025
Cited
0
Polynomial Kernel and Incompressibility for Prison-Free Edge Deletion and Completion
2025
Cited
0
Resume (English only)
Co-authors
15 total
Robert Ganian
Robert Ganian
TU Wien
Sebastian Ordyniak
Sebastian Ordyniak
University of Leeds
Argyrios Deligkas
Argyrios Deligkas
Royal Holloway University of London
Stefan Szeider
Stefan Szeider
Professor, Head of Algorithms and Complexity Group, TU Wien, Vienna, Austria
Dusan Knop
Dusan Knop
Czech Technical University in Prague
Ramanujan M. S.
Ramanujan M. S.
University of Warwick, UK
O-joung Kwon
O-joung Kwon
Hanyang University
Co-author 8
Co-author 8