{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:22:10Z","timestamp":1743074530301,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031630200"},{"type":"electronic","value":"9783031630217"}],"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-63021-7_5","type":"book-chapter","created":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T13:02:29Z","timestamp":1718974949000},"page":"55-68","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Maximizing Minimum Cycle Bases Intersection"],"prefix":"10.1007","author":[{"given":"Yl\u00e8ne","family":"Aboulfath","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitri","family":"Watel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc-Antoine","family":"Weisser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thierry","family":"Mautor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominique","family":"Barth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,22]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1021\/acs.jctc.3c01031","volume":"20","author":"Y Aboulfath","year":"2024","unstructured":"Aboulfath, Y., Bougueroua, S., Cimas, A., Barth, D., Gaigeot, M.P.: Time-resolved graphs of polymorphic cycles for h-bonded network identification in flexible biomolecules. J. Chem. Theory Comput. 20, 1019\u20131035 (2024)","journal-title":"J. Chem. Theory Comput."},{"key":"5_CR2","unstructured":"Aboulfath, Y., Watel, D., Weisser, M.A., Mautor, T., Barth, D.: Maximizing Minimum Cycle Bases Intersection (2024). https:\/\/hal.science\/hal-04559959"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-642-04128-0_28","volume-title":"Algorithms - ESA 2009","author":"E Amaldi","year":"2009","unstructured":"Amaldi, E., Iuliano, C., Jurkiewicz, T., Mehlhorn, K., Rizzi, R.: Breaking the O(m2n) barrier for minimum cycle bases. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 301\u2013312. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04128-0_28"},{"issue":"18","key":"5_CR4","doi-asserted-by":"publisher","DOI":"10.1063\/1.5045818","volume":"149","author":"S Bougueroua","year":"2018","unstructured":"Bougueroua, S., et al.: Graph theory for automatic structural recognition in molecular dynamics simulations. J. Chem. Phys. 149(18), 184102 (2018). https:\/\/doi.org\/10.1063\/1.5045818","journal-title":"J. Chem. Phys."},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/3-540-36478-1_2","volume-title":"Combinatorial Optimization \u2014 Eureka, You Shrink!","author":"J Edmonds","year":"2003","unstructured":"Edmonds, J.: Submodular functions, matroids, and certain polyhedra. In: J\u00fcnger, M., Reinelt, G., Rinaldi, G. (eds.) Combinatorial Optimization \u2014 Eureka, You Shrink! LNCS, vol. 2570, pp. 11\u201326. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36478-1_2"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-642-38221-5_12","volume-title":"Graph-Based Representations in Pattern Recognition","author":"B Ga\u00fcz\u00e8re","year":"2013","unstructured":"Ga\u00fcz\u00e8re, B., Brun, L., Villemin, D.: Relevant cycle hypergraph representation for molecules. In: Kropatsch, W.G., Artner, N.M., Haxhimusa, Y., Jiang, X. (eds.) GbRPR 2013. LNCS, vol. 7877, pp. 111\u2013120. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38221-5_12"},{"issue":"02n03","key":"5_CR7","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1142\/s0219525901000140","volume":"4","author":"PM Gleiss","year":"2001","unstructured":"Gleiss, P.M., Stadler, P.F., Wagner, A., Fell, D.A.: Relevant cycles in chemical reaction networks. Adv. Complex Syst. 4(02n03), 207\u2013226 (2001). https:\/\/doi.org\/10.1142\/s0219525901000140","journal-title":"Adv. Complex Syst."},{"issue":"2","key":"5_CR8","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)","journal-title":"SIAM J. Comput."},{"issue":"12","key":"5_CR9","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0226680","volume":"14","author":"SN Ilemo","year":"2019","unstructured":"Ilemo, S.N., Barth, D., David, O., Quessette, F., Weisser, M.A., Watel, D.: Improving graphs of cycles approach to structural similarity of molecules. PLOS ONE 14(12), e0226680 (2019). https:\/\/doi.org\/10.1371\/journal.pone.0226680","journal-title":"PLOS ONE"},{"issue":"4","key":"5_CR10","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.cosrev.2009.08.001","volume":"3","author":"T Kavitha","year":"2009","unstructured":"Kavitha, T., et al.: Cycle bases in graphs characterization, algorithms, complexity, and applications. Comput. Sci. Rev. 3(4), 199\u2013243 (2009). https:\/\/doi.org\/10.1016\/j.cosrev.2009.08.001","journal-title":"Comput. Sci. Rev."},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0167-5060(08)70322-4","volume":"2","author":"B Korte","year":"1978","unstructured":"Korte, B., Hausmann, D.: An analysis of the greedy heuristic for independence systems. Ann. Disc. Math. 2, 65\u201374 (1978)","journal-title":"Ann. Disc. Math."},{"issue":"1","key":"5_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2174\/1874091X01610010001","volume":"10","author":"IV Likhachev","year":"2016","unstructured":"Likhachev, I.V., Balabaev, N., Galzitskaya, O.: Available instruments for analyzing molecular dynamics trajectories. Open Biochem. J. 10(1), 1\u201311 (2016)","journal-title":"Open Biochem. J."},{"issue":"3","key":"5_CR13","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0020-0190(92)90041-s","volume":"41","author":"J Misra","year":"1992","unstructured":"Misra, J., Gries, D.: A constructive proof of Vizing\u2019s theorem. Inf. Process. Lett. 41(3), 131\u2013133 (1992). https:\/\/doi.org\/10.1016\/0020-0190(92)90041-s","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"5_CR14","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0166-218X(92)90041-8","volume":"35","author":"OJ Murphy","year":"1992","unstructured":"Murphy, O.J.: Computing independent sets in graphs with large girth. Disc. Appl. Math. 35(2), 167\u2013170 (1992)","journal-title":"Disc. Appl. Math."},{"key":"5_CR15","doi-asserted-by":"publisher","unstructured":"Vismara, P.: Union of all the minimum cycle bases of a graph. Electron. J. Comb. 4(1), R9 (1997). https:\/\/doi.org\/10.37236\/1294","DOI":"10.37236\/1294"},{"key":"5_CR16","first-page":"131","volume-title":"Matroid Theory","author":"DJA Welsh","year":"1976","unstructured":"Welsh, D.J.A.: Matroid Theory, p. 131. Courier Dover Publications, Mineola (1976)"},{"key":"5_CR17","doi-asserted-by":"publisher","unstructured":"Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. In: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, STOC 2006, pp. 681-690. Association for Computing Machinery, New York (2006). https:\/\/doi.org\/10.1145\/1132516.1132612","DOI":"10.1145\/1132516.1132612"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-63021-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T13:06:51Z","timestamp":1718975211000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-63021-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031630200","9783031630217"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-63021-7_5","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 June 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ischia","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"35","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iwoca2024.di.unisa.it","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}