{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:43:00Z","timestamp":1743014580030,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030002558"},{"type":"electronic","value":"9783030002565"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-030-00256-5_15","type":"book-chapter","created":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T08:22:08Z","timestamp":1535790128000},"page":"176-189","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Optimal General Matchings"],"prefix":"10.1007","author":[{"given":"Szymon","family":"Dudycz","sequence":"first","affiliation":[]},{"given":"Katarzyna","family":"Paluch","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,2]]},"reference":[{"issue":"3","key":"15_CR1","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0020-0190(87)90178-5","volume":"24","author":"RP Anstee","year":"1987","unstructured":"Anstee, R.P.: A polynomial algorithm for b-matchings: an alternative approach. Inf. Process. Lett. 24(3), 153\u2013157 (1987)","journal-title":"Inf. Process. Lett."},{"issue":"34","key":"15_CR2","doi-asserted-by":"publisher","first-page":"3136","DOI":"10.1016\/j.tcs.2010.05.005","volume":"411","author":"P Bir\u00f3","year":"2010","unstructured":"Bir\u00f3, P., Fleiner, T., Irving, R.W., Manlove, D.F.: The college admissions problem with lower and common quotas. Theor. Comput. Sci. 411(34), 3136\u20133153 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-540-45193-8_11","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"S Bourdais","year":"2003","unstructured":"Bourdais, S., Galinier, P., Pesant, G.: HIBISCUS: a constraint programming application to staff scheduling in health care. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 153\u2013167. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45193-8_11"},{"issue":"4","key":"15_CR4","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1016\/j.orl.2005.06.004","volume":"34","author":"R Carr","year":"2006","unstructured":"Carr, R., Parekh, O.: A 12-integral relaxation for the a-matching problem. Oper. Res. Lett. 34(4), 445\u2013450 (2006)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"15_CR5","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0095-8956(88)90068-8","volume":"45","author":"G Cornu\u00e9jols","year":"1988","unstructured":"Cornu\u00e9jols, G.: General factors of graphs. J. Comb. Theory, Ser. B 45(2), 185\u2013198 (1988)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"15_CR6","unstructured":"Dudycz, S., Paluch, K.E.: Optimal general matchings. CoRR, abs\/1706.07418 (2017)"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Gabow, H.N.: An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems. In: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, STOC 1983, pp. 448\u2013456. ACM, New York (1983)","DOI":"10.1145\/800061.808776"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Gabow, H.N., Sankowski, P.: Algebraic algorithms for b-matching, shortest undirected paths, and f-factors. In: 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, Berkeley, CA, USA, 26\u201329 October 2013, pp. 137\u2013146 (2013)","DOI":"10.1109\/FOCS.2013.23"},{"issue":"1","key":"15_CR9","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/s00453-011-9548-8","volume":"64","author":"G Gutin","year":"2012","unstructured":"Gutin, G., Kim, E.J., Soleimanfallah, A., Szeider, S., Yeo, A.: Parameterized complexity results for general factors in bipartite graphs with an application to constraint programming. Algorithmica 64(1), 112\u2013125 (2012)","journal-title":"Algorithmica"},{"issue":"1","key":"15_CR10","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1006\/jagm.1993.1006","volume":"14","author":"P Hell","year":"1993","unstructured":"Hell, P., Kirkpatrick, D.G.: Algorithms for degree constrained graph factors of minimum deficiency. J. Algorithms 14(1), 115\u2013138 (1993)","journal-title":"J. Algorithms"},{"issue":"1","key":"15_CR11","first-page":"57","volume":"2","author":"AJW Hilton","year":"2005","unstructured":"Hilton, A.J.W., Wojciechowski, J.: Semiregular factorization of simple graphs. AKCE Int. J. Graphs Comb. 2(1), 57\u201362 (2005)","journal-title":"AKCE Int. J. Graphs Comb."},{"issue":"1","key":"15_CR12","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1002\/jgt.3190090111","volume":"9","author":"M Kano","year":"1985","unstructured":"Kano, M.: [a, b]-Factorization of a graph. J. Graph Theory 9(1), 129\u2013146 (1985)","journal-title":"J. Graph Theory"},{"issue":"2","key":"15_CR13","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BF02276100","volume":"4","author":"L Lov\u00e1sz","year":"1973","unstructured":"Lov\u00e1sz, L.: Antifactors of graphs. Periodica Mathematica Hungarica 4(2), 121\u2013123 (1973)","journal-title":"Periodica Mathematica Hungarica"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L.: The factorization of graphs. ii. Acta Mathematica Hungarica 23(1\u20132), 223\u2013246 (1972)","DOI":"10.1007\/BF01889919"},{"issue":"3","key":"15_CR15","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1002\/jgt.3190150306","volume":"15","author":"M-C Cai","year":"1991","unstructured":"Cai, M.-C.: [a, b]-Factorizations of graphs. J. Graph Theory 15(3), 283\u2013301 (1991)","journal-title":"J. Graph Theory"},{"key":"15_CR16","unstructured":"Marsh III, A.B.: Matching algorithms. Ph.D. thesis, The Johns Hopkins University (1979)"},{"issue":"2","key":"15_CR17","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1016\/j.artint.2010.10.005","volume":"175","author":"P Nightingale","year":"2011","unstructured":"Nightingale, P.: The extended global cardinality constraint: an empirical survey. Artif. Intell. 175(2), 586\u2013614 (2011)","journal-title":"Artif. Intell."},{"key":"15_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-540-25960-2_11","volume-title":"Integer Programming and Combinatorial Optimization","author":"G Pap","year":"2004","unstructured":"Pap, G.: A TDI description of restricted 2-matching polytopes. In: Bienstock, D., Nemhauser, G. (eds.) IPCO 2004. LNCS, vol. 3064, pp. 139\u2013151. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-25960-2_11"},{"key":"15_CR19","unstructured":"Pulleyblank, W.R.: Faces of matching polyhedra. Ph.D. thesis, Department of Combinatorics and Optimization, University of Waterloo (1973)"},{"key":"15_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/BFb0017428","volume-title":"Principles and Practice of Constraint Programming-CP97","author":"J-C R\u00e9gin","year":"1997","unstructured":"R\u00e9gin, J.-C., Puget, J.-F.: A filtering algorithm for global sequencing constraints. In: Smolka, G. (ed.) CP 1997. LNCS, vol. 1330, pp. 32\u201346. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0017428"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Samer, M., Szeider, S.: Tractable cases of the extended global cardinality constraint. In: Proceedings of the Fourteenth Symposium on Computing: The Australasian Theory, CATS 2008, Darlinghurst, Australia, vol. 77, pp. 67\u201374. Australian Computer Society Inc. (2008)","DOI":"10.1007\/s10601-009-9077-0"},{"key":"15_CR22","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A Schrijver","year":"2002","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency, vol. 24. Springer, Heidelberg (2002)"},{"issue":"2","key":"15_CR23","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1006\/jctb.1993.1035","volume":"58","author":"A Seb\u00f6","year":"1993","unstructured":"Seb\u00f6, A.: General antifactors of graphs. J. Comb. Theory, Ser. B 58(2), 174\u2013184 (1993)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"15_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-642-04244-7_11","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"H Simonis","year":"2009","unstructured":"Simonis, H.: A hybrid constraint model for the routing and wavelength assignment problem. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 104\u2013118. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04244-7_11"},{"issue":"2","key":"15_CR25","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1016\/j.jctb.2008.08.009","volume":"99","author":"J Szab\u00f3","year":"2009","unstructured":"Szab\u00f3, J.: Good characterizations for some degree constrained subgraphs. J. Comb. Theory, Ser. B 99(2), 436\u2013446 (2009)","journal-title":"J. Comb. Theory, Ser. B"}],"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-00256-5_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T13:25:20Z","timestamp":1710336320000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-00256-5_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030002558","9783030002565"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00256-5_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"2 September 2018","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":"Cottbus","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.wg2018.b-tu.de\/","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":"66","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":"45% - 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","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,5","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)"}}]}}