Christian Wulff-Nilsen

Primary fields of research

Udvikling af mere effektive algoritmer for graf-problemer, både for planare grafer og for grafer i (geo-)metriske rum. Primære problemer er bestemmelse af korteste veje samt omveje i grafer. Forskningen er teoretisk orienteret.

Current research

Planare grafer: replacement paths-problemet, korteste veje i grafer med negative kantvægte og et orakel til bestemmelse af min cut-vægte.

Knowledge of languages

Dansk, engelsk, norsk, en smule tysk

Short presentation

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.