{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T05:52:35Z","timestamp":1740117155840,"version":"3.37.3"},"reference-count":9,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s0020-0190(02)00478-7","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T19:37:33Z","timestamp":1047670653000},"page":"101-106","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"title":["On the complexity of digraph packings"],"prefix":"10.1016","volume":"86","author":[{"given":"Richard C.","family":"Brewster","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Romeo","family":"Rizzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(02)00478-7_BIB001","unstructured":"R.C. Brewster, P. Hell, S.H. Pantel, R. Rizzi, A. Yeo, Packing paths in digraphs, submitted"},{"key":"10.1016\/S0020-0190(02)00478-7_BIB002","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0167-6377(82)90016-5","article-title":"Packing subgraphs in a graph","volume":"1","author":"Cornu\u00e9jols","year":"1982","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0020-0190(02)00478-7_BIB003","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0095-8956(86)90085-7","article-title":"An extension of matching theory","volume":"40","author":"Cornu\u00e9jols","year":"1986","journal-title":"J. Combin. Theory, Ser. B"},{"year":"1979","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","key":"10.1016\/S0020-0190(02)00478-7_BIB004"},{"key":"10.1016\/S0020-0190(02)00478-7_BIB005","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0020-0190(81)90073-9","article-title":"On generalized matching problems","volume":"12","author":"Hell","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(02)00478-7_BIB006","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0012-365X(84)90150-X","article-title":"Packings by cliques and by finite families of graphs","volume":"49","author":"Hell","year":"1984","journal-title":"Discrete Math."},{"key":"10.1016\/S0020-0190(02)00478-7_BIB007","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1137\/0212040","article-title":"On the complexity of general graph factor problems","volume":"12","author":"Kirkpatrick","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(02)00478-7_BIB008","series-title":"Electronic Notes in Discrete Mathematics, Proceedings of the 6th International Conference on Graph Theory, Marseille (France), August 28\u2013September 1","article-title":"Graph packings","author":"Hell","year":"2000"},{"key":"10.1016\/S0020-0190(02)00478-7_BIB009","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1006\/jctb.1993.1058","article-title":"Efficient subgraph packing","volume":"59","author":"Loebl","year":"1993","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:S0020019002004787?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002004787?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,6,15]],"date-time":"2024-06-15T08:28:37Z","timestamp":1718440117000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019002004787"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["S0020019002004787"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(02)00478-7","relation":{},"ISSN":["0020-0190"],"issn-type":[{"type":"print","value":"0020-0190"}],"subject":[],"published":{"date-parts":[[2003,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On the complexity of digraph packings","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0020-0190(02)00478-7","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2003 Elsevier Science B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}