From

Institution

Field

Type

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

Reset

Papers matching “graph isomorphism testing” 27

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

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
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 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
A decomposition-compatible canonization framework for the graph isomorphism problem
2021 RWTH Publications (RWTH Aachen) dissertation Computer Science Graph Theory and Algorithms Open access

Daniel Wiebking

0

citations
Isomorphism Testing for Graphs Excluding Small Minors
2020 Annual Symposium on Foundations of Computer Science conference-paper Computer Science Advanced Graph Theory Research

Martin Grohe, Daniel Wiebking, Daniel Neuen

8

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
Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability
2023 RWTH Publications (RWTH Aachen) conference-paper Computer Science Complexity and Algorithms in Graphs Open access

David E. Roberson, Tim Seppelt

1

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
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
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
Fine-grained Expressivity of Graph Neural Networks
2023 arXiv (Cornell University) preprint Computer Science Advanced Graph Neural Networks Open access

Jan Böker, Ron Levie, Ningyuan Teresa Huang, Soledad Villar

4

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
Covered Forest: Fine-grained generalization analysis of graph neural networks
2024 arXiv (Cornell University) preprint Computer Science Advanced Graph Neural Networks Open access

Ben Finkelshtein, Floris Geerts, Ron Levie

0

citations
Stärken und Grenzen des Weisfeiler-Leman-Algorithmus
2020 RWTH Publications (RWTH Aachen) dissertation Computer Science Advanced Graph Theory Research Open access

Sandra Kiefer

7

citations
A Practical, Progressively-Expressive GNN
2022 arXiv (Cornell University) preprint Computer Science Advanced Graph Neural Networks Open access

Lingxiao Zhao, Louis Härtel, Neil Shah, Leman Akoglu

3

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
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
Deep Weisfeiler Leman
2021 Society for Industrial and Applied Mathematics eBooks conference-paper Computer Science Advanced Graph Theory Research Open access

Martin Grohe, Pascal Schweitzer, Daniel Wiebking

6

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
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
Logarithmic Weisfeiler-Leman Identifies All Planar Graphs
2021 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Martin Grohe, Sandra Kiefer

2

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
Regularity aspects for combinatorial simplicial surfaces
2020 RWTH Publications (RWTH Aachen) dissertation Mathematics Geometric and Algebraic Topology Open access

Markus Baumeister

4

citations