| 2026 | LICS | Distinguishing Graphs by Counting Homomorphisms from Sparse Graphs. | Daniel Neuen, Tim Seppelt |
| 2026 | STOC | Lower Bounds in Algebraic Complexity via Symmetry and Homomorphism Polynomials. | Prateek Dwivedi, Benedikt Pago, Tim Seppelt |
| 2026 | STACS | Homomorphism Indistinguishability, Multiplicity Automata Equivalence, and Polynomial Identity Testing. | Marek Cern, Tim Seppelt |
| 2025 | ICALP | NPA Hierarchy for Quantum Isomorphism and Homomorphism Indistinguishability. | Prem Nigam Kar, David E. Roberson, Tim Seppelt, Peter Zeman |
| 2024 | CSL | Going Deep and Going Wide: Counting Logic and Homomorphism Indistinguishability over Graphs of Bounded Treedepth and Treewidth. | Eva Fluck, Tim Seppelt, Gian Luca Spitzer |
| 2024 | CSL | Limitations of Game Comonads for Invertible-Map Equivalence via Homomorphism Indistinguishability. | Moritz Lichter, Benedikt Pago, Tim Seppelt |
| 2024 | MFCS | An Algorithmic Meta Theorem for Homomorphism Indistinguishability. | Tim Seppelt |
| 2024 | STACS | The Complexity of Homomorphism Reconstructibility. | Jan Bker, Louis Hrtel, Nina Runde, Tim Seppelt, Christoph Standke |
| 2023 | ICALP | Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability. | David E. Roberson, Tim Seppelt |
| 2023 | MFCS | Logical Equivalences, Homomorphism Indistinguishability, and Forbidden Minors. | Tim Seppelt |
| 2023 | SODA | Weisfeiler-Leman and Graph Spectra. | Gaurav Rattan, Tim Seppelt |
| 2022 | ICALP | Homomorphism Tensors and Linear Equations. | Martin Grohe, Gaurav Rattan, Tim Seppelt |