{"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":1774690057702,"version":"3.50.1"},"reference-count":20,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1990,12,1]],"date-time":"1990-12-01T00:00:00Z","timestamp":660009600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8264,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1990,12]]},"DOI":"10.1016\/0012-365x(90)90358-o","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:43Z","timestamp":1027640623000},"page":"165-177","source":"Crossref","is-referenced-by-count":1054,"title":["Unit disk graphs"],"prefix":"10.1016","volume":"86","author":[{"given":"Brent N.","family":"Clark","sequence":"first","affiliation":[]},{"given":"Charles J.","family":"Colbourn","sequence":"additional","affiliation":[]},{"given":"David S.","family":"Johnson","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(90)90358-O_BIB1","series-title":"M. Math. Thesis","article-title":"Unit disk graphs","author":"Clark","year":"1985"},{"key":"10.1016\/0012-365X(90)90358-O_BIB2","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","article-title":"Theoretical improvements in algorithmic efficiency for network flow problems","volume":"19","author":"Edmonds","year":"1972","journal-title":"J. ACM"},{"key":"10.1016\/0012-365X(90)90358-O_BIB3","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\/0012-365X(90)90358-O_BIB4","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1137\/0132071","article-title":"The rectilinear Steiner tree problem is NP-complete","volume":"32","author":"Garey","year":"1977","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0012-365X(90)90358-O_BIB5","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0012-365X(90)90358-O_BIB6","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0012-365X(90)90358-O_BIB7","doi-asserted-by":"crossref","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","article-title":"Frequency assignment: Theory and applications","volume":"68","author":"Hale","year":"1980","journal-title":"Proc IEEE"},{"key":"10.1016\/0012-365X(90)90358-O_BIB8","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1137\/0211056","article-title":"Hamilton paths in grid graphs","volume":"11","author":"Itai","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0012-365X(90)90358-O_BIB9","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/0196-6774(82)90018-9","article-title":"The NP-completeness column: An ongoing guide","volume":"3","author":"Johnson","year":"1982","journal-title":"J. Algorithms"},{"key":"10.1016\/0012-365X(90)90358-O_BIB10","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1016\/0196-6774(85)90012-4","article-title":"The NP-completeness column: An ongoing guide","volume":"6","author":"Johnson","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/0012-365X(90)90358-O_BIB11","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1016\/0196-6774(87)90021-6","article-title":"The NP-completeness column: An ongoing guide","volume":"8","author":"Johnson","year":"1987","journal-title":"J. Algorithms"},{"key":"10.1016\/0012-365X(90)90358-O_BIB12","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1109\/JSAC.1984.1146097","article-title":"C 900 \u2014 An advanced mobile radio telephone system with optimum frequency utilization","volume":"2","author":"Kammerlander","year":"1984","journal-title":"IEEE Trans. Selected Areas in Communication"},{"key":"10.1016\/0012-365X(90)90358-O_BIB13","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0012-365X(90)90358-O_BIB14","unstructured":"J. Kilian, personal communication."},{"key":"10.1016\/0012-365X(90)90358-O_BIB15","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\/0012-365X(90)90358-O_BIB16","first-page":"57","article-title":"The computational complexity of the M-center problems in the plane","volume":"E64","author":"Masuyama","year":"1981","journal-title":"Trans. IECE Japan"},{"key":"10.1016\/0012-365X(90)90358-O_BIB17","series-title":"Graphs and Order","first-page":"41","article-title":"Algorithmic aspects of comparability graphs and interval graphs","author":"Mohring","year":"1985"},{"key":"10.1016\/0012-365X(90)90358-O_BIB18","doi-asserted-by":"crossref","first-page":"1363","DOI":"10.1287\/opre.19.6.1363","article-title":"The location of emergency service facilities","volume":"19","author":"Toregas","year":"1971","journal-title":"Oper. Res."},{"key":"10.1016\/0012-365X(90)90358-O_BIB19","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1109\/TC.1981.6312176","article-title":"Universality considerations in VLSI circuits","volume":"30","author":"Valiant","year":"1981","journal-title":"IEEE Trans. Computers"},{"key":"10.1016\/0012-365X(90)90358-O_BIB20","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1109\/JSAC.1984.1146082","article-title":"Outage probability in mobile telephony with directive antennas and macrodiversity","volume":"2","author":"Yeh","year":"1984","journal-title":"IEEE Trans. Selected Areas in Communication"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9090358O?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9090358O?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:56:07Z","timestamp":1555120567000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9090358O"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,12]]},"references-count":20,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1990,12]]}},"alternative-id":["0012365X9090358O"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(90)90358-o","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,12]]}}}