From

Institution

Field

Type

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

Reset

Papers matching “Weisfeiler-Leman algorithm” 7

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

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
Lower Bounds for Weisfeiler-Leman
2026 Zenodo (CERN European Organization for Nuclear Research) preprint Computer Science Complexity and Algorithms in Graphs Open access

Radu Curticapean, Mingjun Liu, Daniel Neuen, Tim Seppelt

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
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
Isomorphism for Tournaments of Small Twin Width
2026 TheoretiCS article Computer Science Advanced Graph Theory Research Open access

Martin Grohe, Daniel Neuen

0

citations

7 results