Oblivious Stacking and MAX k-CUT for Circle Graphs

Martin Olsen. Oblivious Stacking and MAX k-CUT for Circle Graphs. In Jesica de Armas, Helena Ramalhinho, Stefan Voß, editors, Computational Logistics - 13th International Conference, ICCL 2022, Barcelona, Spain, September 21-23, 2022, Proceedings. Volume 13557 of Lecture Notes in Computer Science, pages 322-335, Springer, 2022. [doi]

Abstract

Abstract is missing.