From

Institution

Field

Type

Open access only Cited by patents (Lens) Include non-Aachen papers (citing/cited)

Reset

Papers matching “graph isomorphism” 41

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

Not finding it? Sign in to also search OpenAlex live.

The graph isomorphism problem
2020 Communications of the ACM article Computer Science Graph Theory and Algorithms

Martin Grohe, Pascal Schweitzer

114

citations
Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability
2024 TheoretiCS article Computer Science Complexity and Algorithms in Graphs Open access

David E. Roberson, Tim Seppelt

2

citations
Graph Isomorphism in Quasipolynomial Time Parameterized by Treewidth
2020 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Graph Theory Research Open access

Daniel Wiebking

8

citations
Weisfeiler and Leman’s Unlikely Journey from Graph Isomorphism to Neural Networks (Invited Talk)
2020 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Graph Theory and Algorithms Open access

Martin Grohe

0

citations
Supercritical Size-Width Tree-Like Resolution Trade-Offs for Graph Isomorphism
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Complexity and Algorithms in Graphs Open access

0

citations
Isomorphism Testing for Graphs Excluding Small Minors
2023 SIAM Journal on Computing article Computer Science Advanced Graph Theory Research Open access

Martin Grohe, Daniel Neuen, Daniel Wiebking

5

citations
Isomorphism Testing Parameterized by Genus and Beyond
2021 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Graph Theory Research Open access

Daniel Neuen

4

citations
Isomorphism, canonization, and definability for graphs of bounded rank width
2021 Communications of the ACM article Computer Science Advanced Graph Theory Research

Martin Grohe, Daniel Neuen

6

citations
An Improved Isomorphism Test for Bounded-tree-width Graphs
2020 ACM Transactions on Algorithms article Computer Science Advanced Graph Theory Research Open access

Martin Grohe, Daniel Neuen, Pascal Schweitzer, Daniel Wiebking

14

citations
Isomorphism for Tournaments of Small Twin Width
2026 TheoretiCS article Computer Science Advanced Graph Theory Research Open access

Martin Grohe, Daniel Neuen

0

citations
A Faster Isomorphism Test for Graphs of Small Degree
2020 SIAM Journal on Computing article Computer Science Complexity and Algorithms in Graphs Open access

Martin Grohe, Daniel Neuen, Pascal Schweitzer

11

citations
A B\"uchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage
2020 Discrete Mathematics & Theoretical Computer Science article Computer Science semigroups and automata theory Open access

Joost Engelfriet, Heiko Vogler

0

citations
An equivariant pullback structure of trimmable graph $C^*$-algebras
2022 Journal of Noncommutative Geometry article Mathematics Advanced Operator Algebra Research Open access

Francesca Arici, Francesco D’Andrea, Piotr M. Hajac, Mariusz Tobolski

7

citations
A Deep Dive into the Weisfeiler-Leman Algorithm (Invited Talk)
2021 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Graph Theory and Algorithms Open access

Martin Grohe

0

citations
Limitations of the invertible-map equivalences
2022 Journal of Logic and Computation article Computer Science Advanced Graph Theory Research Open access

Anuj Dawar, Erich Grädel, Moritz Lichter

4

citations
Weisfeiler-Leman Indistinguishability of Graphons
2023 The Electronic Journal of Combinatorics article Mathematics Limits and Structures in Graph Theory Open access

Jan Böker

1

citations
Weisfeiler-Leman Indistinguishability of Graphons
2021 RWTH Publications (RWTH Aachen) article Computer Science Advanced Graph Theory Research Open access

Jan Böker

0

citations
Logarithmic Weisfeiler-Leman Identifies All Planar Graphs
2021 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Graph Theory Research Open access

Martin Grohe, Sandra Kiefer

3

citations
Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements
2025 Journal of the ACM article Computer Science Complexity and Algorithms in Graphs Open access

Martin Grohe, Moritz Lichter, Daniel Neuen, Pascal Schweitzer

0

citations
The Power of the Weisfeiler--Leman Algorithm to Decompose Graphs
2022 SIAM Journal on Discrete Mathematics article Computer Science Advanced Graph Theory Research Open access

Sandra Kiefer, Daniel Neuen

11

citations
Canonisation and Definability for Graphs of Bounded Rank Width
2022 ACM Transactions on Computational Logic article Computer Science Advanced Graph Theory Research Open access

Martin Grohe, Daniel Neuen

7

citations
The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs
2022 ACM Transactions on Computation Theory article Computer Science Advanced Graph Theory Research

V. Arvind, Frank Fuhlbrück, Johannes Köbler, Sebastian Kuhnert, Gaurav Rattan

0

citations
Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements
2025 Journal of the ACM article Computer Science Complexity and Algorithms in Graphs Open access

Martin Grohe, Moritz Lichter, Daniel Neuen, Pascal Schweitzer

0

citations
Computational Complexity of the Weisfeiler-Leman Dimension
2026 ACM Transactions on Computational Logic article Computer Science Advanced Graph Theory Research Open access

Moritz Lichter, Simon Raßmann, Pascal Schweitzer

0

citations
Computational Complexity of the Weisfeiler-Leman Dimension
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Graph Theory Research Open access

Simon Raßmann, Pascal Schweitzer

1

citations