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]

Authors

Oksana Firman

This author has not been identified. Look up 'Oksana Firman' in Google

Philipp Kindermann

This author has not been identified. Look up 'Philipp Kindermann' in Google

Boris Klemz

This author has not been identified. Look up 'Boris Klemz' in Google

Alexander Ravsky

This author has not been identified. Look up 'Alexander Ravsky' in Google

Alexander Wolff 0001

This author has not been identified. Look up 'Alexander Wolff 0001' in Google

Johannes Zink

This author has not been identified. Look up 'Johannes Zink' in Google