Algorithms and complexity of strongly stable non-crossing matchings

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

Authors: B. S. Panda, Sachin 

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

NP-completepolynomial time algorithmfixed-parameter tractable (FPT)stable non-crossing matching

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

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

Cited In (5)

• The Complexity of Approximately Counting Stable Matchings
• \(\mathcal{IV}\)-matching is strongly \textsf{NP}-hard
• An algorithm to compute the full set of many-to-many stable matchings.
• Disjoint stable matchings in linear time
• Advice complexity of online non-crossing matching

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6132552)