May 01, 2000 conference-paper Isomorphism testing for embeddable graphs through definability ACM Symposium on Theory of Computing (STOC) DOI: 10.1145/335305.335313 OpenAlex Authors 0 Author list not loaded yet. Cited by 5 stored of 57 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 Simulating Logspace-Recursion with Logarithmic Quantifier Depth 2023 Proceedings - Symposium on Logic in Computer Science conference-paper Computer Science Advanced Graph Theory Research 1 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 7 citations The Logic of Graph Neural Networks 2021 Proceedings - Symposium on Logic in Computer Science conference-paper Computer Science Advanced Graph Neural Networks Open access 50 citations Logarithmic Weisfeiler-Leman Identifies All Planar Graphs 2021 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access 2 citations The Weisfeiler-Leman algorithm 2020 ACM SIGLOG News article Computer Science Advanced Graph Theory Research 24 citations 5 results References 0