Couples can be Tractable: New Algorithms and Hardness Results for the Hospitals/Residents Problem with Couples.

Csáji G, Manlove D, McBride I, Trimble J

Open source

DOI
10.1007/s00453-026-01405-4
Published
2026
Container
Algorithmica
Publisher
Not recorded
Open access
yes

Credibility signals

limited evidence Score 45/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.1007/s00453-026-01405-4,
  title = {Couples can be Tractable: New Algorithms and Hardness Results for the Hospitals/Residents Problem with Couples.},
  author = {Csáji G and Manlove D and McBride I and Trimble J},
  year = {2026},
  journal = {Algorithmica},
  doi = {10.1007/s00453-026-01405-4},
  url = {https://doi.org/10.1007/s00453-026-01405-4}
}

RIS

TY  - JOUR
TI  - Couples can be Tractable: New Algorithms and Hardness Results for the Hospitals/Residents Problem with Couples.
AU  - Csáji G
AU  - Manlove D
AU  - McBride I
AU  - Trimble J
PY  - 2026
JO  - Algorithmica
DO  - 10.1007/s00453-026-01405-4
UR  - https://doi.org/10.1007/s00453-026-01405-4
ER  - 

APA

G, C., D, M., I, M., & J, T. (2026). Couples can be Tractable: New Algorithms and Hardness Results for the Hospitals/Residents Problem with Couples.. Algorithmica. https://doi.org/10.1007/s00453-026-01405-4

Source records