Henning Fernau

Papers

Total Citations

H-Index

About

Henning Fernau is a leading figure in theoretical computer science, with a primary focus on algorithms, computational complexity, and formal languages. His most-cited work, "Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds" (2022), addresses a fundamental challenge in robotics: coordinating multiple identical robots in a polygonal workspace without collisions. Fernau’s key contribution lies in deriving tighter separation bounds that guarantee efficient, scalable motion plans for unlabeled robots—where any robot can occupy any target position. This work bridges algorithmic theory and practical robotics, offering provable performance guarantees that reduce computational overhead. With over 4 citations to this paper alone, his research has influenced both theoretical analysis and applied multi-agent systems. Beyond this, Fernau has made substantial contributions to graph algorithms, parameterized complexity, and automata theory, often exploring the boundaries of tractability in hard problems. His achievements include numerous publications in top venues and editorial roles, cementing his reputation as a rigorous thinker who advances the frontier of what is computationally feasible. For students and researchers, Fernau’s work exemplifies how elegant mathematical insights can solve real-world coordination challenges.