TU IlmenauThe papers "Modal logic is more succinct iff bi-implication is available in some form" by Christoph Berkholz, Dietrich Kuske and Christian Schwarz as well as "A characterization of efficiently compilable constraint languages" by Christoph Berkholz, Stefan Mengel and Hermann Wilhelm (preprint available at https://arxiv.org/abs/2311.10040) have been accepted for publication at the 41st International Symposium on Theoretical Aspects of Computer Science (STACS) https://stacs2024.limos.fr/.