Algorithms and Complexity
Universitetsparken 5, 2100 København Ø
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.