Tim Seppelt

Dr. Tim Seppelt is a postdoctoral researcher at the IT University of Copenhagen, working under the mentorship of Prof. Radu Curticapean. Previously, he earned his PhD from RWTH Aachen University with supervisors Prof. Martin Grohe and Prof. Michael Schaub. His research focuses on theoretical computer science, specifically homomorphism indistinguishability, a framework connecting graph isomorphism, quantum information, and logical equivalences.

• Current Role: Postdoc in Theoretical Computer Science, ITU
• Education: PhD in Computer Science, RWTH Aachen University

Tim's work addresses algorithmic meta-theorems for homomorphism indistinguishability over minor-closed and treewidth-bounded graph classes. He has extended Lovász-type results to CMSO2 logic, resolved complexity conjectures for the Lasserre hierarchy, and classified quantum group-induced indistinguishability relations. His research spans quantum computing, graph algorithms, and descriptive complexity, often intersecting with applications in machine learning and finite model theory.

Recent publications include a 2025 paper on quantum group-driven homomorphism indistinguishability and a 2024 journal article on logical equivalences and forbidden minors. He presented at workshops like the Graph Learning Meets TCS (Simons Institute, 2025) and delivered tutorials on finite model theory at Finite and Algorithmic Model Theory 2025 (Les Houches, France).