{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:50:23Z","timestamp":1743022223136,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"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_27","type":"book-chapter","created":{"date-parts":[[2021,9,19]],"date-time":"2021-09-19T22:05:30Z","timestamp":1632089130000},"page":"349-360","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Graphs of Stably Matchable Pairs"],"prefix":"10.1007","author":[{"given":"David","family":"Eppstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,20]]},"reference":[{"key":"27_CR1","doi-asserted-by":"publisher","unstructured":"Alon, N., Friedland, S.: The maximum number of perfect matchings in graphs with a given degree sequence. Electron. J. Combinatorics 15(1), N13 (2008). https:\/\/doi.org\/10.37236\/888","DOI":"10.37236\/888"},{"issue":"6","key":"27_CR2","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"HL Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 1305\u20131317 (1996). https:\/\/doi.org\/10.1137\/S0097539793251219","journal-title":"SIAM J. Comput."},{"key":"27_CR3","doi-asserted-by":"publisher","unstructured":"Bodlaender, H.L., Drange, P.G., Dregi, M.S., Fomin, F.V., Lokshtanov, D., Pilipczuk, M.: A $$c^kn$$ 5-approximation algorithm for treewidth. SIAM J. Comput. 45(2), 317\u2013378 (2016). https:\/\/doi.org\/10.1137\/130947374","DOI":"10.1137\/130947374"},{"issue":"12","key":"27_CR4","doi-asserted-by":"publisher","first-page":"2737","DOI":"10.1016\/j.dam.2008.08.023","volume":"157","author":"F Dorn","year":"2009","unstructured":"Dorn, F., Telle, J.A.: Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm. Discrete Appl. Math. 157(12), 2737\u20132746 (2009). https:\/\/doi.org\/10.1016\/j.dam.2008.08.023","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"27_CR5","doi-asserted-by":"publisher","first-page":"461","DOI":"10.7155\/jgaa.00468","volume":"22","author":"D Eppstein","year":"2018","unstructured":"Eppstein, D.: The effect of planarization on width. J. Graph Algorithms Appl. 22(3), 461\u2013481 (2018). https:\/\/doi.org\/10.7155\/jgaa.00468","journal-title":"J. Graph Algorithms Appl."},{"key":"27_CR6","unstructured":"Eppstein, D.: The graphs of stably matchable pairs. Electronic preprint arxiv:2010.09230 (2020)"},{"issue":"1","key":"27_CR7","doi-asserted-by":"publisher","first-page":"9","DOI":"10.2307\/2312726","volume":"69","author":"D Gale","year":"1962","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Mon. 69(1), 9\u201314 (1962). https:\/\/doi.org\/10.2307\/2312726","journal-title":"Am. Math. Mon."},{"key":"27_CR8","unstructured":"Gusfield, D., Irving, R.: The Stable Marriage Problem: Structure and Algorithms. MIT Press, Foundations of Computing Series (1989)"},{"issue":"2","key":"27_CR9","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1016\/0097-3165(87)90037-9","volume":"44","author":"D Gusfield","year":"1987","unstructured":"Gusfield, D., Irving, R., Leather, P., Saks, M.: Every finite distributive lattice is a set of stable matchings for a small stable marriage instance. J. Combinat. Theory Ser. A 44(2), 304\u2013309 (1987). https:\/\/doi.org\/10.1016\/0097-3165(87)90037-9","journal-title":"J. Combinat. Theory Ser. A"},{"key":"27_CR10","unstructured":"Immorlica, N., Mahdian, M.: Marriage, honesty, and stability. In: Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), pp. 53\u201362 (2005)"},{"issue":"3","key":"27_CR11","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1137\/0215048","volume":"15","author":"R Irving","year":"1986","unstructured":"Irving, R., Leather, P.: The complexity of counting stable marriages. SIAM J. Comput. 15(3), 655\u2013667 (1986). https:\/\/doi.org\/10.1137\/0215048","journal-title":"SIAM J. Comput."},{"key":"27_CR12","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: Diakonikolas, I., Kempe, D., Henzinger, M. (eds.) Proceedings of the 50th Symposium on Theory of Computing (STOC 2018), pp. 920\u2013925. Association for Computing Machinery (2018). http:\/\/arxiv.org\/abs\/1711.01032,https:\/\/doi.org\/10.1145\/3188745.3188848","DOI":"10.1145\/3188745.3188848"},{"key":"27_CR13","doi-asserted-by":"publisher","unstructured":"Knuth, D.E.: Stable marriage and its relation to other combinatorial problems, volume 10 of CRM Proceedings & Lecture Notes. American Mathematical Society (1997). https:\/\/doi.org\/10.1090\/crmp\/010","DOI":"10.1090\/crmp\/010"},{"issue":"1","key":"27_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/rsa.3240010102","volume":"1","author":"DE Knuth","year":"1990","unstructured":"Knuth, D.E., Motwani, R., Pittel, B.: Stable husbands. Random Struct. Algorithms 1(1), 1\u201314 (1990). https:\/\/doi.org\/10.1002\/rsa.3240010102","journal-title":"Random Struct. Algorithms"},{"key":"27_CR15","doi-asserted-by":"publisher","unstructured":"Manlove, D.F.: Algorithmics of Matching under Preferences, volume 2 of Series on Theoretical Computer Science. World Scientific (2013). https:\/\/doi.org\/10.1142\/8591","DOI":"10.1142\/8591"},{"issue":"3","key":"27_CR16","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01934199","volume":"10","author":"DG McVitie","year":"1970","unstructured":"McVitie, D.G., Wilson, L.B.: Stable marriage assignment for unequal sets. BIT Numerical Math. 10(3), 295\u2013309 (1970). https:\/\/doi.org\/10.1007\/BF01934199","journal-title":"BIT Numerical Math."},{"issue":"4","key":"27_CR17","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1137\/070696155","volume":"21","author":"B Pittel","year":"2007","unstructured":"Pittel, B., Shepp, L., Veklerov, E.: On the number of fixed pairs in a random instance of the stable marriage problem. SIAM J. Discrete Math. 21(4), 947\u2013958 (2007). https:\/\/doi.org\/10.1137\/070696155","journal-title":"SIAM J. Discrete Math."},{"key":"27_CR18","unstructured":"R\u00e9gin, J.-C.: A filtering algorithm for constraints of difference in CSPs. In: Hayes-Roth, B., Korf, R.E. (eds.) Proceedings of the 12th National Conference on Artificial Intelligence, Seattle, WA, USA, 31 July\u20134 August 1994, vol. 1, pp. 362\u2013367. AAAI Press and MIT Press (1994). https:\/\/www.aaai.org\/Library\/AAAI\/1994\/aaai94-055.php"},{"issue":"2","key":"27_CR19","doi-asserted-by":"publisher","first-page":"425","DOI":"10.2307\/1913160","volume":"54","author":"AE Roth","year":"1986","unstructured":"Roth, A.E.: On the allocation of residents to rural hospitals: a general property of two-sided matching markets. Econometrica 54(2), 425\u2013427 (1986). https:\/\/doi.org\/10.2307\/1913160","journal-title":"Econometrica"},{"key":"27_CR20","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.tcs.2011.12.071","volume":"423","author":"T Tassa","year":"2012","unstructured":"Tassa, T.: Finding all maximally-matchable edges in a bipartite graph. Theoretical Comput. Sci. 423, 50\u201358 (2012). https:\/\/doi.org\/10.1016\/j.tcs.2011.12.071","journal-title":"Theoretical Comput. Sci."}],"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_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T20:03:26Z","timestamp":1702065806000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86838-3_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030868376","9783030868383"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86838-3_27","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)"}}]}}