Algorithms and complexity of strongly stable non-crossing matchings

Sachin, B. S. Panda. Algorithms and complexity of strongly stable non-crossing matchings. Discrete Applied Mathematics, 379:802-813, 2026. [doi]

Abstract

Abstract is missing.