Carsten Thomassen

Carsten Thomassen is a Professor in the Department of Applied Mathematics and Computer Science at the Technical University of Denmark (DTU), where he is affiliated with the Algorithms, Logic and Graphs section. His work bridges theoretical mathematics and computer science, with a strong emphasis on structural and algorithmic graph theory.

His research interests lie primarily in Graph Theory, Combinatorics, and Discrete Mathematics. He investigates fundamental properties of graphs, including connectivity, coloring, planarity, and structural decomposition. His work often addresses long-standing conjectures and provides constructive proofs with algorithmic implications.

The recent publications highlight a consistent focus on graph connectivity, coloring, and dynamic algorithms. Key trends include the study of edge-connectivity augmentation, group coloring, 3-colorings in planar graphs, and dynamic arboricity decomposition. These works fall under broader disciplines such as Discrete Mathematics, Theoretical Computer Science, and Combinatorics, with specific subfields like structural graph theory, network reliability, and algorithm design.

Carsten Thomassen actively supervises multiple PhD students across various projects involving graph algorithms, quantum strategies in nonlocal games, and combinatorial geometry. He contributes to research grants and collaborative projects, often serving as a supervisor in interdisciplinary efforts combining mathematics and computer science.

He is involved in several active research labs and teams at DTU, particularly within the Algorithms, Logic and Graphs group. This team focuses on combinatorial algorithms, graph-based models, and theoretical foundations of computing, fostering collaboration between mathematicians and computer scientists.