EUVIMEDEUVIMED entdecken
Crossref

The strongly stable matching problem with closures

Naoyuki Kamiyama

Theoretical Computer Science · 2026-06 · 1076 · 115980

DOI: 10.1016/j.tcs.2026.115980 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Theoretical Computer Science, 2026-06. Verfasst von Naoyuki Kamiyama. Die Arbeit nennt 28 Literaturangaben. Gefördert von: Exploratory Research for Advanced Technology, Japan Science and Technology Agency, Japan Society for the Promotion of Science.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • Exploratory Research for Advanced Technology
  • Japan Science and Technology Agency
  • Japan Society for the Promotion of Science

Zitieren

APA

Kamiyama, N. (2026). The strongly stable matching problem with closures. Theoretical Computer Science, 1076, 115980. https://doi.org/10.1016/j.tcs.2026.115980

Vancouver

Kamiyama N. The strongly stable matching problem with closures. Theoretical Computer Science. 2026;1076:115980. doi:10.1016/j.tcs.2026.115980

BibTeX
@article{Kamiyama2026,
  author = {Kamiyama, Naoyuki},
  title = {The strongly stable matching problem with closures},
  journal = {Theoretical Computer Science},
  year = {2026},
  volume = {1076},
  pages = {115980},
  doi = {10.1016/j.tcs.2026.115980}
}
Kostenlos starten →