Sandra Kiefer

According to our database, Sandra Kiefer authored at least 24 papers between 2015 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

A Classification of Long-Refinement Graphs for Colour Refinement.

Sandra Kiefer, T. Devini de Mel

Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

The Logic Behind Colour Refinement (Invited Talk).

Sandra Kiefer

Proceedings of the 34th EACSL Annual Conference on Computer Science Logic, 2026

2025

Detecting and Explaining (In-)equivalence of Context-Free Grammars.

Marko Schmellenkamp, Thomas Zeume, Sven Argo, Sandra Kiefer, Cedric Siems, Fynn Stebel

Proc. ACM Program. Lang., 2025

A Machine Learning Approach to Cognitive Load Estimation in Augmented Reality Using Eye Tracking.

Sandra Kiefer, Martin Weier, Biying Fu

Proceedings of the Sensor-Based Activity Recognition and Artificial Intelligence, 2025

2024

Untangling Gaussian Mixtures.

Eva Fluck, Sandra Kiefer, Christoph Standke

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2024

Bounding the Weisfeiler-Leman Dimension via a Depth Analysis of I/R-Trees.

Sandra Kiefer, Daniel Neuen

Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

Verification of Population Protocols with Unordered Data.

Steffen van Bergerem, Roland Guttenberg, Sandra Kiefer, Corto Mascle, Nicolas Waldburger, Chana Weil-Kennedy

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Polyregular Functions: Characterisations and Refutations.

Sandra Kiefer

Proceedings of the Developments in Language Theory - 28th International Conference, 2024

2023

Revisiting the growth of polyregular functions: output languages, weighted automata and unary inputs.

Sandra Kiefer, Lê Thành Dung Nguyên, Cécilia Pradic

CoRR, 2023

Simulating Logspace-Recursion with Logarithmic Quantifier Depth.

Steffen van Bergerem, Martin Grohe, Sandra Kiefer, Luca Oeljeklaus

Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023

2022

Report on women in logic 2020 & 2021.

Sandra Alves, Sandra Kiefer, Ana Sokolova

ACM SIGLOG News, 2022

Treelike Decompositions for Transductions of Sparse Graphs.

Jan Dreier, Jakub Gajarský, Sandra Kiefer, Michal Pilipczuk, Szymon Torunczyk

Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

SpeqNets: Sparsity-aware permutation-equivariant graph networks.

Christopher Morris, Gaurav Rattan, Sandra Kiefer, Siamak Ravanbakhsh

Proceedings of the International Conference on Machine Learning, 2022

A Study of Weisfeiler-Leman Colorings on Planar Graphs.

Sandra Kiefer, Daniel Neuen

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021

Logarithmic Weisfeiler-Leman Identifies All Planar Graphs.

Martin Grohe, Sandra Kiefer

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

Power and Limits of the Weisfeiler-Leman Algorithm

Sandra Kiefer

PhD thesis, 2020

The Weisfeiler-Leman algorithm: an exploration of its power.

Sandra Kiefer

ACM SIGLOG News, 2020

The Iteration Number of Colour Refinement.

Sandra Kiefer, Brendan D. McKay

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019

The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs.

Sandra Kiefer, Daniel Neuen

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

A Linear Upper Bound on the Weisfeiler-Leman Dimension of Graphs of Bounded Genus.

Martin Grohe, Sandra Kiefer

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

String-to-String Interpretations With Polynomial-Size Output.

Mikolaj Bojanczyk, Sandra Kiefer, Nathan Lhote

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2017

The Weisfeiler-Leman dimension of planar graphs is at most 3.

Sandra Kiefer, Ilia Ponomarenko, Pascal Schweitzer

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2016

Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic.

Sandra Kiefer, Pascal Schweitzer

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

2015

Graphs Identified by Logics with Counting.

Sandra Kiefer, Pascal Schweitzer, Erkal Selman

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015