The Graph Isomorphism Problem: Local Certificates for Giant Action. - Tim Seppelt (CoRR, 2019)

Weisfeiler-Leman, Graph Spectra, and Random Walks. - Gaurav Rattan; Tim Seppelt (CoRR, 2021)

Homomorphism Tensors and Linear Equations. - Martin Grohe; Gaurav Rattan; Tim Seppelt (ICALP, 2022)

Weisfeiler-Leman and Graph Spectra. - Gaurav Rattan; Tim Seppelt (SODA, 2023)

Limitations of Game Comonads via Homomorphism Indistinguishability. - Moritz Lichter; Benedikt Pago; Tim Seppelt (CoRR, 2023)

Going Deep and Going Wide: Counting Logic and Homomorphism Indistinguishability over Graphs of Bounded Treedepth and Treewidth. - Eva Fluck; Tim Seppelt; Gian Luca Spitzer (CSL, 2024)

Limitations of Game Comonads for Invertible-Map Equivalence via Homomorphism Indistinguishability. - Moritz Lichter; Benedikt Pago; Tim Seppelt (CSL, 2024)

An Algorithmic Meta Theorem for Homomorphism Indistinguishability. - Tim Seppelt (MFCS, 2024)

The Complexity of Homomorphism Reconstructibility. - Jan Böker; Louis Härtel; Nina Runde; Tim Seppelt; Christoph Standke (STACS, 2024)

Logical equivalences, homomorphism indistinguishability, and forbidden minors. - Tim Seppelt (Inf. Comput., 2024)

Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability. - David E. Roberson; Tim Seppelt (TheoretiCS, 2024)

NPA Hierarchy for Quantum Isomorphism and Homomorphism Indistinguishability. - Prem Nigam Kar; David E. Roberson; Tim Seppelt; Peter Zeman 001 (ICALP, 2025)

Symmetric Algebraic Circuits and Homomorphism Polynomials. - Anuj Dawar; Benedikt Pago; Tim Seppelt (CoRR, 2025)

Going deep and going wide: Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth. - Isolde Adler; Eva Fluck; Tim Seppelt; Gian Luca Spitzer (CoRR, 2025)