{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T06:37:32Z","timestamp":1774334252511,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":23,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819571260","type":"print"},{"value":"9789819571277","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-981-95-7127-7_38","type":"book-chapter","created":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T10:07:09Z","timestamp":1770977229000},"page":"576-590","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Enumeration of\u00a0Bases in\u00a0Matroid with\u00a0Exponentially Large Ground Set"],"prefix":"10.1007","author":[{"given":"Yuki","family":"Nishimura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuya","family":"Haraguchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,14]]},"reference":[{"issue":"1","key":"38_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0166-218X(95)00026-N","volume":"65","author":"D Avis","year":"1996","unstructured":"Avis, D., Fukuda, K.: Reverse search for enumeration. Discret. Appl. Math. 65(1), 21\u201346 (1996). https:\/\/doi.org\/10.1016\/0166-218X(95)00026-N","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"38_CR2","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s00453-004-1098-x","volume":"40","author":"F Berger","year":"2004","unstructured":"Berger, F., Gritzmann, P., de Vries, S.: Minimum cycle bases for network graphs. Algorithmica 40(1), 51\u201362 (2004). https:\/\/doi.org\/10.1007\/s00453-004-1098-x","journal-title":"Algorithmica"},{"key":"38_CR3","doi-asserted-by":"publisher","unstructured":"Cao, Y.: Enumerating maximal induced subgraphs. In: G\u00f8rtz, I.L., Farach-Colton, M., Puglisi, S.J., Herman, G. (eds.) 31st Annual European Symposium on Algorithms (ESA 2023). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0274, pp. 31:1\u201331:13. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2023). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2023.31","DOI":"10.4230\/LIPIcs.ESA.2023.31"},{"key":"38_CR4","doi-asserted-by":"publisher","unstructured":"Diestel, R.: Graph theory. Springer Berlin Heidelberg, Berlin, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-53622-3_1","DOI":"10.1007\/978-3-662-53622-3_1"},{"key":"38_CR5","doi-asserted-by":"publisher","unstructured":"Domschke, N., Gatter, T., Stadler, P.F.: A short note on relevant cuts. The Art of Discrete and Applied Mathematics (2025). https:\/\/doi.org\/10.26493\/2590-9770.1845.02e, the preprint is available at arXiv: 2410.20257","DOI":"10.26493\/2590-9770.1845.02e"},{"key":"38_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-45471-3_21","volume-title":"Algorithm Theory \u2014 SWAT 2002","author":"A Golynski","year":"2002","unstructured":"Golynski, A., Horton, J.D.: A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid. In: Penttonen, M., Schmidt, E.M. (eds.) SWAT 2002. LNCS, vol. 2368, pp. 200\u2013209. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45471-3_21"},{"issue":"4","key":"38_CR7","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1137\/0109047","volume":"9","author":"RE Gomory","year":"1961","unstructured":"Gomory, R.E., Hu, T.C.: Multi-terminal network flows. J. Soc. Ind. Appl. Math. 9(4), 551\u2013570 (1961)","journal-title":"J. Soc. Ind. Appl. Math."},{"issue":"1","key":"38_CR8","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF02022039","volume":"4","author":"HW Hamacher","year":"1985","unstructured":"Hamacher, H.W., Queyranne, M.: K best solutions to combinatorial optimization problems. Ann. Oper. Res. 4(1), 123\u2013143 (1985). https:\/\/doi.org\/10.1007\/BF02022039","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"38_CR9","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1137\/0216026","volume":"16","author":"JD Horton","year":"1987","unstructured":"Horton, J.D.: A polynomial-time algorithm to find the shortest cycle basis of a graph. SIAM J. Comput. 16(2), 358\u2013366 (1987). https:\/\/doi.org\/10.1137\/0216026","journal-title":"SIAM J. Comput."},{"issue":"3","key":"38_CR10","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"DS Johnson","year":"1988","unstructured":"Johnson, D.S., Yannakakis, M., Papadimitriou, C.H.: On generating all maximal independent sets. Inf. Process. Lett. 27(3), 119\u2013123 (1988). https:\/\/doi.org\/10.1016\/0020-0190(88)90065-8","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"38_CR11","doi-asserted-by":"publisher","first-page":"966","DOI":"10.1137\/S0895480103428338","volume":"19","author":"L Khachiyan","year":"2005","unstructured":"Khachiyan, L., Boros, E., Elbassioni, K., Gurvich, V., Makino, K.: On the complexity of some enumeration problems for matroids. SIAM J. Discret. Math. 19(4), 966\u2013984 (2005). https:\/\/doi.org\/10.1137\/S0895480103428338","journal-title":"SIAM J. Discret. Math."},{"issue":"3","key":"38_CR12","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1006\/jagm.1994.1044","volume":"17","author":"V King","year":"1994","unstructured":"King, V., Rao, S., Tarjan, R.: A faster deterministic maximum flow algorithm. J. Algorithms 17(3), 447\u2013474 (1994). https:\/\/doi.org\/10.1006\/jagm.1994.1044","journal-title":"J. Algorithms"},{"key":"38_CR13","doi-asserted-by":"publisher","unstructured":"Kobayashi, Y., Kurita, K., Wasa, K.: Polynomial-delay enumeration of large maximal common independent sets in two matroids and beyond. Inf. Comput. 304, 105282 (2025). https:\/\/doi.org\/10.1016\/j.ic.2025.105282","DOI":"10.1016\/j.ic.2025.105282"},{"key":"38_CR14","doi-asserted-by":"crossref","unstructured":"Korte, B., Vygen, J.: Combinatorial optimization: theory and algorithms. Springer, sixth edn. (2018)","DOI":"10.1007\/978-3-662-56039-6"},{"key":"38_CR15","doi-asserted-by":"publisher","unstructured":"Madan, V., Nikolov, A., Singh, M., Tantipongpipat, U.: Maximizing determinants under matroid constraints. In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pp. 565\u2013576 (2020).https:\/\/doi.org\/10.1109\/FOCS46700.2020.00059","DOI":"10.1109\/FOCS46700.2020.00059"},{"key":"38_CR16","doi-asserted-by":"publisher","unstructured":"Mary, A., Strozecki, Y.: Efficient enumeration of solutions produced by closure operations. Discrete Math. Theor. Comput. Sci. 21(3), 22 (2019). https:\/\/doi.org\/10.23638\/DMTCS-21-3-22","DOI":"10.23638\/DMTCS-21-3-22"},{"key":"38_CR17","doi-asserted-by":"publisher","unstructured":"Mehlhorn, K., Michail, D.: Minimum cycle bases: faster and simpler 6(1) (2010). https:\/\/doi.org\/10.1145\/1644015.1644023","DOI":"10.1145\/1644015.1644023"},{"key":"38_CR18","unstructured":"Nishimura, Y., Haraguchi, K.: Enumeration of bases in matroid with exponentially large ground set (2025). https:\/\/arxiv.org\/abs\/2504.11728"},{"key":"38_CR19","doi-asserted-by":"publisher","unstructured":"Orlin, J.B.: Max flows in $$O(nm)$$ time, or better. In: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, pp. 765\u2013774. STOC \u201913, Association for Computing Machinery, New York, NY, USA (2013). https:\/\/doi.org\/10.1145\/2488608.2488705","DOI":"10.1145\/2488608.2488705"},{"key":"38_CR20","doi-asserted-by":"crossref","unstructured":"Oxley, J.: Matroid theory. oxford university press, 2nd edn. (2011)","DOI":"10.1093\/acprof:oso\/9780198566946.001.0001"},{"key":"38_CR21","doi-asserted-by":"publisher","unstructured":"Vasiliauskaite, V., Evans, T.S., Expert, P.: Cycle analysis of directed acyclic graphs. Physica A: Stat. Mech. Appl. 596, 127097 (2022). https:\/\/doi.org\/10.1016\/j.physa.2022.127097","DOI":"10.1016\/j.physa.2022.127097"},{"issue":"1","key":"38_CR22","doi-asserted-by":"publisher","first-page":"R9","DOI":"10.37236\/1294","volume":"4","author":"P Vismara","year":"1997","unstructured":"Vismara, P.: Union of all the minimum cycle bases of a graph. Electron. J. Comb. 4(1), R9 (1997)","journal-title":"Electron. J. Comb."},{"issue":"3","key":"38_CR23","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s00453-009-9284-5","volume":"56","author":"LP Yeh","year":"2010","unstructured":"Yeh, L.P., Wang, B.F., Su, H.H.: Efficient algorithms for the problems of enumerating cuts by non-decreasing weights. Algorithmica 56(3), 297\u2013312 (2010). https:\/\/doi.org\/10.1007\/s00453-009-9284-5","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-7127-7_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T04:14:59Z","timestamp":1774325699000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-7127-7_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819571260","9789819571277"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-7127-7_38","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":"14 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Perugia","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":"4 March 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 March 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/mozart.diei.unipg.it\/walcom2026","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}