Person
Dr.Sandra Kiefer
Address
Research Interests
Algorithmic Graph Theory, Bioinformatics, Discrete Mathematics (in particular, Combinatorial Optimization, Geometric Group Theory), Logic in Computer Science, Topology
Recent Presentations
Ein Logikspiel auf bunten Graphen (German) — World Logic Day 2021 at University of Hamburg (virtual).
Publications
Title | Authors | Published in |
---|---|---|
Treelike Decompositions for Transductions of Sparse Graphs | Jan Dreier, Jakub Gajarský, Sandra Kiefer, Michał Pilipczuk, Szymon Toruńczyk | arXiv 2022 |
The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs | Sandra Kiefer, Daniel Neuen |
SIAM Journal on Discrete Mathematics Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, Aachen, Germany, August 26-30, 2019 |
Graphs Identified by Logics with Counting
|
Sandra Kiefer, Pascal Schweitzer, Erkal Selman |
ACM Transactions on Computational Logic Proceedings of the 40th International Symposium on Mathematical Foundations of Computer Science, MFCS 2015, Milan, Italy, August 24-28, 2015 |
Logarithmic Weisfeiler-Leman Identifies All Planar Graphs | Martin Grohe, Sandra Kiefer |
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, virtual, July 12-16, 2021 |
Sandra Kiefer |
ACM SIGLOG News |
|
Power and Limits of the Weisfeiler-Leman Algorithm | Sandra Kiefer |
RWTH Aachen University Publications |
The Iteration Number of Colour Refinement | Sandra Kiefer, Brendan D. McKay | Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, virtual, July 8-11, 2020 |
String-to-String Interpretations with Polynomial-Size Output | Mikołaj Bojańczyk, Sandra Kiefer, Nathan Lhote | Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, Patras, Greece, July 8-12, 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, ICALP 2019, Patras, Greece, July 8-12, 2019 |
The Weisfeiler-Leman Dimension of Planar Graphs is at most 3 | Sandra Kiefer, Ilia Ponomarenko, Pascal Schweitzer |
Journal of the ACM Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavík, Iceland, June 20-23, 2017 |
Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic |
Sandra Kiefer, Pascal Schweitzer |
Logical Methods in Computer Science Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2016, New York, NY, USA, July 5-8, 2016 |