Sandra Kiefer

Available identifiers

Publication	Date of Publication	Type
Treelike decompositions for transductions of sparse graphs	2024-12-06	Paper
A study of Weisfeiler-Leman colorings on planar graphs	2024-06-24	Paper
Simulating Logspace-Recursion with Logarithmic Quantifier Depth	2023-04-25	Paper
Graphs Identified by Logics with Counting	2022-12-08	Paper
https://portal.mardi4nfdi.de/entity/Q5091279	2022-07-21	Paper
The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs	2022-07-21	Paper
String-to-string interpretations with polynomial-size output	2022-07-21	Paper
A Study of Weisfeiler-Leman Colorings on Planar Graphs	2022-06-21	Paper
The power of the Weisfeiler-Leman algorithm to decompose graphs	2022-02-09	Paper
Treelike decompositions for transductions of sparse graphs	2022-01-26	Paper
Logarithmic Weisfeiler-Leman Identifies All Planar Graphs	2021-06-30	Paper
The Weisfeiler-Leman dimension of planar graphs is at most 3	2021-01-19	Paper
The Iteration Number of Colour Refinement	2020-05-20	Paper
The Weisfeiler--Leman Dimension of Planar Graphs Is at Most 3	2020-02-11	Paper
Upper bounds on the quantifier depth for graph differentiation in first-order logic	2019-07-12	Paper
A Linear Upper Bound on the Weisfeiler-Leman Dimension of Graphs of Bounded Genus	2019-04-15	Paper
Upper bounds on the quantifier depth for graph differentiation in first order logic	2018-04-23	Paper
Graphs identified by logics with counting	2015-09-16	Paper
Bounding the Weisfeiler-Leman Dimension via a Depth Analysis of I/R-Trees	N/A	Paper
Untangling Gaussian Mixtures	N/A	Paper

This page was built for person: Sandra Kiefer