{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:32:15Z","timestamp":1767339135684,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"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_32","type":"book-chapter","created":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T13:02:29Z","timestamp":1718974949000},"page":"421-432","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Approximate Cycle Double Cover"],"prefix":"10.1007","author":[{"given":"Babak","family":"Ghanbari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"\u0160\u00e1mal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,22]]},"reference":[{"key":"32_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-642-11266-9_27","volume-title":"SOFSEM 2010: Theory and Practice of Computer Science","author":"K Diks","year":"2010","unstructured":"Diks, K., Stanczyk, P.: Perfect matching for biconnected cubic graphs in $$O(n \\log ^{2}n)$$ time. In: van Leeuwen, J., Muscholl, A., Peleg, D., Pokorn\u00fd, J., Rumpe, B. (eds.) SOFSEM 2010. LNCS, vol. 5901, pp. 321\u2013333. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11266-9_27"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"Edmonds, J.: Maximum matching and a polyhedron with 0,1-vertices. J. Res. Natl. Bureau Stand. Sect. B Math. Math. Phys. 125 (1965)","DOI":"10.6028\/jres.069B.013"},{"key":"32_CR3","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0095-8956(89)90048-8","volume":"46","author":"LA Goddyn","year":"1989","unstructured":"Goddyn, L.A.: Cycle double covers of graphs with Hamilton paths. J. Combin. Theory Ser. B 46, 253\u2013254 (1989)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"2","key":"32_CR4","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/j.jctb.2004.11.003","volume":"93","author":"R H\u00e4ggkvist","year":"2005","unstructured":"H\u00e4ggkvist, R., McGuinness, S.: Double covers of cubic graphs with oddness 4. J. Combin. Theory Ser. B 93(2), 251\u2013277 (2005)","journal-title":"J. Combin. Theory Ser. B"},{"key":"32_CR5","series-title":"Algorithms and Combinatorics","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/3-540-33700-8_14","volume-title":"Topics in Discrete Mathematics","author":"T Kaiser","year":"2006","unstructured":"Kaiser, T., Kr\u00e1l\u2019, D., Norine, S.: Unions of perfect matchings in cubic graphs. In: Klazar, M., Kratochv\u00edl, J., Loebl, M., Matou\u0161ek, J., Valtr, P., Thomas, R. (eds.) Topics in Discrete Mathematics. Algorithms and Combinatorics, vol. 26, pp. 225\u2013230. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-33700-8_14"},{"key":"32_CR6","unstructured":"Mohar, B., Thomassen, C.: Graphs on Surfaces. Johns Hopkins Series in the Mathematical Sciences. Johns Hopkins University Press (2001)"},{"issue":"1","key":"32_CR7","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1112\/jlms\/s1-36.1.445","volume":"1","author":"CSJA Nash-Williams","year":"1961","unstructured":"Nash-Williams, C.S.J.A.: Edge-disjoint spanning trees of finite graphs. J. Lond. Math. Soc. 1(1), 445\u2013450 (1961)","journal-title":"J. Lond. Math. Soc."},{"key":"32_CR8","unstructured":"Schrijver, A.: Combinatorial Optimization. Polyhedra and Efficiency. Algorithms and Combinatorics. Springer, Berlin (2003)"},{"key":"32_CR9","first-page":"341","volume":"1","author":"PD Seymour","year":"1979","unstructured":"Seymour, P.D.: Sums of circuits. Graph Theory Relat. Top. 1, 341\u2013355 (1979)","journal-title":"Graph Theory Relat. Top."},{"issue":"3","key":"32_CR10","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1017\/S0004972700042660","volume":"8","author":"G Szekeres","year":"1973","unstructured":"Szekeres, G.: Polyhedral decompositions of cubic graphs. Bull. Aust. Math. Soc. 8(3), 367\u2013387 (1973)","journal-title":"Bull. Aust. Math. Soc."},{"issue":"3","key":"32_CR11","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1016\/0095-8956(86)90054-7","volume":"41","author":"M Tarsi","year":"1986","unstructured":"Tarsi, M.: Semiduality and the cycle double cover conjecture. J. Combin. Theory Ser. B 41(3), 332\u2013340 (1986)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"32_CR12","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1112\/jlms\/s1-36.1.221","volume":"1","author":"WT Tutte","year":"1961","unstructured":"Tutte, W.T.: On the problem of decomposing a graph into n connected factors. J. Lond. Math. Soc. 1(1), 221\u2013230 (1961)","journal-title":"J. Lond. Math. Soc."},{"key":"32_CR13","unstructured":"Zhang, C.-Q.: Circuit Double Cover. London Mathematical Society Lecture Note Series. Cambridge University Press, Cambridge (2012)"}],"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_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T13:17:16Z","timestamp":1718975836000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-63021-7_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031630200","9783031630217"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-63021-7_32","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"}}]}}