{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:24:23Z","timestamp":1743107063094,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642292095"},{"type":"electronic","value":"9783642292101"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-29210-1_9","type":"book-chapter","created":{"date-parts":[[2012,6,6]],"date-time":"2012-06-06T14:47:55Z","timestamp":1338994075000},"page":"53-58","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Packing Euler graphs with traces"],"prefix":"10.1007","author":[{"given":"Peter","family":"Recht","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eva-Maria","family":"Sprengel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,4,14]]},"reference":[{"issue":"1","key":"9_CR1","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF02564555","volume":"27","author":"F Baebler","year":"1953","unstructured":"Baebler, F.: \u00dcber eine spezielle Klasse Euler\u2019scher Graphen, Comment. Math. Helv., vol 27(1), 81-100 (1953)","journal-title":"Comment. Math. Helv."},{"issue":"2","key":"9_CR2","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1137\/S0097539793250627","volume":"25","author":"V Bafna","year":"1996","unstructured":"Bafna, V., Pevzner, P.A. : Genome Rearrangement and sorting by reversals, SIAM Journal on Computing Vol 25 (2) 272-289 (1996)","journal-title":"SIAM Journal on Computing Vol"},{"issue":"1","key":"9_CR3","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1137\/S089548019731994X","volume":"12","author":"A Caprara","year":"1999","unstructured":"Caprara, A.: Sorting Permutations by Reversals and Eulerian Cycle Decompositions, SIAM Journal on Discrete Mathematics 12 (1) 91 - 110 (1999)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"1","key":"9_CR4","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0196-6774(03)00052-X","volume":"48","author":"A Caprara","year":"2003","unstructured":"Caprara, A., Panconesi, A., Rizzi, R.: Packing Cycles in Undirected Graphs, Journal of Algorithms 48 (1) 239 - 256 (2003)","journal-title":"Journal of Algorithms"},{"key":"9_CR5","volume-title":"Vialette","author":"G Fertin","year":"2009","unstructured":"Fertin, G., Labarre, A., Rusu, I., Tannier, E., Vialette, S.: Combinatorics of Genome Rearrangement, MIT Press, Cambridge, Ma. (2009)"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"1974","DOI":"10.1016\/j.disc.2010.03.009","volume":"310","author":"J Harant","year":"2010","unstructured":"Harant, J., Rautenbach, D., Recht, P., Schiermeyer, I., Sprengel, E.M.: Packing disjoint cycles over vertex cuts, Discrete Mathematics 310 1974-1978( 2010)","journal-title":"Discrete Mathematics"},{"key":"9_CR7","first-page":"180","volume":"13","author":"J Kececioglu","year":"1997","unstructured":"Kececioglu, J., Sankoff, D.: Exact and Approximation Algorithms for Sorting by Reversals with Application to genome rearrangement Algorithmica 13 180 - 210 (1997)","journal-title":"Exact and Approximation Algorithms for Sorting by Reversals with Application to genome rearrangement Algorithmica"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Krivelevich, M., Nutov, Z., Salvatpour, M.R., Yuster, J., Yuster, R.: Approximation algorithms and hardness results for cycle packing problems, ACM Trans. Algorithm 3 Article No. 48 (2007)","DOI":"10.1145\/1290672.1290685"},{"key":"9_CR9","first-page":"49","volume":"6","author":"O Ore","year":"1951","unstructured":"Ore, O.: A problem regarding the tracing of graphs, Elem. Math. 6, 49-53 (1951)","journal-title":"Elem. Math."}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2011"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29210-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,11]],"date-time":"2023-02-11T21:52:47Z","timestamp":1676152367000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-29210-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642292095","9783642292101"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29210-1_9","relation":{},"ISSN":["0721-5924"],"issn-type":[{"type":"print","value":"0721-5924"}],"subject":[],"published":{"date-parts":[[2012]]},"assertion":[{"value":"14 April 2012","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}