{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T16:30:18Z","timestamp":1787502618181,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030174019","type":"print"},{"value":"9783030174026","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-17402-6_25","type":"book-chapter","created":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T09:37:00Z","timestamp":1558345020000},"page":"299-310","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Faster Algorithm for the Strongly Stable b-Matching Problem"],"prefix":"10.1007","author":[{"given":"Adam","family":"Kunysz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,4,6]]},"reference":[{"issue":"1\u20133","key":"25_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0166-218X(99)00203-6","volume":"101","author":"M Ba\u00efou","year":"2000","unstructured":"Ba\u00efou, M., Balinski, M.: Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry). Discrete Appl. Math. 101(1\u20133), 1\u201312 (2000)","journal-title":"Discrete Appl. Math."},{"key":"25_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-642-15781-3_13","volume-title":"Algorithms \u2013 ESA 2010","author":"N Chen","year":"2010","unstructured":"Chen, N., Ghosh, A.: Strongly stable assignment. In: de Berg, M., Meyer, U. (eds.) ESA 2010. LNCS, vol. 6347, pp. 147\u2013158. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15781-3_13"},{"key":"25_CR3","series-title":"Foundations of Computing Series","volume-title":"The Stable Marriage Problem - Structure and Algorithms","author":"D Gusfield","year":"1989","unstructured":"Gusfield, D., Irving, R.W.: The Stable Marriage Problem - Structure and Algorithms. Foundations of Computing Series. MIT Press, Cambridge (1989)"},{"issue":"4","key":"25_CR4","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1016\/0196-6774(85)90033-1","volume":"6","author":"RW Irving","year":"1985","unstructured":"Irving, R.W.: An efficient algorithm for the \u201cstable roommates\u201d problem. J. Algorithms 6(4), 577\u2013595 (1985)","journal-title":"J. Algorithms"},{"issue":"3","key":"25_CR5","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0166-218X(92)00179-P","volume":"48","author":"RW Irving","year":"1994","unstructured":"Irving, R.W.: Stable marriage and indifference. Discrete Appl. Math. 48(3), 261\u2013272 (1994)","journal-title":"Discrete Appl. Math."},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/3-540-36494-3_39","volume-title":"STACS 2003","author":"RW Irving","year":"2003","unstructured":"Irving, R.W., Manlove, D.F., Scott, S.: Strong stability in the hospitals\/residents problem. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 439\u2013450. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36494-3_39"},{"issue":"16","key":"25_CR7","doi-asserted-by":"publisher","first-page":"2118","DOI":"10.1016\/j.dam.2007.05.015","volume":"155","author":"RW Irving","year":"2007","unstructured":"Irving, R.W., Scott, S.: The stable fixtures problem - a many-to-many extension of stable roommates. Discrete Appl. Math. 155(16), 2118\u20132129 (2007)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"25_CR8","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1145\/1240233.1240238","volume":"3","author":"T Kavitha","year":"2007","unstructured":"Kavitha, T., Mehlhorn, K., Michail, D., Paluch, K.E.: Strongly stable matchings in time O(nm) and extension to the hospitals-residents problem. ACM Trans. Algorithms 3(2), 15 (2007)","journal-title":"ACM Trans. Algorithms"},{"key":"25_CR9","unstructured":"Kunysz, A.: The strongly stable roommates problem. In: Sankowski, P., Zaroliagis, C.D. (eds.) 24th Annual European Symposium on Algorithms, ESA 2016, Aarhus, Denmark, 22\u201324 August 2016, Volume 57 of LIPIcs, pp. 60:1\u201360:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016)"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Kunysz, A., Paluch, K.E., Ghosal, P.: Characterisation of strongly stable matchings. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, 10\u201312 January 2016, pp. 107\u2013119 (2016)","DOI":"10.1137\/1.9781611974331.ch8"},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1007\/978-3-540-30140-0_46","volume-title":"Algorithms \u2013 ESA 2004","author":"VS Malhotra","year":"2004","unstructured":"Malhotra, V.S.: On the stability of multiple partner stable marriages with ties. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 508\u2013519. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30140-0_46"},{"key":"25_CR12","unstructured":"Manlove, D.F.: Stable marriage with ties and unacceptable partners. Technical report, University of Glasgow (1999)"},{"issue":"1\u20133","key":"25_CR13","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0166-218X(01)00322-5","volume":"122","author":"DF Manlove","year":"2002","unstructured":"Manlove, D.F.: The structure of stable marriage with indifference. Discrete Appl. Math. 122(1\u20133), 167\u2013181 (2002)","journal-title":"Discrete Appl. Math."},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Manlove, D.F.: Algorithmics of Matching Under Preferences, Volume 2 of Series on Theoretical Computer Science. World Scientific (2013)","DOI":"10.1142\/8591"},{"issue":"6","key":"25_CR15","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1086\/261272","volume":"92","author":"AE Roth","year":"1984","unstructured":"Roth, A.E.: The evolution of the labor market for medical interns and residents: a case study in game theory. J. Polit. Econ. 92(6), 991\u20132016 (1984)","journal-title":"J. Polit. Econ."},{"key":"25_CR16","unstructured":"Scott, S.: A study of stable marriage problems with ties. Ph.D. thesis, University of Glasgow (2005)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-17402-6_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T08:57:15Z","timestamp":1710320235000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-17402-6_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030174019","9783030174026"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17402-6_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/easyconferences.eu\/ciac2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"95","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}