{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:23:14Z","timestamp":1742944994592,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030926809"},{"type":"electronic","value":"9783030926816"}],"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-92681-6_37","type":"book-chapter","created":{"date-parts":[[2021,12,10]],"date-time":"2021-12-10T14:20:26Z","timestamp":1639146026000},"page":"468-483","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Constrained Stable Marriage with Free Edges or Few Blocking Pairs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1748-0779","authenticated-orcid":false,"given":"Yinghui","family":"Wen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2137-205X","authenticated-orcid":false,"given":"Jiong","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,11]]},"reference":[{"issue":"2","key":"37_CR1","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1257\/000282805774670167","volume":"95","author":"A Abdulkadiro\u011flu","year":"2005","unstructured":"Abdulkadiro\u011flu, A., Pathak, P.A., Roth, A.E.: The New York city high school match. Am. Econ. Rev. 95(2), 364\u2013367 (2005)","journal-title":"Am. Econ. Rev."},{"key":"37_CR2","doi-asserted-by":"crossref","unstructured":"Abraham, D.J., Bir\u00f3, P., Manlove, D.F.: \u201cAlmost stable\u201d matchings in the roommates problem. In: Proceedings of the 3rd International Workshop on Approximation and Online Algorithms, pp. 1\u201314 (2005)","DOI":"10.1007\/11671411_1"},{"key":"37_CR3","unstructured":"Aziz, H., Chen, J., Gaspers, S., Sun, Z.: Stability and pareto optimality in refugee allocation matchings. In: Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, pp. 964\u2013972 (2018)"},{"key":"37_CR4","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.tcs.2012.01.022","volume":"432","author":"P Bir\u00f3","year":"2012","unstructured":"Bir\u00f3, P., Manlove, D.F., McDermid, E.: \u201cAlmost stable\u2019\u2019 matchings in the roommates problem with bounded preference lists. Theoret. Comput. Sci. 432, 10\u201320 (2012)","journal-title":"Theoret. Comput. Sci."},{"issue":"16\u201318","key":"37_CR5","doi-asserted-by":"publisher","first-page":"1828","DOI":"10.1016\/j.tcs.2010.02.003","volume":"411","author":"P Bir\u00f3","year":"2010","unstructured":"Bir\u00f3, P., Manlove, D.F., Mittal, S.: Size versus stability in the marriage problem. Theoret. Comput. Sci. 411(16\u201318), 1828\u20131841 (2010)","journal-title":"Theoret. Comput. Sci."},{"key":"37_CR6","unstructured":"Cechl\u00e1rov\u00e1, K., Fleiner, T.: Stable roommates with free edges. Technical report, Egerv\u00e1ry Research Group on Combinatorial (2009)"},{"key":"37_CR7","doi-asserted-by":"crossref","unstructured":"Cseh, \u00c1., Heeger, K.: The stable marriage problem with ties and restricted edges. Discrete Optim. 36, 100571 (2020)","DOI":"10.1016\/j.disopt.2020.100571"},{"key":"37_CR8","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.disopt.2016.03.002","volume":"20","author":"\u00c1 Cseh","year":"2016","unstructured":"Cseh, \u00c1., Manlove, D.F.: Stable marriage and roommates problems with restricted edges: complexity and approximability. Discrete Optim. 20, 62\u201389 (2016)","journal-title":"Discrete Optim."},{"issue":"1\u20133","key":"37_CR9","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/S0304-3975(03)00319-0","volume":"306","author":"VMF Dias","year":"2003","unstructured":"Dias, V.M.F., da Fonseca, G.D., de Figueiredo, C.M.H., Szwarcfiter, J.L.: The stable marriage problem with restricted pairs. Theoret. Comput. Sci. 306(1\u20133), 391\u2013405 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"37_CR10","doi-asserted-by":"publisher","unstructured":"Downey, R., Fellows, M.: Parameterized Complexity. Springer Science & Business Media (2012). https:\/\/doi.org\/10.1007\/978-1-4612-0515-9","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"Feder, T.: Stable Networks and Product Graphs. Stanford University Press, Palo Alto (1995)","DOI":"10.1090\/memo\/0555"},{"issue":"1","key":"37_CR12","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","volume":"69","author":"D Gale","year":"1962","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Monthly 69(1), 9\u201315 (1962)","journal-title":"Am. Math. Monthly"},{"key":"37_CR13","unstructured":"Gupta, S., Jain, P., Roy, S., Saurabh, S., Zehavi, M.: On the (parameterized) complexity of almost stable marriage. In: Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, pp. 1\u201317 (2020)"},{"issue":"1","key":"37_CR14","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1137\/0216010","volume":"16","author":"D Gusfield","year":"1987","unstructured":"Gusfield, D.: Three fast algorithms for four problems in stable marriage. SIAM J. Comput. 16(1), 111\u2013128 (1987)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"37_CR15","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1145\/28869.28871","volume":"34","author":"RW Irving","year":"1987","unstructured":"Irving, R.W., Leather, P., Gusfield, D.: An efficient algorithm for the \u201coptimal\u2019\u2019 stable marriage. J. ACM 34(3), 532\u2013543 (1987)","journal-title":"J. ACM"},{"issue":"1","key":"37_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF03167200","volume":"10","author":"A Kato","year":"1993","unstructured":"Kato, A.: Complexity of the sex-equal stable marriage problem. Jpn. J. Ind. Appl. Math. 10(1), 1\u201319 (1993)","journal-title":"Jpn. J. Ind. Appl. Math."},{"issue":"1\u20132","key":"37_CR17","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0304-3975(01)00206-7","volume":"276","author":"DF Manlove","year":"2002","unstructured":"Manlove, D.F., Irving, R.W., Iwama, K., Miyazaki, S., Morita, Y.: Hard variants of stable marriage. Theoret. Comput. Sci. 276(1\u20132), 261\u2013279 (2002)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"37_CR18","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/s10601-016-9249-7","volume":"22","author":"DF Manlove","year":"2017","unstructured":"Manlove, D.F., McBride, I., Trimble, J.: \u201cAlmost-stable\u2019\u2019 matchings in the hospitals\/residents problem with couples. Constraints - Int. J. 22(1), 50\u201372 (2017)","journal-title":"Constraints - Int. J."},{"key":"37_CR19","doi-asserted-by":"crossref","unstructured":"Manlove, D.F., O\u2019Malley, G.: Paired and altruistic kidney donation in the UK: algorithms and experimentation. In: Proceedings of 11th International Symposium on Experimental Algorithms, pp. 271\u2013282 (2012)","DOI":"10.1007\/978-3-642-30850-5_24"},{"key":"37_CR20","doi-asserted-by":"crossref","unstructured":"Mnich, M., Schlotter, I.: Stable marriage with covering constraints-a complete computational trichotomy. In: Proceedings of the 10th International Symposium of Algorithmic Game Theory, pp. 320\u2013332 (2017)","DOI":"10.1007\/978-3-319-66700-3_25"},{"key":"37_CR21","doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"key":"37_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dam.2013.10.030","volume":"167","author":"S Porschen","year":"2014","unstructured":"Porschen, S., Schmidt, T., Speckenmeyer, E., Wotzlaw, A.: XSAT and NAE-SAT of linear CNF classes. Discr. Appl. Math. 167, 1\u201314 (2014)","journal-title":"Discr. Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92681-6_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,13]],"date-time":"2021-12-13T00:08:22Z","timestamp":1639354102000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92681-6_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030926809","9783030926816"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92681-6_37","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":"11 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tianjin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"17 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/lxy.tjut.edu.cn\/COCOA2021\/COCOA_2021.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"62","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":"16","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":"8","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":"26% - 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":"4.2","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":"2.75","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)"}}]}}