| The Weisfeiler--Leman Dimension of Planar Graphs Is at Most 3 S Kiefer, I Ponomarenko, P Schweitzer Journal of the ACM (JACM) 66 (6), 1-31, 2019 | 66 | 2019 |
| Graphs identified by logics with counting S Kiefer, P Schweitzer, E Selman International Symposium on Mathematical Foundations of Computer Science, 319-330, 2015 | 50 | 2015 |
| Power and Limits of the Weisfeiler-Leman Algorithm S Kiefer RWTH Aachen University, 2020 | 38 | 2020 |
| Speqnets: Sparsity-aware permutation-equivariant graph networks C Morris, G Rattan, S Kiefer, S Ravanbakhsh International Conference on Machine Learning, 16017-16042, 2022 | 35 | 2022 |
| String-to-string interpretations with polynomial-size output M Bojańczyk, S Kiefer, N Lhote arXiv preprint arXiv:1905.13190, 2019 | 34 | 2019 |
| The Weisfeiler-Leman algorithm: an exploration of its power S Kiefer ACM SIGLOG News 7 (3), 5-27, 2020 | 28 | 2020 |
| Upper bounds on the quantifier depth for graph differentiation in first order logic S Kiefer, P Schweitzer Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer …, 2016 | 28 | 2016 |
| The iteration number of colour refinement S Kiefer, BD McKay arXiv preprint arXiv:2005.10182, 2020 | 27 | 2020 |
| The Power of the Weisfeiler--Leman Algorithm to Decompose Graphs S Kiefer, D Neuen SIAM Journal on Discrete Mathematics 36 (1), 252-298, 2022 | 24 | 2022 |
| A linear upper bound on the Weisfeiler-Leman dimension of graphs of bounded genus M Grohe, S Kiefer arXiv preprint arXiv:1904.07216, 2019 | 22 | 2019 |
| Logarithmic weisfeiler-leman identifies all planar graphs M Grohe, S Kiefer arXiv preprint arXiv:2106.16218, 2021 | 11 | 2021 |
| Treelike decompositions for transductions of sparse graphs J Dreier, J Gajarský, S Kiefer, M Pilipczuk, S Toruńczyk Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer …, 2022 | 8 | 2022 |
| A training strategy for hybrid models to break the curse of dimensionality M E. Samadi, S Kiefer, SJ Fritsch, J Bickenbach, A Schuppert Plos one 17 (9), e0274569, 2022 | 6 | 2022 |
| Graphs identified by logics with counting S Kiefer, P Schweitzer, E Selman ACM Transactions on Computational Logic (TOCL) 23 (1), 1-31, 2021 | 3 | 2021 |
| A study of Weisfeiler-Leman colorings on planar graphs S Kiefer, D Neuen arXiv preprint arXiv:2206.10557, 2022 | 2 | 2022 |
| Bounding the Weisfeiler-Leman Dimension via a Depth Analysis of I/R-Trees S Kiefer, D Neuen arXiv preprint arXiv:2402.03274, 2024 | 1 | 2024 |
| Revisiting the growth of polyregular functions: output languages, weighted automata and unary inputs S Kiefer, LTD Nguyên, C Pradic arXiv preprint arXiv:2301.09234, 2023 | 1 | 2023 |
| Untangling Gaussian Mixtures E Fluck, S Kiefer, C Standke arXiv preprint arXiv:2403.06671, 2024 | | 2024 |
| Simulating Logspace-Recursion with Logarithmic Quantifier Depth S van Bergerem, M Grohe, S Kiefer, L Oeljeklaus 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-13, 2023 | | 2023 |
| Refutations of pebble minimization via output languages S Kiefer, LTD Nguyên, C Pradic arXiv preprint arXiv:2301.09234, 2023 | | 2023 |
