Eduard Eiben

TU Wien, Royal Holloway University of London

Papers

Total Citations

H-Index

About

Eduard Eiben is a leading researcher in parameterized complexity and algorithmic robotics, whose work bridges theoretical computer science and practical motion planning. His most influential contribution, the 2018 paper "Improved Results for Minimum Constraint Removal" (14 citations), tackles a fundamental problem in robotic pathfinding: given obstacles in the plane, find the fewest obstacles to remove so a collision-free path exists between two points. This work advances both robotic motion planning and computational geometry. Eiben has since extended his expertise to coordinated multi-robot systems, as shown in his 2023 paper on "The Parameterized Complexity of Coordinated Motion Planning" (2 citations), which analyzes the complexity of moving multiple robots on a grid to distinct destinations without collisions. He also explores novel terrain coverage problems, such as in his 2020 work on "Covering a 3-D Terrain" (2 citations), where he models elevation data as weighted graphs for sweeping robots with cameras. Eiben’s research is characterized by rigorous parameterized analysis that reveals when seemingly intractable problems become solvable, making him a key figure in understanding the algorithmic foundations of autonomous navigation and multi-agent coordination.