@dblp

Algorithms and Complexity of Strongly Stable Non-crossing Matchings.

, and . CALDAM, volume 13947 of Lecture Notes in Computer Science, page 363-376. Springer, (2023)

Links and resources

Tags