Tim Seppelt

Orcid: 0000-0002-6447-0568

According to our database1, Tim Seppelt authored at least 12 papers between 2019 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability.
TheoretiCS, 2024

Logical equivalences, homomorphism indistinguishability, and forbidden minors.
Inf. Comput., 2024

NPA Hierarchy for Quantum Isomorphism and Homomorphism Indistinguishability.
CoRR, 2024

The Complexity of Homomorphism Reconstructibility.
Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

An Algorithmic Meta Theorem for Homomorphism Indistinguishability.
Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

Limitations of Game Comonads for Invertible-Map Equivalence via Homomorphism Indistinguishability.
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.
Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic, 2024

2023
Limitations of Game Comonads via Homomorphism Indistinguishability.
CoRR, 2023

Weisfeiler-Leman and Graph Spectra.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022
Homomorphism Tensors and Linear Equations.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021
Weisfeiler-Leman, Graph Spectra, and Random Walks.
CoRR, 2021

2019
The Graph Isomorphism Problem: Local Certificates for Giant Action.
CoRR, 2019


  Loading...