{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:33:24Z","timestamp":1740123204189,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2022,11,28]],"date-time":"2022-11-28T00:00:00Z","timestamp":1669593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,28]],"date-time":"2022-11-28T00:00:00Z","timestamp":1669593600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1007\/s10479-022-05073-9","type":"journal-article","created":{"date-parts":[[2022,11,28]],"date-time":"2022-11-28T17:18:01Z","timestamp":1669655881000},"page":"39-48","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Perfect matching in bipartite hypergraphs subject to a demand graph"],"prefix":"10.1007","volume":"321","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7211-2795","authenticated-orcid":false,"given":"Lior","family":"Aronshtam","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3548-1572","authenticated-orcid":false,"given":"Hagai","family":"Ilani","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7960-5798","authenticated-orcid":false,"given":"Elad","family":"Shufan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,28]]},"reference":[{"key":"5073_CR1","doi-asserted-by":"crossref","unstructured":"Annamalai, C. (2016). Finding perfect matchings in bipartite hypergraphs. In Proceedings of the twenty-seventh annual acm-siam symposium on discrete algorithms (pp. 1814\u20131823).","DOI":"10.1137\/1.9781611974331.ch126"},{"key":"5073_CR2","unstructured":"Aronshtam, L., Ilani, H., Shufan, E. (2019). Satisfying allocation of plots to tenants. In Proceedings of the 9th multidisciplinary international conference on scheduling: Theory and applications (pp. 30\u201341)."},{"issue":"3","key":"5073_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2229163.2229168","volume":"8","author":"A Asadpour","year":"2012","unstructured":"Asadpour, A., Feige, U., & Saberi, A. (2012). Santa Claus meets hypergraph matchings. ACM Transactions on Algorithms (TALG), 8(3), 1\u20139.","journal-title":"ACM Transactions on Algorithms (TALG)"},{"key":"5073_CR4","doi-asserted-by":"crossref","unstructured":"Bir\u00f3, P., & McDermid, E. (2010). Matching with sizes (or scheduling with processing set restrictions). In Technical report TR-2010-307.","DOI":"10.1016\/j.endm.2010.05.043"},{"key":"5073_CR5","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.dam.2011.11.003","volume":"164","author":"P Bir\u00f3","year":"2014","unstructured":"Bir\u00f3, P., & McDermid, E. (2014). Matching with sizes (or scheduling with processing set restrictions). Discrete Applied Mathematics, 164, 61\u201367.","journal-title":"Discrete Applied Mathematics"},{"key":"5073_CR6","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.disopt.2014.11.002","volume":"15","author":"R Bornd\u00f6rfer","year":"2015","unstructured":"Bornd\u00f6rfer, R., & Heismann, O. (2015). The hypergraph assignment problem. Discrete Optimization, 15, 15\u201325.","journal-title":"Discrete Optimization"},{"issue":"3\u20134","key":"5073_CR7","first-page":"1","volume":"6","author":"S Bronfman","year":"2018","unstructured":"Bronfman, S., Alon, N., Hassidim, A., & Romm, A. (2018). Redesigning the Israeli medical internship match. ACM Transactions on Economics and Computation (TEAC), 6(3\u20134), 1\u201318.","journal-title":"ACM Transactions on Economics and Computation (TEAC)"},{"key":"5073_CR8","doi-asserted-by":"crossref","unstructured":"Burkard, R., Dell\u2019Amico, M., & Martello, S. (2012). Assignment problems: Revised reprint. SIAM.","DOI":"10.1137\/1.9781611972238"},{"key":"5073_CR9","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.aam.2013.12.001","volume":"54","author":"S Chiba","year":"2014","unstructured":"Chiba, S., Fujita, S., Kawarabayashi, K.-I., & Sakuma, T. (2014). Minimum degree conditions for vertex-disjoint even cycles in large graphs. Advances in Applied Mathematics, 54, 105\u2013120.","journal-title":"Advances in Applied Mathematics"},{"issue":"1","key":"5073_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00373-017-1873-5","volume":"34","author":"S Chiba","year":"2018","unstructured":"Chiba, S., & Yamashita, T. (2018). Degree conditions for the existence of vertex-disjoint cycles and paths: A survey. Graphs and Combinatorics, 34(1), 1\u201383.","journal-title":"Graphs and Combinatorics"},{"issue":"4","key":"5073_CR11","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s00493-012-2660-9","volume":"32","author":"M Chudnovsky","year":"2012","unstructured":"Chudnovsky, M., & Seymour, P. (2012). Perfect matchings in planar cubic graphs. Combinatorica, 32(4), 403\u2013424.","journal-title":"Combinatorica"},{"key":"5073_CR12","doi-asserted-by":"crossref","unstructured":"Cygan, M., Grandoni, F., Mastrolilli, M. (2013). How to sell hyperedges: The hypermatching assignment problem. In Proceedings of the twenty-fourth annual acm-siam symposium on discrete algorithms (pp. 342\u2013351).","DOI":"10.1137\/1.9781611973105.25"},{"key":"5073_CR13","doi-asserted-by":"crossref","unstructured":"Delorme, M., Garc\u0131a, S., Gondzio, J., Kalcsics, J., Manlove, D., Pettersson, W. (2020). Stability in the the hospitals\/residents problem with couples and ties: Mathematical models and computational studies. Technical report ERGO-20-003.","DOI":"10.1016\/j.omega.2020.102386"},{"issue":"4","key":"5073_CR14","doi-asserted-by":"publisher","first-page":"1646","DOI":"10.1016\/j.aim.2011.03.015","volume":"227","author":"L Esperet","year":"2011","unstructured":"Esperet, L., Kardo\u0161, F., King, A. D., Kr\u00e1l, D., & Norine, S. (2011). Exponentially many perfect matchings in cubic graphs. Advances in Mathematics, 227(4), 1646\u20131664.","journal-title":"Advances in Mathematics"},{"issue":"1","key":"5073_CR15","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0893-9659(94)90045-0","volume":"7","author":"K Fukuda","year":"1994","unstructured":"Fukuda, K., & Matsui, T. (1994). Finding all the perfect matchings in bipartite graphs. Applied Mathematics Letters, 7(1), 15\u201318.","journal-title":"Applied Mathematics Letters"},{"issue":"4","key":"5073_CR16","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1137\/0210055","volume":"10","author":"I Holyer","year":"1981","unstructured":"Holyer, I. (1981). The np-completeness of edge-coloring. SIAM Journal on computing, 10(4), 718\u2013720.","journal-title":"SIAM Journal on computing"},{"key":"5073_CR17","doi-asserted-by":"crossref","unstructured":"Karp, R.M. (1972). Reducibility among combinatorial problems. Complexity of computer computations (pp. 85\u2013103). Springer","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"4","key":"5073_CR18","doi-asserted-by":"publisher","first-page":"1585","DOI":"10.1093\/qje\/qjt019","volume":"128","author":"F Kojima","year":"2013","unstructured":"Kojima, F., Pathak, P. A., & Roth, A. E. (2013). Matching with couples: Stability and incentives in large markets. The Quarterly Journal of Economics, 128(4), 1585\u20131632.","journal-title":"The Quarterly Journal of Economics"},{"issue":"1\u20132","key":"5073_CR19","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H. W. (1955). The Hungarian method for the assignment problem. Naval research logistics quarterly, 2(1\u20132), 83\u201397.","journal-title":"Naval research logistics quarterly"},{"key":"5073_CR20","unstructured":"Lov\u00e1sz, L., & Plummer, M.D. (1986). Matching theory. In Annals of discrete mathematics, 29."},{"key":"5073_CR21","unstructured":"Martello, S., & Toth, P. (1990). Knapsack problems: Algorithms and computer implementations. John Wiley & Sons Inc."},{"issue":"1","key":"5073_CR22","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.disopt.2010.07.004","volume":"8","author":"D Marx","year":"2011","unstructured":"Marx, D., & Schlotter, I. (2011). Stable assignment with couples: Parameterized complexity and local search. Discrete Optimization, 8(1), 25\u201340.","journal-title":"Discrete Optimization"},{"issue":"2","key":"5073_CR23","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0196-6774(90)90007-2","volume":"11","author":"E Ronn","year":"1990","unstructured":"Ronn, E. (1990). Np-complete stable matching problems. Journal of Algorithms, 11(2), 285\u2013304.","journal-title":"Journal of Algorithms"},{"issue":"1","key":"5073_CR24","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1006\/jctb.1997.1798","volume":"72","author":"A Schrijver","year":"1998","unstructured":"Schrijver, A. (1998). Counting 1-factors in regular bipartite graphs. Journal of Combinatorial Theory, Series B, 72(1), 122\u2013135.","journal-title":"Journal of Combinatorial Theory, Series B"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-022-05073-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-022-05073-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-022-05073-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,25]],"date-time":"2023-01-25T19:11:08Z","timestamp":1674673868000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-022-05073-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,28]]},"references-count":24,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["5073"],"URL":"https:\/\/doi.org\/10.1007\/s10479-022-05073-9","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2022,11,28]]},"assertion":[{"value":"8 November 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 November 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}