Christian Wulff-Nilsen

Christian Wulff-Nilsen is an Associate Professor in the Department of Computer Science at the University of Copenhagen, specializing in algorithms and complexity. His work focuses on theoretical computer science with particular emphasis on graph algorithms and data structures.

His primary research areas include:

• Developing efficient algorithms for general graphs and specialized graphs like planar graphs
• Graphs excluding fixed minors
• Dynamic graph problems with focus on dynamic connectivity
• Classical algorithmic problems including shortest paths and max flow/min cut
• Light and sparse spanners for general graphs

Wulff-Nilsen's research is purely theoretical, with recent publications addressing problems like VC Set Systems in Minor-free Graphs, Exact Distance Oracles for Planar Graphs, and Dynamic Connectivity. His work frequently appears in top theoretical computer science venues including SODA, FOCS, and the Journal of the ACM.

His research has accumulated 68 publications with significant citations, demonstrating impact in the theoretical computer science community. He collaborates extensively with international researchers across multiple institutions, contributing to advancements in graph algorithms and computational complexity.