{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T13:51:33Z","timestamp":1781531493448,"version":"3.54.5"},"reference-count":17,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":5676,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[1998,1]]},"DOI":"10.1016\/s0925-7721(97)00014-x","type":"journal-article","created":{"date-parts":[[2003,4,24]],"date-time":"2003-04-24T22:53:11Z","timestamp":1051224791000},"page":"3-24","source":"Crossref","is-referenced-by-count":204,"title":["Unit disk graph recognition is NP-hard"],"prefix":"10.1016","volume":"9","author":[{"given":"Heinz","family":"Breu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David G.","family":"Kirkpatrick","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0925-7721(97)00014-X_BIB1","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","article-title":"Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms","volume":"13","author":"Booth","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0925-7721(97)00014-X_BIB2","series-title":"Proc. Graph Drawing '95","first-page":"88","article-title":"On the complexity of recognizing intersection and touching graphs of disks","volume":"1027","author":"Breu","year":"1996"},{"issue":"1\/3","key":"10.1016\/S0925-7721(97)00014-X_BIB3","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","article-title":"Unit disk graphs","volume":"86","author":"Clark","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/S0925-7721(97)00014-X_BIB4","series-title":"Proceedings of the Third Annual Symposium on Theory of Computing","first-page":"151","article-title":"The complexity of theorem-proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/S0925-7721(97)00014-X_BIB5","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0095-8956(83)90057-6","article-title":"On the sphericity and cubicity of graphs","volume":"35","author":"Fishburn","year":"1983","journal-title":"J. Combin. Theory Ser. B"},{"issue":"3","key":"10.1016\/S0925-7721(97)00014-X_BIB6","doi-asserted-by":"crossref","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","article-title":"Incidence matrices and interval graphs","volume":"15","author":"Fulkerson","year":"1965","journal-title":"Pacific J. Math."},{"key":"10.1016\/S0925-7721(97)00014-X_BIB7","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0925-7721(97)00014-X_BIB8","first-page":"1497","article-title":"Frequency assignment: theory and applications","volume":"68","author":"Hale","year":"1980"},{"key":"10.1016\/S0925-7721(97)00014-X_BIB9","article-title":"The combinatorial distance geometry approach to the calculation of molecular conformation","author":"Havel","year":"1982"},{"key":"10.1016\/S0925-7721(97)00014-X_BIB10","first-page":"361","article-title":"The combinatorial distance geometry approach to the calculation of molecular conformation","volume":"35","author":"Havel","year":"1982"},{"issue":"4","key":"10.1016\/S0925-7721(97)00014-X_BIB11","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0022-5193(83)90112-1","article-title":"The combinatorial distance geometry method for the calculation of molecular conformation, I. A new approach to an old problem","volume":"35","author":"Havel","year":"1983","journal-title":"J. Theor. Biol."},{"issue":"3","key":"10.1016\/S0925-7721(97)00014-X_BIB12","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/opre.39.3.378","article-title":"Optimization by simulated annealing: an experimental evaluation. Part II. Graph coloring and number partioning","volume":"39","author":"Johnson","year":"1991","journal-title":"Oper. Res."},{"key":"10.1016\/S0925-7721(97)00014-X_BIB13","unstructured":"J. Kratochvil, Personal communication, February 1995."},{"key":"10.1016\/S0925-7721(97)00014-X_BIB14","series-title":"Fourth Canadian Conference on Computational Geometry","first-page":"244","article-title":"Geometry based approximations for intersection graphs","author":"Marathe","year":"1992"},{"key":"10.1016\/S0925-7721(97)00014-X_BIB15","series-title":"Proof Techniques in Graph Theory","first-page":"139","article-title":"Indifference graphs","author":"Roberts","year":"1968"},{"key":"10.1016\/S0925-7721(97)00014-X_BIB16","article-title":"Quo vadis, graph theory","author":"Roberts","year":"1991"},{"key":"10.1016\/S0925-7721(97)00014-X_BIB17","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0012-365X(93)E0068-F","article-title":"Coin graphs, polyhedra, and conformal mapping","volume":"134","author":"Sachs","year":"1994","journal-title":"Discrete Math."}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S092577219700014X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S092577219700014X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T03:25:33Z","timestamp":1555212333000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S092577219700014X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":17,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["S092577219700014X"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(97)00014-x","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}