Algorithms and complexity of strongly stable non-crossing matchings

DOI10.1007/978-3-031-25211-2_28OpenAlexW4318022954MaRDI QIDQ6132552

Sachin, B. S. Panda

Publication date: 17 August 2023

Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-25211-2_28

zbMATH Keywords

polynomial time algorithmNP-completefixed-parameter tractable (FPT)stable non-crossing matching

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Some remarks on the stable matching problem
• Stable marriage and indifference
• Hard variants of stable marriage.
• Parameterized algorithms for stable matching with ties and incomplete lists
• Parameterized complexity and local search approaches for the stable marriage problem with ties
• Strongly stable and maximum weakly stable noncrossing matchings
• Stable noncrossing matchings
• Strongly Stable and Maximum Weakly Stable Noncrossing Matchings
• Algorithmics of Matching Under Preferences
• Parameterized Algorithms
• The complexity of theorem-proving procedures
• College Admissions and the Stability of Marriage

This page was built for publication: Algorithms and complexity of strongly stable non-crossing matchings