The Complexity of Finding Tangles

Oksana Firman, Philipp Kindermann, Boris Klemz, Alexander Ravsky, Alexander Wolff 0001, Johannes Zink. The Complexity of Finding Tangles. In Leszek Gasieniec, editor, SOFSEM 2023: Theory and Practice of Computer Science - 48th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2023, NovĂ˝ Smokovec, Slovakia, January 15-18, 2023, Proceedings. Volume 13878 of Lecture Notes in Computer Science, pages 3-17, Springer, 2023. [doi]

Abstract

Abstract is missing.