default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPascal Schweitzer
- > Home > Persons > Pascal Schweitzer
Publications
- 2023
[j31]Martin Grohe, Daniel Neuen
, Pascal Schweitzer:
A Faster Isomorphism Test for Graphs of Small Degree. SIAM J. Comput. 52(6): S18-1 (2023)- [c44]Martin Grohe, Moritz Lichter, Daniel Neuen, Pascal Schweitzer:
Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements. FOCS 2023: 798-809 - [i34]Martin Grohe, Moritz Lichter, Daniel Neuen, Pascal Schweitzer:
Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements. CoRR abs/2308.11970 (2023) - 2021
- [c33]Martin Grohe, Pascal Schweitzer, Daniel Wiebking:
Deep Weisfeiler Leman. SODA 2021: 2600-2614 - 2020
- [j26]Martin Grohe, Pascal Schweitzer:
The graph isomorphism problem. Commun. ACM 63(11): 128-134 (2020) - [j24]Martin Grohe, Daniel Neuen, Pascal Schweitzer, Daniel Wiebking:
An Improved Isomorphism Test for Bounded-tree-width Graphs. ACM Trans. Algorithms 16(3): 34:1-34:31 (2020) - [i27]Martin Grohe, Pascal Schweitzer, Daniel Wiebking:
Deep Weisfeiler Leman. CoRR abs/2003.10935 (2020) - [i22]Martin Grohe, Pascal Schweitzer, Daniel Wiebking:
Automorphism groups of graphs of bounded Hadwiger number. CoRR abs/2012.14300 (2020) - 2018
- [c28]Martin Grohe, Daniel Neuen, Pascal Schweitzer:
A Faster Isomorphism Test for Graphs of Small Degree. FOCS 2018: 89-100 - [c27]Martin Grohe, Daniel Neuen, Pascal Schweitzer, Daniel Wiebking:
An Improved Isomorphism Test for Bounded-Tree-Width Graphs. ICALP 2018: 67:1-67:14 - [i20]Martin Grohe, Daniel Neuen, Pascal Schweitzer:
Towards faster isomorphism tests for bounded-degree graphs. CoRR abs/1802.04659 (2018) - [i19]Martin Grohe, Daniel Neuen, Pascal Schweitzer, Daniel Wiebking:
An improved isomorphism test for bounded-tree-width graphs. CoRR abs/1803.06858 (2018) - 2016
- [j16]Martin Grohe, Pascal Schweitzer:
Computing with Tangles. SIAM J. Discret. Math. 30(2): 1213-1247 (2016) - 2015
- [c18]Martin Grohe, Pascal Schweitzer:
Isomorphism Testing for Graphs of Bounded Rank Width. FOCS 2015: 1010-1029 - [c15]Martin Grohe, Pascal Schweitzer:
Computing with Tangles. STOC 2015: 683-692 - [i9]Martin Grohe, Pascal Schweitzer:
Computing with Tangles. CoRR abs/1503.00190 (2015) - [i7]Martin Grohe, Pascal Schweitzer:
Isomorphism Testing for Graphs of Bounded Rank Width. CoRR abs/1505.03737 (2015)
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.
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.
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.
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 2025-06-17 00:37 CEST 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:
