Tim Seppelt

According to our database, Tim Seppelt authored at least 18 papers between 2019 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Distinguishing Graphs by Counting Homomorphisms from Sparse Graphs.

Daniel Neuen, Tim Seppelt

CoRR, January, 2026

Lower Bounds in Algebraic Complexity via Symmetry and Homomorphism Polynomials.

Prateek Dwivedi, Benedikt Pago, Tim Seppelt

CoRR, January, 2026

Beyond Bilinear Complexity: What Works and What Breaks with Many Modes?

Cornelius Brand, Radu Curticapean, Petteri Kaski, Baitian Li, Ian Orzel, Tim Seppelt, Jiaheng Wang

Electron. Colloquium Comput. Complex., 2026

Homomorphism Indistinguishability, Multiplicity Automata Equivalence, and Polynomial Identity Testing.

Marek Cerný, Tim Seppelt

Proceedings of the 43rd International Symposium on Theoretical Aspects of Computer Science, 2026

Symmetric Algebraic Circuits and Homomorphism Polynomials.

Anuj Dawar, Benedikt Pago, Tim Seppelt

Proceedings of the 17th Innovations in Theoretical Computer Science Conference, 2026

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, May, 2025

NPA Hierarchy for Quantum Isomorphism and Homomorphism Indistinguishability.

Prem Nigam Kar, David E. Roberson, Tim Seppelt, Peter Zeman

Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

2024

The Complexity of Homomorphism Reconstructibility.

Jan Böker, Louis Härtel, Nina Runde, Tim Seppelt, Christoph Standke

Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

An Algorithmic Meta Theorem for Homomorphism Indistinguishability.

Tim Seppelt

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

Limitations of Game Comonads for Invertible-Map Equivalence via Homomorphism Indistinguishability.

Moritz Lichter, Benedikt Pago, Tim Seppelt

Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic, 2024

Going Deep and Going Wide: Counting Logic and Homomorphism Indistinguishability over Graphs of Bounded Treedepth and Treewidth.

Eva Fluck, Tim Seppelt, Gian Luca Spitzer

Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic, 2024

2023

Limitations of Game Comonads via Homomorphism Indistinguishability.

Moritz Lichter, Benedikt Pago, Tim Seppelt

CoRR, 2023

Weisfeiler-Leman and Graph Spectra.

Gaurav Rattan, Tim Seppelt

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Logical Equivalences, Homomorphism Indistinguishability, and Forbidden Minors.

Tim Seppelt

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability.

David E. Roberson, Tim Seppelt

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022

Homomorphism Tensors and Linear Equations.

Martin Grohe, Gaurav Rattan, Tim Seppelt

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021

Weisfeiler-Leman, Graph Spectra, and Random Walks.

Gaurav Rattan, Tim Seppelt

CoRR, 2021

2019

The Graph Isomorphism Problem: Local Certificates for Giant Action.

Tim Seppelt

CoRR, 2019