{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T13:43:19Z","timestamp":1773409399172,"version":"3.50.1"},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,8,1]],"date-time":"2003-08-01T00:00:00Z","timestamp":1059696000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[2003,8]]},"DOI":"10.1016\/s0196-6774(03)00052-x","type":"journal-article","created":{"date-parts":[[2003,5,27]],"date-time":"2003-05-27T23:51:31Z","timestamp":1054079491000},"page":"239-256","source":"Crossref","is-referenced-by-count":39,"title":["Packing cycles in undirected graphs"],"prefix":"10.1016","volume":"48","author":[{"given":"Alberto","family":"Caprara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessandro","family":"Panconesi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Romeo","family":"Rizzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0196-6774(03)00052-X_BIB001","series-title":"Combinatorial Optimization Problems and their Approximability Properties","author":"Ausiello","year":"1999"},{"key":"10.1016\/S0196-6774(03)00052-X_BIB002","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1137\/S0097539793250627","article-title":"Genome rearrangements and sorting by reversals","volume":"25","author":"Bafna","year":"1996","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0196-6774(03)00052-X_BIB003","series-title":"Proceedings of the 26th International Colloquium on Automata, Languages and Programming","first-page":"200","article-title":"On some tighter inapproximability results","volume":"1644","author":"Berman","year":"2000"},{"key":"10.1016\/S0196-6774(03)00052-X_BIB004","series-title":"Extremal Graph Theory","author":"Bollob\u00e1s","year":"1978"},{"key":"10.1016\/S0196-6774(03)00052-X_BIB005","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1137\/S089548019731994X","article-title":"Sorting Permutations by reversals and Eulerian cycle decompositions","volume":"12","author":"Caprara","year":"1999","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0196-6774(03)00052-X_BIB006","doi-asserted-by":"crossref","unstructured":"A. Caprara, A. Panconesi, R. Rizzi, Packing cuts in undirected graphs. Research Report OR\/01\/14, DEIS, University of Bologna, 2001, available at http:\/\/www.or.deis.unibo.it\/alberto\/online.htm","DOI":"10.1007\/3-540-44676-1_43"},{"key":"10.1016\/S0196-6774(03)00052-X_BIB007","doi-asserted-by":"crossref","first-page":"3","DOI":"10.5486\/PMD.1962.9.1-2.02","article-title":"On the maximal number of disjoint circuits of a graph","volume":"9","author":"Erd\u0151s","year":"1962","journal-title":"Publ. Math. Debrecen"},{"key":"10.1016\/S0196-6774(03)00052-X_BIB008","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF01202790","article-title":"Conservative weightings and ear-decompositions of graphs","volume":"13","author":"Frank","year":"1993","journal-title":"Combinatorica"},{"key":"10.1016\/S0196-6774(03)00052-X_BIB009","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1137\/0210054","article-title":"The NP-completeness of some edge-partition problems","volume":"10","author":"Holyer","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0196-6774(03)00052-X_BIB010","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/BF01188586","article-title":"Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement","volume":"13","author":"Kececioglu","year":"1995","journal-title":"Algorithmica"},{"key":"10.1016\/S0196-6774(03)00052-X_BIB011","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1137\/0211025","article-title":"Planar formulae and their uses","volume":"11","author":"Lichtenstein","year":"1982","journal-title":"SIAM J. Comput."}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S019667740300052X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S019667740300052X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T09:26:39Z","timestamp":1682501199000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S019667740300052X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,8]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,8]]}},"alternative-id":["S019667740300052X"],"URL":"https:\/\/doi.org\/10.1016\/s0196-6774(03)00052-x","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[2003,8]]}}}