From

Institution

Field

Type

Topic: Complexity and Algorithms in Graphs ×

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

Reset

Papers matching “Weisfeiler-Leman algorithm” in Complexity and Algorithms in Graphs 6

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

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
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
Supercritical Size-Width Tree-Like Resolution Trade-Offs for Graph Isomorphism
2024 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Christoph Berkholz, Moritz Lichter, Harry Vinall-Smeeth

3

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

6 results