Förster, H., Kindermann, P., Miltzow, T., Parada, I., Terziadis, S., & Vogtenhuber, B. (2023). Geometric Thickness of Multigraphs is $\exists \mathbb{R}$-complete.
Chicago Style (17th ed.) CitationFörster, Henry, Philipp Kindermann, Tillmann Miltzow, Irene Parada, Soeren Terziadis, and Birgit Vogtenhuber. Geometric Thickness of Multigraphs Is $\exists \mathbb{R}$-complete. 2023.
MLA (9th ed.) CitationFörster, Henry, et al. Geometric Thickness of Multigraphs Is $\exists \mathbb{R}$-complete. 2023.
Warning: These citations may not always be 100% accurate.