{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T04:09:53Z","timestamp":1778818193716,"version":"3.51.4"},"reference-count":28,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2028,4,26]],"date-time":"2028-04-26T00:00:00Z","timestamp":1840320000000},"content-version":"am","delay-in-days":695,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002241","name":"Japan Science and Technology Agency","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002241","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.tcs.2026.115980","type":"journal-article","created":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T14:54:56Z","timestamp":1776783296000},"page":"115980","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["The strongly stable matching problem with closures"],"prefix":"10.1016","volume":"1076","author":[{"given":"Naoyuki","family":"Kamiyama","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.tcs.2026.115980_bib0001","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","article-title":"College admissions and the stability of marriage","volume":"69","author":"Gale","year":"1962","journal-title":"Am. Math. Monthly"},{"key":"10.1016\/j.tcs.2026.115980_bib0002","series-title":"Encyclopedia of Algorithms","article-title":"Stable marriage with ties and incomplete lists","author":"Iwama","year":"2008"},{"key":"10.1016\/j.tcs.2026.115980_bib0003","series-title":"Algorithmics of Matching under Preferences","author":"Manlove","year":"2013"},{"issue":"3","key":"10.1016\/j.tcs.2026.115980_bib0004","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0166-218X(92)00179-P","article-title":"Stable marriage and indifference","volume":"48","author":"Irving","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.tcs.2026.115980_bib0005","series-title":"Technical Report","article-title":"Stable Marriage with Ties and Unacceptable Partners","author":"Manlove","year":"1999"},{"key":"10.1016\/j.tcs.2026.115980_bib0006","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/j.mathsocsci.2019.07.005","article-title":"Envy-freeness in house allocation problems","volume":"101","author":"Gan","year":"2019","journal-title":"Math. Soc. Sci."},{"key":"10.1016\/j.tcs.2026.115980_bib0007","series-title":"Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"107","article-title":"Characterisation of strongly stable matchings","author":"Kunysz","year":"2016"},{"key":"10.1016\/j.tcs.2026.115980_bib0008","series-title":"Proceedings of the 29th International Symposium on Algorithms and Computation","first-page":"42:1","article-title":"An algorithm for the maximum weight strongly stable matching problem","volume":"123","author":"Kunysz","year":"2018"},{"key":"10.1016\/j.tcs.2026.115980_bib0009","series-title":"Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science","first-page":"439","article-title":"Strong stability in the hospitals\/residents problem","volume":"2607","author":"Irving","year":"2003"},{"issue":"2","key":"10.1016\/j.tcs.2026.115980_bib0010","doi-asserted-by":"crossref","DOI":"10.1145\/1240233.1240238","article-title":"Strongly stable matchings in time O(nm) and extension to the hospitals-residents problem","volume":"3","author":"Kavitha","year":"2007","journal-title":"ACM Trans. Algorithms"},{"key":"10.1016\/j.tcs.2026.115980_bib0011","series-title":"Proceedings of the 18th Annual European Symposium on Algorithms, Part II","first-page":"147","article-title":"Strongly stable assignment","volume":"6347","author":"Chen","year":"2010"},{"key":"10.1016\/j.tcs.2026.115980_bib0012","series-title":"Proceedings of the 11th International Conference on Algorithms and Complexity","first-page":"299","article-title":"A faster algorithm for the strongly stable b-matching problem","volume":"11485","author":"Kunysz","year":"2019"},{"key":"10.1016\/j.tcs.2026.115980_bib0013","series-title":"Proceedings of the 12th Annual European Symposium on Algorithms","first-page":"508","article-title":"On the stability of multiple partner stable marriages with ties","volume":"3221","author":"Malhotra","year":"2004"},{"key":"10.1016\/j.tcs.2026.115980_bib0014","series-title":"Proceedings of the 8th Annual International Conference on Algorithms and Discrete Applied Mathematics","first-page":"384","article-title":"An algorithm for strong stability in the student-project allocation problem with ties","volume":"12016","author":"Olaosebikan","year":"2020"},{"issue":"3","key":"10.1016\/j.tcs.2026.115980_bib0015","doi-asserted-by":"crossref","first-page":"1471","DOI":"10.1137\/23M1587658","article-title":"Strongly stable matchings under matroid constraints","volume":"39","author":"Kamiyama","year":"2025","journal-title":"SIAM J. Discrete Math."},{"issue":"15","key":"10.1016\/j.tcs.2026.115980_bib0016","doi-asserted-by":"crossref","first-page":"2959","DOI":"10.1016\/j.dam.2008.01.002","article-title":"The stable marriage problem with master preference lists","volume":"156","author":"Irving","year":"2008","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.tcs.2026.115980_bib0017","series-title":"Algorithmic Aspects of Stable Matching Problems","author":"O\u2019Malley","year":"2007"},{"key":"10.1016\/j.tcs.2026.115980_bib0018","series-title":"Proceedings of the 8th International Symposium on Algorithmic Game Theory","first-page":"3","article-title":"Stable matchings with ties, master preference lists, and matroid constraints","volume":"9347","author":"Kamiyama","year":"2015"},{"key":"10.1016\/j.tcs.2026.115980_bib0019","series-title":"Proceedings of the 18th International Conference on Autonomous Agents and Multiagent Systems","doi-asserted-by":"crossref","first-page":"583","DOI":"10.65109\/MKYS8809","article-title":"Many-to-many stable matchings with ties, master preference lists, and matroid constraints","author":"Kamiyama","year":"2019"},{"issue":"34","key":"10.1016\/j.tcs.2026.115980_bib0020","article-title":"The college admissions problem with lower and common quotas","volume":"411","author":"Bir\u00f3","year":"2010","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"10.1016\/j.tcs.2026.115980_bib0021","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1016\/j.orl.2013.07.006","article-title":"A note on the serial dictatorship with project closures","volume":"41","author":"Kamiyama","year":"2013","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"10.1016\/j.tcs.2026.115980_bib0022","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.econlet.2013.03.007","article-title":"Matching with quorums","volume":"120","author":"Monte","year":"2013","journal-title":"Econ. Lett."},{"key":"10.1016\/j.tcs.2026.115980_bib0023","series-title":"Technical Report","article-title":"Approximation Hardness of Short Symmetric Instances of MAX-3SAT","author":"Berman","year":"2003"},{"key":"10.1016\/j.tcs.2026.115980_bib0024","article-title":"Discrete Convex Analysis","volume":"10","author":"Murota","year":"2003"},{"issue":"1","key":"10.1016\/j.tcs.2026.115980_bib0025","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","article-title":"On representatives of subsets","volume":"1","author":"Hall","year":"1935","journal-title":"J. London Math. Soc."},{"key":"10.1016\/j.tcs.2026.115980_bib0026","article-title":"Combinatorial Optimization: Polyhedra and Efficiency","volume":"24","author":"Schrijver","year":"2002"},{"issue":"4","key":"10.1016\/j.tcs.2026.115980_bib0027","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","article-title":"An n5\/2 algorithm for maximum matchings in bipartite graphs","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10.1016\/j.tcs.2026.115980_bib0028","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1016\/0196-6774(85)90033-1","article-title":"An efficient algorithm for the \u201cstable roommates\u201d problem","volume":"6","author":"Irving","year":"1985","journal-title":"J. Algor."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526002392?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526002392?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T03:23:10Z","timestamp":1778815390000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526002392"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":28,"alternative-id":["S0304397526002392"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115980","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The strongly stable matching problem with closures","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115980","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115980"}}