default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTim Seppelt
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j2]Tim Seppelt
:
Logical equivalences, homomorphism indistinguishability, and forbidden minors. Inf. Comput. 301: 105224 (2024)- [j1]David E. Roberson, Tim Seppelt:
Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability. TheoretiCS 3 (2024)
Conference and Workshop Papers
- 2024
- [c8]Eva Fluck, Tim Seppelt, Gian Luca Spitzer:
Going Deep and Going Wide: Counting Logic and Homomorphism Indistinguishability over Graphs of Bounded Treedepth and Treewidth. CSL 2024: 27:1-27:17 - [c7]Moritz Lichter, Benedikt Pago, Tim Seppelt:
Limitations of Game Comonads for Invertible-Map Equivalence via Homomorphism Indistinguishability. CSL 2024: 36:1-36:19 - [c6]Tim Seppelt:
An Algorithmic Meta Theorem for Homomorphism Indistinguishability. MFCS 2024: 82:1-82:19 - [c5]Jan Böker, Louis Härtel, Nina Runde, Tim Seppelt, Christoph Standke:
The Complexity of Homomorphism Reconstructibility. STACS 2024: 19:1-19:20 - 2023
- [c4]David E. Roberson, Tim Seppelt:
Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability. ICALP 2023: 101:1-101:18 - [c3]Tim Seppelt:
Logical Equivalences, Homomorphism Indistinguishability, and Forbidden Minors. MFCS 2023: 82:1-82:15 - [c2]Gaurav Rattan, Tim Seppelt:
Weisfeiler-Leman and Graph Spectra. SODA 2023: 2268-2285 - 2022
- [c1]Martin Grohe, Gaurav Rattan, Tim Seppelt:
Homomorphism Tensors and Linear Equations. ICALP 2022: 70:1-70:20
Informal and Other Publications
- 2024
- [i10]Tim Seppelt:
An Algorithmic Meta Theorem for Homomorphism Indistinguishability. CoRR abs/2402.08989 (2024) - [i9]Prem Nigam Kar, David E. Roberson, Tim Seppelt, Peter Zeman:
NPA Hierarchy for Quantum Isomorphism and Homomorphism Indistinguishability. CoRR abs/2407.10635 (2024) - 2023
- [i8]David E. Roberson, Tim Seppelt:
Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability. CoRR abs/2302.10538 (2023) - [i7]Tim Seppelt:
Logical Equivalences, Homomorphism Indistinguishability, and Forbidden Minors. CoRR abs/2302.11290 (2023) - [i6]Moritz Lichter, Benedikt Pago, Tim Seppelt:
Limitations of Game Comonads via Homomorphism Indistinguishability. CoRR abs/2308.05693 (2023) - [i5]Eva Fluck, Tim Seppelt, Gian Luca Spitzer:
Going Deep and Going Wide: Counting Logic and Homomorphism Indistinguishability over Graphs of Bounded Treedepth and Treewidth. CoRR abs/2308.06044 (2023) - [i4]Jan Böker, Louis Härtel, Nina Runde, Tim Seppelt, Christoph Standke:
The Complexity of Homomorphism Reconstructibility. CoRR abs/2310.09009 (2023) - 2021
- [i3]Gaurav Rattan, Tim Seppelt:
Weisfeiler-Leman, Graph Spectra, and Random Walks. CoRR abs/2103.02972 (2021) - [i2]Martin Grohe, Gaurav Rattan, Tim Seppelt:
Homomorphism Tensors and Linear Equations. CoRR abs/2111.11313 (2021) - 2019
- [i1]Tim Seppelt:
The Graph Isomorphism Problem: Local Certificates for Giant Action. CoRR abs/1909.10260 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:45 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
