{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:44:58Z","timestamp":1742985898387,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030868376"},{"type":"electronic","value":"9783030868383"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-86838-3_7","type":"book-chapter","created":{"date-parts":[[2021,9,19]],"date-time":"2021-09-19T22:05:30Z","timestamp":1632089130000},"page":"94-105","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Disjoint Stable Matchings in Linear Time"],"prefix":"10.1007","author":[{"given":"Aadityan","family":"Ganesh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H. V.","family":"Vishwa Prakash","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prajakta","family":"Nimbhorkar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Geevarghese","family":"Philip","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,20]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Faudree, R.J., Gould, R.J., Lesniak, L.M .: Neighborhood conditions and edge-disjoint perfect matchings. Dis. Math. 91(1):33\u201343 (1991)","DOI":"10.1016\/0012-365X(91)90160-4"},{"key":"7_CR2","unstructured":"Fomin, F.V., Golovach, P.A., Jaffke, L., Philip, G., Sagunov, D.: Diverse pairs of matchings. CoRR, abs\/2009.04567 (2020). https:\/\/arxiv.org\/abs\/2009.04567"},{"key":"7_CR3","doi-asserted-by":"publisher","unstructured":"Gale, D., Shapley. L.S.: College admissions and the stability of marriage. Am. Math. Monthly 69(1), 9\u201315 (1962). https:\/\/doi.org\/10.1080\/00029890.1962.11989827","DOI":"10.1080\/00029890.1962.11989827"},{"key":"7_CR4","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. MIT Press, Foundations of computing series (1989)"},{"issue":"4","key":"7_CR5","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1137\/0210055","volume":"10","author":"I Holyer","year":"1981","unstructured":"Holyer, I.: The NP-completeness of edge-coloring. SIAM J. Comput. 10(4), 718\u2013720 (1981)","journal-title":"SIAM J. Comput."},{"key":"7_CR6","doi-asserted-by":"publisher","unstructured":"Irving, R.W., Leather, P.: The complexity of counting stable marriages. SIAM J. Comput. 15(3), 655\u2013667 (1986). https:\/\/doi.org\/10.1137\/0215048","DOI":"10.1137\/0215048"},{"issue":"3","key":"7_CR7","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1137\/0215048","volume":"15","author":"RW Irving","year":"1986","unstructured":"Irving, R.W., Leather, P.: The complexity of counting stable marriages. SIAM J. Comput. 15(3), 655\u2013667 (1986)","journal-title":"SIAM J. Comput."},{"key":"7_CR8","doi-asserted-by":"publisher","unstructured":"Karlin, A.R., Gharan, S.O., Weber, R.: A simply exponential upper bound on the maximum number of stable matchings. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (STOC 2018). pp. 920\u2013925, New York, NY, USA (2018). Association for Computing Machinery. https:\/\/doi.org\/10.1145\/3188745.3188848","DOI":"10.1145\/3188745.3188848"},{"key":"7_CR9","volume-title":"Mariages stables et leurs relations avec d\u2019autres probl\u00e8mes combinatoires : introduction \u00e0 l\u2019analyse math\u00e8matique des algorithmes","author":"D Knuth","year":"1976","unstructured":"Knuth, D.: Mariages stables et leurs relations avec d\u2019autres probl\u00e8mes combinatoires\u202f: introduction \u00e0 l\u2019analyse math\u00e8matique des algorithmes. Presses de l\u2019Universit\u00e8 de Montr\u00e8al, Montr\u00e8al (1976)"},{"issue":"4","key":"7_CR10","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/BF01456961","volume":"77","author":"D K\u00f6nig","year":"1916","unstructured":"K\u00f6nig, D.: \u00dcber graphen und ihre anwendung auf determinantentheorie und mengenlehre. Mathematische Annalen 77(4), 453\u2013465 (1916)","journal-title":"Mathematische Annalen"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Lennon, G., Pittel, B.: On the likely number of solutions for the stable marriage problem. Comb. Probab. Comput. 18(3), 371\u2013421 (2009)","DOI":"10.1017\/S0963548308009607"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Lu, H., Wang, D.G.L.: The number of disjoint perfect matchings in semi-regular graphs. Appl. Anal. Discrete Math. 11(1), 11\u201338 (2017)","DOI":"10.2298\/AADM161109030L"},{"issue":"7","key":"7_CR13","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1145\/362619.362631","volume":"14","author":"DG McVitie","year":"1971","unstructured":"McVitie, D.G., Wilson, L.B.: The stable marriage problem. Commun. ACM 14(7), 486\u2013490 (1971)","journal-title":"Commun. ACM"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Mkrtchyan, V.V., Musoyan, M.I., Tserunyan, A.V.: On edge-disjoint pairs of matchings. Discrete Math. 308(23), 5823\u20135828 (2008)","DOI":"10.1016\/j.disc.2007.09.061"},{"key":"7_CR15","unstructured":"Palmer, C., P\u00e1lv\u00f6lgyi, D.: At most $$4.47^n$$ stable matchings (2020). http:\/\/arxiv.org\/abs\/2011.00915"},{"issue":"4","key":"7_CR16","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1137\/0402048","volume":"2","author":"BG Pittel","year":"1989","unstructured":"Pittel, B.G.: The average number of stable matchings. SIAM J. Discret. Math. 2(4), 530\u2013549 (1989)","journal-title":"SIAM J. Discret. Math."},{"issue":"4","key":"7_CR17","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1287\/moor.23.4.874","volume":"23","author":"C-P Teo","year":"1998","unstructured":"Teo, C.-P., Sethuraman, J.: The geometry of fractional stable matchings and its applications. Math. Oper. Res. 23(4), 874\u2013891 (1998)","journal-title":"Math. Oper. Res."},{"key":"7_CR18","doi-asserted-by":"publisher","first-page":"347","DOI":"10.4153\/CJM-1954-033-3","volume":"6","author":"William Thomas Tutte","year":"1954","unstructured":"William Thomas Tutte: A short proof of the factor theorem for finite graphs. Can. J. Math. 6, 347\u2013352 (1954)","journal-title":"Can. J. Math."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86838-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T20:02:02Z","timestamp":1702065722000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86838-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030868376","9783030868383"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86838-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"20 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Warsaw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"47","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2021","order":10,"name":"conference_id","label":"Conference ID","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 and OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"73","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":"41% - 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":"11","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)"}},{"value":"The conference was held online due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}