Sandra Kiefer

Sandra Kiefer

Auto-generated profile, based on publicly available information

Sandra Kiefer

University of Oxford, Oxford, United Kingdom

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 November 2019 in Journal of the ACM
Verified
Journal Article
Open access
PDF file
SKSandra Kiefer
Sandra Kiefer
IPIlia Ponomarenko
Ilia Ponomarenko
PSPascal Schweitzer
Pascal Schweitzer
We prove that the Weisfeiler--Leman (WL) dimension of the class of all finite planar graphs is at most 3. In particular, every finite planar graph is definable in first-order logic with counting using at most 4 variables. The previously best-known upper bounds for the dimension and number of variables were 14 and 15, respectively. First, we show that, for dimension 3 and higher, the WL-algorithm correctly tests isomorphism of graphs in a minor-closed class whenever it determines the orbits of the automorphism group of every arc-colored 3-connected graph belonging to this class. Then, we prove that, apart from several exceptional graphs (which have WL-dimension at most 2), the individualization of two appropriately chosen vertices of a colored 3-connected planar graph followed by the one-dimensional WL-algorithm produces the discrete vertex partition. This implies that the three-dimensional WL-algorithm determines the orbits of arc-colored 3-connected planar graphs. As a byproduct of the proof, we get a classification of the 3-connected planar graphs with fixing number 3.

24 January 2022 in SIAM Journal on Discrete Mathematics
Verified
Journal Article
Closed access
SKSandra Kiefer
Sandra Kiefer
DNDaniel Neuen
Daniel Neuen
The Weisfeiler--Leman procedure is a widely used technique for graph isomorphism testing that works by iteratively computing an isomorphism-invariant coloring of vertex tuples. Meanwhile, a fundame...


8 July 2024
Verified
Conference Paper
Open access
SKSandra Kiefer
Sandra Kiefer
DNDaniel Neuen
Daniel Neuen
The Weisfeiler-Leman (WL) dimension is an established measure for the inherent descriptive complexity of graphs and relational structures. It corresponds to the number of variables that are needed and sufficient to define the object of interest in a counting version of first-order logic (FO). These bounded-variable counting logics were even candidates to capture graph isomorphism, until a celebrated construction due to Cai, Fürer, and Immerman [Combinatorica 1992] showed that Ω(n) variables are required to distinguish all non-isomorphic n-vertex graphs. Still, very little is known about the precise number of variables required and sufficient to define every n-vertex graph. For the bounded-variable (non-counting) FO fragments, Pikhurko, Veith, and Verbitsky [Discret. Appl. Math. 2006] provided an upper bound of [EQUATION] and showed that it is essentially tight. Our main result yields that, in the presence of counting quantifiers, [EQUATION] variables suffice. This shows that counting does allow us to save variables when defining graphs. As an application of our techniques, we also show new bounds in terms of the vertex cover number of the graph. To obtain the results, we introduce a new concept called the WL depth of a graph. We use it to analyze branching trees within the Individualization/Refinement (I/R) paradigm from the domain of isomorphism algorithms. We extend the recursive procedure from the I/R paradigm by the possibility of splitting the graphs into independent parts. Then we bound the depth of the obtained branching trees, which translates into bounds on the WL dimension and thereby on the number of variables that suffice to define the graphs.

5 February 2024 in arXiv
Verified
Preprint
Open access
PDF file
SKSandra Kiefer
Sandra Kiefer
DNDaniel Neuen
Daniel Neuen
The Weisfeiler-Leman (WL) dimension is an established measure for the inherent descriptive complexity of graphs and relational structures. It corresponds to the number of variables that are needed and sufficient to define the object of interest in a counting version of first-order logic (FO). These bounded-variable counting logics were even candidates to capture graph isomorphism, until a celebrated construction due to Cai, Fürer, and Immerman [Combinatorica 1992] showed that $Ω(n)$ variables are required to distinguish all non-isomorphic $n$-vertex graphs. Still, very little is known about the precise number of variables required and sufficient to define every $n$-vertex graph. For the bounded-variable (non-counting) FO fragments, Pikhurko, Veith, and Verbitsky [Discret. Appl. Math. 2006] provided an upper bound of $\frac{n+3}{2}$ and showed that it is essentially tight. Our main result yields that, in the presence of counting quantifiers, $\frac{n}{4} + o(n)$ variables suffice. This shows that counting does allow us to save variables when defining graphs. As an application of our techniques, we also show new bounds in terms of the vertex cover number of the graph. To obtain the results, we introduce a new concept called the WL depth of a graph. We use it to analyze branching trees within the Individualization/Refinement (I/R) paradigm from the domain of isomorphism algorithms. We extend the recursive procedure from the I/R paradigm by the possibility of splitting the graphs into independent parts. Then we bound the depth of the obtained branching trees, which translates into bounds on the WL dimension and thereby on the number of variables that suffice to define the graphs.

9 October 2025 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
MSMarko Schmellenkamp
Marko Schmellenkamp
TZThomas Zeume
Thomas Zeume
SASven Argo
Sven Argo
SKSandra Kiefer
Sandra Kiefer
CSCedric Siems
Cedric Siems
FSFynn Stebel
Fynn Stebel
We propose a scalable framework for deciding, proving, and explaining (in-)equivalence of context-free grammars. We present an implementation of the framework and evaluate it on large data sets collected within educational support systems. Even though the equivalence problem for context-free languages is undecidable in general, the framework is able to handle a large portion of these datasets. It introduces and combines techniques from several areas, such as an abstract grammar transformation language to identify equivalent grammars as well as sufficiently similar inequivalent grammars, theory-based comparison algorithms for a large class of context-free languages, and a graph-theory-inspired grammar canonization that allows to efficiently identify isomorphic grammars.