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]

@inproceedings{PandaS23,
  title = {Algorithms and Complexity of Strongly Stable Non-crossing Matchings},
  author = {B. S. Panda 0001 and Sachin},
  year = {2023},
  doi = {10.1007/978-3-031-25211-2_28},
  url = {https://doi.org/10.1007/978-3-031-25211-2_28},
  researchr = {https://researchr.org/publication/PandaS23},
  cites = {0},
  citedby = {0},
  pages = {363-376},
  booktitle = {Algorithms and Discrete Applied Mathematics - 9th International Conference, CALDAM 2023, Gandhinagar, India, February 9-11, 2023, Proceedings},
  editor = {Amitabha Bagchi and Rahul Muthu},
  volume = {13947},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-031-25211-2},
}