{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T00:17:18Z","timestamp":1783124238892,"version":"3.54.6"},"reference-count":24,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T00:00:00Z","timestamp":1779408000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100003500","name":"Universit\u00e0 degli Studi di Padova","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003500","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003407","name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","award":["2022BMBW2A"],"award-info":[{"award-number":["2022BMBW2A"]}],"id":[{"id":"10.13039\/501100003407","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003407","name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","award":["CUP I53D23002310006"],"award-info":[{"award-number":["CUP I53D23002310006"]}],"id":[{"id":"10.13039\/501100003407","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100024370","name":"Ministero dell'Istruzione dell'Universita e della Ricerca","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100024370","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Optimization"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.disopt.2026.100956","type":"journal-article","created":{"date-parts":[[2026,5,25]],"date-time":"2026-05-25T12:22:00Z","timestamp":1779711720000},"page":"100956","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["The red\u2013blue\u2013yellow matching problem"],"prefix":"10.1016","volume":"61","author":[{"given":"Manuel","family":"Aprile","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7223-0380","authenticated-orcid":false,"given":"Marco","family":"Di Summa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.disopt.2026.100956_b1","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","article-title":"Paths, trees, and flowers","volume":"17","author":"Edmonds","year":"1965","journal-title":"Canad. J. Math."},{"issue":"2","key":"10.1016\/j.disopt.2026.100956_b2","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1145\/322307.322309","article-title":"The complexity of restricted spanning tree problems","volume":"29","author":"Papadimitriou","year":"1982","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/j.disopt.2026.100956_b3","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02579206","article-title":"Matching is as easy as matrix inversion","volume":"7","author":"Mulmuley","year":"1987","journal-title":"Combinatorica"},{"key":"10.1016\/j.disopt.2026.100956_b4","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s00453-011-9519-0","article-title":"Almost exact matchings","volume":"63","author":"Yuster","year":"2012","journal-title":"Algorithmica"},{"issue":"2","key":"10.1016\/j.disopt.2026.100956_b5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3041402","article-title":"Exact perfect matching in complete graphs","volume":"9","author":"Gurjar","year":"2017","journal-title":"ACM Trans. Comput. Theory (TOCT)"},{"key":"10.1016\/j.disopt.2026.100956_b6","series-title":"40th International Symposium on Theoretical Aspects of Computer Science","first-page":"29:1","article-title":"Exact matching: Algorithms and related problems","author":"El Maalouly","year":"2023"},{"key":"10.1016\/j.disopt.2026.100956_b7","series-title":"Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing","first-page":"355","article-title":"Derandomizing polynomial identity tests means proving circuit lower bounds","author":"Kabanets","year":"2003"},{"key":"10.1016\/j.disopt.2026.100956_b8","series-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","first-page":"18:1","article-title":"An approximation algorithm for the exact matching problem in bipartite graphs","author":"D\u00fcrr","year":"2023"},{"key":"10.1016\/j.disopt.2026.100956_b9","series-title":"Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"2301","article-title":"Integer programs with nearly totally unimodular matrices: the cographic case","author":"Aprile","year":"2025"},{"issue":"2","key":"10.1016\/j.disopt.2026.100956_b10","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/0196-6774(92)90018-8","article-title":"Random pseudo-polynomial algorithms for exact matroid problems","volume":"13","author":"Camerini","year":"1992","journal-title":"J. Algorithms"},{"issue":"3","key":"10.1016\/j.disopt.2026.100956_b11","doi-asserted-by":"crossref","first-page":"1303","DOI":"10.1287\/moor.2023.1381","article-title":"Congruency-constrained TU problems beyond the bimodular case","volume":"49","author":"N\u00e4gele","year":"2024","journal-title":"Math. Oper. Res."},{"key":"10.1016\/j.disopt.2026.100956_b12","first-page":"1","article-title":"Advances on strictly \u0394-modular IPs","author":"N\u00e4gele","year":"2024","journal-title":"Math. Program."},{"key":"10.1016\/j.disopt.2026.100956_b13","series-title":"European Symposium on Algorithms","first-page":"536","article-title":"Approximation schemes for multi-budgeted independence systems","author":"Grandoni","year":"2010"},{"key":"10.1016\/j.disopt.2026.100956_b14","series-title":"Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"1080","article-title":"Multi-budgeted matchings and matroid intersection via dependent rounding","author":"Chekuri","year":"2011"},{"key":"10.1016\/j.disopt.2026.100956_b15","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1007\/s10107-013-0703-7","article-title":"New approaches to multi-objective optimization","volume":"146","author":"Grandoni","year":"2014","journal-title":"Math. Program."},{"key":"10.1016\/j.disopt.2026.100956_b16","series-title":"International Colloquium on Automata, Languages and Programming","first-page":"49:1","article-title":"An EPTAS for budgeted matching and budgeted matroid intersection via representative sets","author":"Doron-Arad","year":"2023"},{"issue":"1\u20132","key":"10.1016\/j.disopt.2026.100956_b17","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","article-title":"Maximum matching and a polyhedron with 0,1-vertices","volume":"69","author":"Edmonds","year":"1965","journal-title":"J. Res. Natl. Bur. Stand. B"},{"issue":"1","key":"10.1016\/j.disopt.2026.100956_b18","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1287\/moor.7.1.67","article-title":"Odd minimum cut-sets and b-matchings","volume":"7","author":"Padberg","year":"1982","journal-title":"Math. Oper. Res."},{"issue":"1","key":"10.1016\/j.disopt.2026.100956_b19","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1002\/jgt.3190200110","article-title":"Hamiltonian weights and unique 3-edge-colorings of cubic graphs","volume":"20","author":"Zhang","year":"1995","journal-title":"J. Graph Theory"},{"issue":"1\u20133","key":"10.1016\/j.disopt.2026.100956_b20","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/S0012-365X(00)00077-7","article-title":"On strong 1-factors and Hamilton weights of cubic graphs","volume":"230","author":"Zhang","year":"2001","journal-title":"Discrete Math."},{"key":"10.1016\/j.disopt.2026.100956_b21","series-title":"Topology (Second Edition)","author":"Munkres","year":"2014"},{"issue":"1","key":"10.1016\/j.disopt.2026.100956_b22","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/s10107-023-02025-4","article-title":"Inapproximability of shortest paths on perfect matching polytopes","volume":"210","author":"Cardinal","year":"2025","journal-title":"Math. Program."},{"issue":"1","key":"10.1016\/j.disopt.2026.100956_b23","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0022-247X(85)90021-6","article-title":"Sets on which several measures agree","volume":"108","author":"Stromquist","year":"1985","journal-title":"J. Math. Anal. Appl."},{"issue":"1","key":"10.1016\/j.disopt.2026.100956_b24","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S0195-6698(13)80053-4","article-title":"The cycle lemma and some applications","volume":"11","author":"Dershowitz","year":"1990","journal-title":"European J. Combin."}],"container-title":["Discrete Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1572528626000290?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1572528626000290?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T23:22:39Z","timestamp":1783120959000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1572528626000290"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":24,"alternative-id":["S1572528626000290"],"URL":"https:\/\/doi.org\/10.1016\/j.disopt.2026.100956","relation":{},"ISSN":["1572-5286"],"issn-type":[{"value":"1572-5286","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The red\u2013blue\u2013yellow matching problem","name":"articletitle","label":"Article Title"},{"value":"Discrete Optimization","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disopt.2026.100956","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Authors. Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"100956"}}