Tim Seppelt

According to our database, Tim Seppelt authored at least 11 papers between 2019 and 2024.

Collaborative distances:

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

2024

An Algorithmic Meta Theorem for Homomorphism Indistinguishability.

Tim Seppelt

CoRR, 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

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