Tim Seppelt
PhD student at RWTH Aachen University
I’m a fourth-year PhD student at RWTH Aachen University. My supervisors are Prof Martin Grohe and Prof Michael Schaub. I’m funded by the German Research Foundation (DFG) via Research Training Group 2236 (UnRAVeL).
I’m interested in graphs and more specifically in theoretical and algorithmic notions concerning the similarity of two graphs. A central theme of my PhD is homomorphism indistinguishability, which describes the similarity of graphs in terms of numbers of homomorphisms.
news
Feb 15, 2024 | My new preprint An Algorithmic Meta Theorem for Homomorphism Indistinguishability is now available on arXiv. The slides of the talk I gave about it at AlMoTh 2024 are also online. Check them out! |
---|---|
Dec 13, 2023 | Our paper The Complexity of Homomorphism Reconstructibility (with Jan Böker, Louis Härtel, Nina Runde, and Christoph Standke) was accepted for STACS 2024. |
Nov 16, 2023 | I gave a talk at the 2nd Workshop on Logic, Graphs, and Algorithms (LoGAlg). Check out my slides! |
Oct 28, 2023 | Our papers Limitations of Game Comonads for Invertible-Map Equivalence via Homomorphism Indistinguishability (with Moritz Lichter and Benedikt Pago) and Going Deep and Going Wide: Counting Logic and Homomorphism Indistinguishability over Graphs of Bounded Treedepth and Treewidth (with Eva Fluck and Gian Luca Spitzer) were accepted for CSL 2024. |
Oct 16, 2023 | We’ve uploaded a new preprint to arXiv: Check out The Complexity of Homomorphism Reconstructibility (with Jan Böker, Louis Härtel, Nina Runde, and Christoph Standke)! |