"Algorithms and Complexity of Strongly Stable Non-crossing Matchings."

B. S. Panda, Sachin (2023)

> Home

Details and statistics

DOI: 10.1007/978-3-031-25211-2_28

access: closed

type: Conference or Workshop Paper

metadata version: 2023-02-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/caldam/PandaS23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/caldam/PandaS23
B. S. Panda, Sachin:
Algorithms and Complexity of Strongly Stable Non-crossing Matchings. CALDAM 2023: 363-376

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.