Tim Frederik Seppelt

Tim Seppelt is currently a postdoc at IT University of Copenhagen, working with Prof. Radu Curticapean. His research interests span computational complexity, including counting and algebraic complexity theory, finite model theory and logic, and graph theory. He is interested in algorithmic aspects of graph homomorphism counts in the context of counting complexity and (relaxations of) graph isomorphism.