Robert Ganian

Papers

Total Citations

H-Index

About

Robert Ganian is a leading figure in parameterized complexity and algorithmic graph theory, whose work bridges foundational theory and practical problem-solving. His research focuses on structural graph parameters, such as treewidth and clique-width, and their application to hard computational problems in robotics, AI, and combinatorial optimization. A standout contribution is his work on the parameterized complexity of Coordinated Motion Planning (CMP), where he and his co-authors provided tight complexity classifications for multi-robot path planning on grids—a problem critical to warehouse automation and autonomous systems. This 2023 paper, while recent, has already garnered attention for its elegant parameterized analysis. Beyond this, Ganian has published extensively on the complexity of graph problems parameterized by modular width and twin-width, earning over 1,500 citations across his career. He is also recognized for his role in advancing the theory of "safe" and "efficient" algorithms for real-world constraints, and his work has been featured at top venues like STOC, FOCS, and AAAI. For students and researchers, Ganian’s research offers a masterclass in using structural parameters to tame computational intractability.