Associate Professor
DTU Compute · Technical University of Denmark
Affiliated with QMATH, University of Copenhagen.
I work in algebraic graph theory and quantum information. Much of my research concerns the relationships between graphs: how they map into one another, what can be learned by counting these maps, and how the picture changes when quantum strategies are allowed. These questions connect combinatorics with quantum symmetry, nonlocal games and semidefinite optimization.
dero@dtu.dk
Curriculum vitae · Google Scholar · ORCID
A Proof of the Weak Roberson Conjecture
Joint work with Arnar Ágúst Kristjánsson, Benjamin Moore, Daniel Neuen, Tim Seppelt and Benjamin Young (2026).
Topological and Geometric Perspectives on Homomorphism Indistinguishability
Joint work with Josse van Dobben de Bruyn, Jérémie Marquès, Tim Seppelt, Gian Luca Spitzer and Peter Zeman (2026).
Oddomorphisms and homomorphism indistinguishability over graphs of bounded degree
Journal of Combinatorial Theory, Series B (2026).