From

Institution

Field

Type

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

Reset

Papers matching “Weisfeiler-Leman algorithm” 40

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

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
The Weisfeiler-Leman algorithm
2020 ACM SIGLOG News article Computer Science Advanced Graph Theory Research

Sandra Kiefer

24

citations
The Iteration Number of the Weisfeiler-Leman Algorithm
2023 Proceedings - Symposium on Logic in Computer Science conference-paper Computer Science Advanced Graph Theory Research

Martin Grohe, Moritz Lichter, Daniel Neuen

6

citations
The Iteration Number of the Weisfeiler-Leman Algorithm
2024 ACM Transactions on Computational Logic article Computer Science Advanced Graph Theory Research Open access

Martin Grohe, Moritz Lichter, Daniel Neuen

3

citations
The Iteration Number of the Weisfeiler-Leman Algorithm
2023 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Martin Grohe, Moritz Lichter, Daniel Neuen

2

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
Computational Complexity of the Weisfeiler-Leman Dimension
2024 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Moritz Lichter, Simon Raßmann, Pascal Schweitzer

0

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

Moritz Lichter, Simon Raßmann, Pascal Schweitzer

0

citations
Weisfeiler-Leman on Graphs of Small Twin-Width
2026 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Graph Theory Research Open access

Irene Heinrich, Moritz Lichter, Klara Pakhomenko, Simon Raßmann

0

citations
Weisfeiler-Leman on Graphs of Small Twin-Width
2026 RWTH Publications (RWTH Aachen) conference-paper Computer Science Advanced Graph Theory Research Open access

Irene Heinrich, Moritz Lichter, Klara Pakhomenko, Simon Raßmann

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
Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements
2023 Annual Symposium on Foundations of Computer Science conference-paper Computer Science Complexity and Algorithms in Graphs

Martin Grohe, Moritz Lichter, Daniel Neuen, Pascal Schweitzer

4

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
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
Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements
2023 RWTH Publications (RWTH Aachen) conference-paper Computer Science Complexity and Algorithms in Graphs Open access

Martin Grohe, Moritz Lichter, Daniel Neuen, Pascal Schweitzer

0

citations
Weisfeiler-Leman at the margin: When more expressivity matters
2024 arXiv (Cornell University) preprint Computer Science Advanced Graph Neural Networks Open access

Ameya Velingker, Floris Geerts

0

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
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
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
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
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
Weisfeiler and Leman go Machine Learning: The Story so far
2021 arXiv (Cornell University) preprint Computer Science Advanced Graph Neural Networks Open access

Yaron Lipman, Haggai Maron, Bastian Rieck, Nils M. Kriege, Martin Grohe, Matthias Fey, +1 more

27

citations
Repetition Makes Perfect: Recurrent Graph Neural Networks Match Message Passing Limit
2026 Proceedings of the AAAI Conference on Artificial Intelligence conference-paper Computer Science Advanced Graph Neural Networks Open access

Eran Rosenbluth, Martin Grohe

0

citations
Homomorphism Tensors and Linear Equations
2025 Advances in Combinatorics article Computer Science Advanced Graph Theory Research Open access

Martin Grohe, Gaurav Rattan, Tim Seppelt

5

citations