{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T13:13:16Z","timestamp":1760015596698,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031609237"},{"type":"electronic","value":"9783031609244"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-60924-4_15","type":"book-chapter","created":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T03:38:27Z","timestamp":1716349107000},"page":"192-204","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Total Matching and\u00a0Subdeterminants"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8903-2871","authenticated-orcid":false,"given":"Luca","family":"Ferrarini","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6845-9008","authenticated-orcid":false,"given":"Samuel","family":"Fiorini","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2610-1494","authenticated-orcid":false,"given":"Stefan","family":"Kober","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6467-3437","authenticated-orcid":false,"given":"Yelena","family":"Yuditsky","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,22]]},"reference":[{"issue":"2","key":"15_CR1","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1002\/jgt.3190010209","volume":"1","author":"Y Alavi","year":"1977","unstructured":"Alavi, Y., Behzad, M., Lesniak-Foster, L.M., Nordhaus, E.: Total matchings and total coverings of graphs. J. Graph Theory 1(2), 135\u2013140 (1977)","journal-title":"J. Graph Theory"},{"issue":"5","key":"15_CR2","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1016\/j.orl.2016.07.004","volume":"44","author":"S Artmann","year":"2016","unstructured":"Artmann, S., Eisenbrand, F., Glanzer, C., Oertel, T., Vempala, S., Weismantel, R.: A note on non-degenerate integer programs with small sub-determinants. Oper. Res. Lett. 44(5), 635\u2013639 (2016)","journal-title":"Oper. Res. Lett."},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Artmann, S., Weismantel, R., Zenklusen, R.: A strongly polynomial algorithm for bimodular integer linear programming. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, pp. 1206\u20131219. Association for Computing Machinery (2017)","DOI":"10.1145\/3055399.3055473"},{"issue":"1","key":"15_CR4","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.ejor.2022.02.025","volume":"303","author":"L Ferrarini","year":"2022","unstructured":"Ferrarini, L., Gualandi, S.: Total coloring and total matching: polyhedra and facets. Eur. J. Oper. Res. 303(1), 129\u2013142 (2022)","journal-title":"Eur. J. Oper. Res."},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Fiorini, S., Joret, G., Weltge, S., Yuditsky, Y.: Integer programs with bounded subdeterminants and two nonzeros per row. In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), pp. 13\u201324 (2022)","DOI":"10.1109\/FOCS52979.2021.00011"},{"issue":"2","key":"15_CR6","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/s10013-021-00520-9","volume":"50","author":"C Glanzer","year":"2022","unstructured":"Glanzer, C., Stallknecht, I., Weismantel, R.: Notes on $$\\{$$a, b, c$$\\}$$-modular matrices. Vietnam J. Math. 50(2), 469\u2013485 (2022)","journal-title":"Vietnam J. Math."},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Gribanov, D., Shumilov, I., Malyshev, D., Pardalos, P.: On $$\\Delta $$-modular integer linear problems in the canonical form and equivalent problems. J. Glob. Optim. 1\u201361 (2022)","DOI":"10.1007\/s10898-022-01165-9"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"1169","DOI":"10.1007\/s11590-015-0943-y","volume":"10","author":"DV Gribanov","year":"2016","unstructured":"Gribanov, D.V., Veselov, S.I.: On integer programming with bounded determinants. Optim. Lett. 10, 1169\u20131177 (2016)","journal-title":"Optim. Lett."},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Kawarabayashi, K.I., Reed, B.: Odd cycle packing. In: Proceedings of the Forty-Second ACM Symposium on Theory of Computing, pp. 695\u2013704 (2010)","DOI":"10.1145\/1806689.1806785"},{"key":"15_CR10","unstructured":"Leidner, M.E.: A study of the total coloring of graphs. Ph.D. thesis, University of Louisville (2012)"},{"issue":"1\u20133","key":"15_CR11","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0166-218X(98)00147-4","volume":"91","author":"DF Manlove","year":"1999","unstructured":"Manlove, D.F.: On the algorithmic complexity of twelve covering and independence parameters of graphs. Disc. Appl. Math. 91(1\u20133), 155\u2013175 (1999)","journal-title":"Disc. Appl. Math."},{"key":"15_CR12","doi-asserted-by":"publisher","unstructured":"N\u00e4gele, M., N\u00f6bel, C., Santiago, R., Zenklusen, R.: Advances on strictly $$\\Delta $$-modular IPs. In: International Conference on Integer Programming and Combinatorial Optimization, pp. 393\u2013407. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-32726-1_28","DOI":"10.1007\/978-3-031-32726-1_28"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"N\u00e4gele, M., Santiago, R., Zenklusen, R.: Congruency-constrained TU problems beyond the bimodular case. In: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2743\u20132790. SIAM (2022)","DOI":"10.1137\/1.9781611977073.108"},{"issue":"6","key":"15_CR14","doi-asserted-by":"publisher","first-page":"1351","DOI":"10.1007\/s00493-019-3900-1","volume":"39","author":"M N\u00e4gele","year":"2019","unstructured":"N\u00e4gele, M., Sudakov, B., Zenklusen, R.: Submodular minimization under congruency constraints. Combinatorica 39(6), 1351\u20131386 (2019)","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-60924-4_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T03:39:17Z","timestamp":1716349157000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-60924-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031609237","9783031609244"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-60924-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"22 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"La Laguna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isco2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}