{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:57:35Z","timestamp":1781305055217,"version":"3.54.1"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032286901","type":"print"},{"value":"9783032286918","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-28691-8_23","type":"book-chapter","created":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:33:23Z","timestamp":1781303603000},"page":"346-361","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficiently Coloring the\u00a0Intersection of\u00a0a\u00a0General Matroid and\u00a0Combinatorial Matroids"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-2847-0721","authenticated-orcid":false,"given":"Stephen","family":"Arndt","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8162-017X","authenticated-orcid":false,"given":"Benjamin","family":"Moseley","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5680-1753","authenticated-orcid":false,"given":"Kirk","family":"Pruhs","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1773-1152","authenticated-orcid":false,"given":"Michael","family":"Zlatin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,13]]},"reference":[{"key":"23_CR1","unstructured":"Abdolazimi, D., Karlin, A.R., Klein, N., Gharan, S.O.: Matroid partition property and the secretary problem. In: 14th Innovations in Theoretical Computer Science Conference (ITCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0251, pp. 2:1\u20132:9. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2023)"},{"issue":"11","key":"23_CR2","doi-asserted-by":"publisher","first-page":"4895","DOI":"10.1090\/S0002-9947-06-03833-5","volume":"358","author":"R Aharoni","year":"2006","unstructured":"Aharoni, R., Berger, E.: The intersection of a matroid and a simplical complex. Trans. Am. Math. Soc. 358(11), 4895\u20134917 (2006)","journal-title":"Trans. Am. Math. Soc."},{"key":"23_CR3","doi-asserted-by":"publisher","unstructured":"Aharoni, R., Berger, E., Guo, H., Kotlar, D.: Coloring, list coloring, and fractional coloring in intersections of matroids. Combinatorica 45, 46 (2025). https:\/\/doi.org\/10.1007\/s00493-025-00178-8","DOI":"10.1007\/s00493-025-00178-8"},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s00493-007-2086-y","volume":"27","author":"R Aharoni","year":"2007","unstructured":"Aharoni, R., Berger, E., Ziv, R.: Independent systems of representatives in weighted graphs. Combinatorica 27, 253\u2013267 (2007)","journal-title":"Combinatorica"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Annamalai, C.: Finding perfect matchings in bipartite hypergraphs. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1814\u20131823. SODA \u201916, Society for Industrial and Applied Mathematics, USA (2016)","DOI":"10.1137\/1.9781611974331.ch126"},{"issue":"1","key":"23_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-020-01497-y","volume":"188","author":"K B\u00e9rczi","year":"2020","unstructured":"B\u00e9rczi, K., Schwarcz, T.: Complexity of packing common bases in matroids. Math. Program. 188(1), 1\u201318 (2020). https:\/\/doi.org\/10.1007\/s10107-020-01497-y","journal-title":"Math. Program."},{"issue":"10","key":"23_CR7","doi-asserted-by":"publisher","first-page":"4145","DOI":"10.1090\/proc\/17274","volume":"153","author":"E Berger","year":"2025","unstructured":"Berger, E., Guo, H.: Coloring the intersection of two matroids. Proc. Am. Math. Soc. 153(10), 4145\u20134154 (2025). https:\/\/doi.org\/10.1090\/proc\/17274","journal-title":"Proc. Am. Math. Soc."},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Brualdi, R.A.: Induced matroids. In: Proceedings of the American Mathematical Society. vol.\u00a029, pp. 213\u2013221 (1971)","DOI":"10.1090\/S0002-9939-1971-0289335-5"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"B\u00e9rczi, K., Schwarcz, T.: Partitioning into common independent sets via relaxing strongly base orderability. J. Comb. Theory 202(105817) (2024)","DOI":"10.1016\/j.jcta.2023.105817"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"2192","DOI":"10.1137\/20M1385615","volume":"35","author":"K B\u00e9rczi","year":"2021","unstructured":"B\u00e9rczi, K., Schwarcz, T., Yamaguchi, Y.: List coloring of two matroids through reduction to partition matroids. SIAM J. Discret. Math. 35, 2192\u20132209 (2021)","journal-title":"SIAM J. Discret. Math."},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"B\u00e9rczi, K., Cs\u00e1ji, G., Kir\u00e1ly, T.: On the complexity of packing rainbow spanning trees. Discrete Math. 346(113297) (2023)","DOI":"10.1016\/j.disc.2022.113297"},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1112\/jlms\/s2-14.1.55","volume":"14","author":"J Davies","year":"1976","unstructured":"Davies, J., McDiarmid, C.: Disjoint common transversals and exchange structures. J. Lond. Math. Soc. 14, 55\u201362 (1976)","journal-title":"J. Lond. Math. Soc."},{"key":"23_CR13","unstructured":"Edmonds, J.: Matroid partition. In: Mathematics of the Decision Sciences, Part 1, Lectures in Applied Mathematics, vol.\u00a011, pp. 335\u2013345. American Mathematical Society (1968)"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Frank, A.: Connections in combinatorial optimization. Discrete Appl. Math. 160(12), 1875 (2012). https:\/\/doi.org\/10.1016\/j.dam.2011.09.003","DOI":"10.1016\/j.dam.2011.09.003"},{"key":"23_CR15","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1006\/jctb.1995.1011","volume":"63","author":"F Galvin","year":"1995","unstructured":"Galvin, F.: The list chromatic index of a bipartite multigraph. J. Comb. Theory 63, 153\u2013158 (1995)","journal-title":"J. Comb. Theory"},{"key":"23_CR16","unstructured":"Guo, H.: The list chromatic number of the intersection of two generalized partition matroids. arXiV (2024)"},{"issue":"4","key":"23_CR17","doi-asserted-by":"publisher","first-page":"1792","DOI":"10.1137\/100815232","volume":"25","author":"NJA Harvey","year":"2011","unstructured":"Harvey, N.J.A., Kir\u00e1ly, T., Lau, L.C.: On disjoint common bases in two matroids. SIAM J. Discret. Math. 25(4), 1792\u20131803 (2011). https:\/\/doi.org\/10.1137\/100815232","journal-title":"SIAM J. Discret. Math."},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Haxell, P.E.: A condition for matchability in hypergraphs. Graphs Comb. 11(3), 245\u2013248 (1995)","DOI":"10.1007\/BF01793010"},{"issue":"2","key":"23_CR19","doi-asserted-by":"publisher","first-page":"1472","DOI":"10.1137\/22M1516750","volume":"38","author":"F H\u00f6rsch","year":"2024","unstructured":"H\u00f6rsch, F., Kaiser, T., Kriesell, M.: Rainbow bases in matroids. SIAM J. Discret. Math. 38(2), 1472\u20131491 (2024)","journal-title":"SIAM J. Discret. Math."},{"key":"23_CR20","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0012-365X(94)90114-7","volume":"128","author":"R Huang","year":"1994","unstructured":"Huang, R., Rota, G.C.: On the relations of various conjectures on Latin squares and straightening coefficients. Discret. Math. 128, 225\u2013236 (1994)","journal-title":"Discret. Math."},{"key":"23_CR21","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.orl.2020.11.003","volume":"49","author":"S Im","year":"2021","unstructured":"Im, S., Moseley, B., Pruhs, K.: The matroid intersection cover problem. Oper. Res. Lett. 49, 17\u201322 (2021)","journal-title":"Oper. Res. Lett."},{"key":"23_CR22","unstructured":"Kir\u00e1ly, T., Pap, J.: On the list colouring of two matroids. Tech. Rep. EGRES Quick-Proof 2010-01, Egerv\u00e1ry Research Group (EGRES) (2010). https:\/\/egres.elte.hu\/qp\/egresqp-10-01.pdf"},{"key":"23_CR23","doi-asserted-by":"publisher","unstructured":"Leichter, M., Moseley, B., Pruhs, K.: An efficient reduction of a gammoid to a partition matroid. In: 29th Annual European Symposium on Algorithms (ESA 2021). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0204, pp. 62:1\u201362:13. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2021.62","DOI":"10.4230\/LIPIcs.ESA.2021.62"},{"key":"23_CR24","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1016\/j.orl.2022.09.003","volume":"50","author":"M Leichter","year":"2022","unstructured":"Leichter, M., Moseley, B., Pruhs, K.: On the impossibility of decomposing binary matroids. Oper. Res. Lett. 50, 623\u2013625 (2022)","journal-title":"Oper. Res. Lett."},{"key":"23_CR25","doi-asserted-by":"publisher","unstructured":"Obszarski, P., Jastrz\u0229bski, A.: Edge-coloring of 3-uniform hypergraphs. Discrete Appl. Math. 217 (2016). https:\/\/doi.org\/10.1016\/j.dam.2016.06.009","DOI":"10.1016\/j.dam.2016.06.009"},{"key":"23_CR26","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency, Algorithms and Combinatorics, vol.\u00a024. Springer (2003)"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-28691-8_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:33:27Z","timestamp":1781303607000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-28691-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032286901","9783032286918"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-28691-8_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"13 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that\u00a0are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Padua","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/events.math.unipd.it\/ipco2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}