June 20, 2018 conference-paper Open access An exponential lower bound for individualization-refinement algorithms for graph isomorphism ACM SIGACT Symposium on Theory of Computing (STOC) DOI: 10.1145/3188745.3188900 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 3 stored of 12 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access Computational Complexity of the Weisfeiler-Leman Dimension 2026 ACM Transactions on Computational Logic article Computer Science Advanced Graph Theory Research 0 citations Weisfeiler-Leman and Graph Spectra 2023 Society for Industrial and Applied Mathematics eBooks conference-paper Mathematics Graph theory and applications Open access 4 citations The graph isomorphism problem 2020 Communications of the ACM article Computer Science Graph Theory and Algorithms 114 citations 3 results References 0