Algorithms and Complexity of Strongly Stable Non-crossing Matchings

B. S. Panda 0001, Sachin. Algorithms and Complexity of Strongly Stable Non-crossing Matchings. In Amitabha Bagchi, Rahul Muthu, editors, Algorithms and Discrete Applied Mathematics - 9th International Conference, CALDAM 2023, Gandhinagar, India, February 9-11, 2023, Proceedings. Volume 13947 of Lecture Notes in Computer Science, pages 363-376, Springer, 2023. [doi]

Abstract

Abstract is missing.