{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T12:05:42Z","timestamp":1784894742529,"version":"3.55.0"},"reference-count":12,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[2002,11]]},"DOI":"10.1016\/s0020-0190(02)00274-0","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T20:29:59Z","timestamp":1034281799000},"page":"175-180","source":"Crossref","is-referenced-by-count":32,"title":["Packing triangles in bounded degree graphs"],"prefix":"10.1016","volume":"84","author":[{"given":"Alberto","family":"Caprara","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Romeo","family":"Rizzi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(02)00274-0_BIB001","series-title":"Combinatorial Optimization Problems and Their Approximability Properties","author":"Ausiello","year":"1999"},{"key":"10.1016\/S0020-0190(02)00274-0_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\/S0020-0190(02)00274-0_BIB003","series-title":"On some tighter inapproximability results, ECCC Report No. 29","author":"Berman","year":"1998"},{"key":"10.1016\/S0020-0190(02)00274-0_BIB004","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1145\/174644.174650","article-title":"Approximation algorithms for NP-complete problems on planar graphs","volume":"41","author":"Baker","year":"1994","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(02)00274-0_BIB005","unstructured":"B.S. Baker, Personal communication, 2001"},{"key":"10.1016\/S0020-0190(02)00274-0_BIB006","series-title":"Packing cycles in undirected graphs, Working Paper","author":"Caprara","year":"2001"},{"key":"10.1016\/S0020-0190(02)00274-0_BIB007","series-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0020-0190(02)00274-0_BIB008","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\/S0020-0190(02)00274-0_BIB009","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1137\/0402008","article-title":"On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems","volume":"2","author":"Hurkens","year":"1989","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0020-0190(02)00274-0_BIB010","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0020-0190(91)90246-E","article-title":"Maximum bounded 3-dimensional matching is MAX SNP-complete","volume":"37","author":"Kann","year":"1991","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(02)00274-0_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."},{"key":"10.1016\/S0020-0190(02)00274-0_BIB012","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/0095-8956(80)90074-X","article-title":"On maximal independent sets of vertices in claw-free graphs","volume":"28","author":"Minty","year":"1980","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002002740?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002002740?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T21:54:41Z","timestamp":1555106081000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019002002740"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2002,11]]}},"alternative-id":["S0020019002002740"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(02)00274-0","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,11]]}}}