Geometric Thickness of Multigraphs is $\exists \mathbb {R}$-Complete

Henry Förster, Philipp Kindermann, Tillmann Miltzow, Irene Parada, Soeren Terziadis, Birgit Vogtenhuber. Geometric Thickness of Multigraphs is $\exists \mathbb {R}$-Complete. In José A. Soto, Andreas Wiese, editors, LATIN 2024: Theoretical Informatics - 16th Latin American Symposium, Puerto Varas, Chile, March 18-22, 2024, Proceedings, Part I. Volume 14578 of Lecture Notes in Computer Science, pages 336-349, Springer, 2024. [doi]

Abstract

Abstract is missing.