External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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]

Authors

B. S. Panda 0001

This author has not been identified. Look up 'B. S. Panda 0001' in Google

Sachin

This author has not been identified. Look up 'Sachin' in Google
runs on