Christian Wulff-Nilsen

Christian Wulff-Nilsen

Associate Professor, Visiting researcher

ORCID: 0000-0002-3699-7821

Primary research areas:

Developing efficient algorithms and data structures for general graphs as well as for more specialized graphs such as planar graphs and more generally graphs excluding a fixed minor. Problems considered are for dynamic graphs, in particular dynamic connectivity, as well as classical algorithmic problems such as shortest paths and max flow/min cut. The research is purely theoretical.

Current research area:

Dynamic connectivity and dynamic minimum spanning forest as well as light and sparse spanners for general graphs.

ID: 40450735