Rolf Niedermeier

Papers

Total Citations

H-Index

About

Rolf Niedermeier is a leading figure in theoretical computer science, renowned for his foundational contributions to parameterized complexity, graph algorithms, and temporal graph theory. His recent work on temporal networks has broken new ground, particularly in studying "interference-free walks in time"—a problem that asks for temporally disjoint paths in graphs where edges appear at discrete time steps. His 2021 and 2022 papers on this topic, which together have garnered nearly 20 citations, investigate the computational complexity of finding such paths, offering critical insights into scheduling, routing, and network security in time-evolving systems. Beyond this, Niedermeier is widely celebrated for his seminal textbook *Invitation to Fixed-Parameter Algorithms* and his pioneering work on data reduction and kernelization, which have shaped modern algorithm design. With thousands of citations across his career, his research continues to influence fields from bioinformatics to social network analysis. For students and researchers, Niedermeier’s work exemplifies how deep theoretical rigor can unlock practical solutions for dynamic, real-world problems.