{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T09:27:37Z","timestamp":1774690057697,"version":"3.50.1"},"reference-count":12,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1983,12,1]],"date-time":"1983-12-01T00:00:00Z","timestamp":439084800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1983,12,1]],"date-time":"1983-12-01T00:00:00Z","timestamp":439084800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/501100001700","name":"Ministry of Education, Culture, Sports, Science and Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001700","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[1983,12]]},"DOI":"10.1016\/0196-6774(83)90012-3","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T03:44:36Z","timestamp":1108007076000},"page":"310-323","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":148,"title":["Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane"],"prefix":"10.1016","volume":"4","author":[{"given":"Hiroshi","family":"Imai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takao","family":"Asano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(83)90012-3_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0196-6774(83)90012-3_BIB2","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0020-0190(81)90111-3","article-title":"Optimal packing and covering in the plane are NP-complete","volume":"12","author":"Fowler","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0196-6774(83)90012-3_BIB3","series-title":"Proceedings of the 11th Annual ACM Symposium on Theory of Computing","first-page":"13","article-title":"Network flow and generalized path compression","author":"Galil","year":"1979"},{"key":"10.1016\/0196-6774(83)90012-3_BIB4","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","article-title":"Some simplified NP-complete graph problems","volume":"1","author":"Garey","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0196-6774(83)90012-3_BIB5","series-title":"Proceedings of the 11th Conference on Information Sciences and Systems","first-page":"91","article-title":"Some NP-complete problems on graphs","author":"Gavril","year":"1977"},{"key":"10.1016\/0196-6774(83)90012-3_BIB6","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0196-6774(83)90012-3_BIB7","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0020-0190(82)90044-8","article-title":"Finding connected components of an intersection graph of squares in the Euclidean plane","volume":"15","author":"Imai","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0196-6774(83)90012-3_BIB8","series-title":"Recent Progress in Combinatorics","first-page":"301","article-title":"On the boxicity and cubicity of a graph","author":"Roberts","year":"1969"},{"key":"10.1016\/0196-6774(83)90012-3_BIB9","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1145\/322261.322267","article-title":"Connected component labeling using quadtrees","volume":"28","author":"Samet","year":"1981","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0196-6774(83)90012-3_BIB10","series-title":"Proceedings of the 16th Annual IEEE Symposium on Foundations of Computer Science","first-page":"151","article-title":"Closest-point problems","author":"Shamos","year":"1975"},{"key":"10.1016\/0196-6774(83)90012-3_BIB11","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1145\/321879.321884","article-title":"Efficiency of a good but not linear set union algorithm","volume":"22","author":"Tarjan","year":"1975","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0196-6774(83)90012-3_BIB12","article-title":"Eigenschaften der nerven homologisch-einfacher Familien in Rn","author":"Wegner","year":"1967","journal-title":"Doctorial dissertation"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677483900123?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677483900123?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T00:13:32Z","timestamp":1757463212000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677483900123"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,12]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1983,12]]}},"alternative-id":["0196677483900123"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(83)90012-3","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1983,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane","name":"articletitle","label":"Article Title"},{"value":"Journal of Algorithms","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0196-6774(83)90012-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1983 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}