January 01, 2019 article Open access Upper Bounds on the Quantifier Depth for Graph Differentiation in First-Order Logic DOAJ (DOAJ: Directory of Open Access Journals) DOI: 10.23638/lmcs-15(2:19)2019 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 5 stored of 6 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 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 0 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 0 citations The Iteration Number of the Weisfeiler-Leman Algorithm 2024 ACM Transactions on Computational Logic article Computer Science Advanced Graph Theory Research Open access 3 citations 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 The Iteration Number of Colour Refinement 2020 arXiv (Cornell University) preprint Computer Science Graph Theory and Algorithms Open access 1 citations 5 results References 0