{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:50:54Z","timestamp":1759063854666},"reference-count":12,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Comput. Geom. Appl."],"published-print":{"date-parts":[[2016,3]]},"abstract":"<jats:p>Given a 3-SAT formula, a graph can be constructed in polynomial time such that the graph is a point visibility graph if and only if the 3-SAT formula is satisfiable. This reduction establishes that the problem of recognition of point visibility graphs is NP-hard.<\/jats:p>","DOI":"10.1142\/s0218195916500011","type":"journal-article","created":{"date-parts":[[2016,5,3]],"date-time":"2016-05-03T05:59:38Z","timestamp":1462255178000},"page":"1-32","source":"Crossref","is-referenced-by-count":4,"title":["Point Visibility Graph Recognition is NP-Hard"],"prefix":"10.1142","volume":"26","author":[{"given":"Bodhayan","family":"Roy","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, Indian Institute of Technology Bombay, Powai, Mumbai 400 076, Maharashtra, India"}]}],"member":"219","published-online":{"date-parts":[[2016,5,2]]},"reference":[{"key":"S0218195916500011BIB001","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry, Algorithms and Applications","author":"de\u00a0Berg M.","year":"2008","edition":"3"},{"key":"S0218195916500011BIB002","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543340"},{"key":"S0218195916500011BIB003","doi-asserted-by":"publisher","DOI":"10.1145\/359156.359164"},{"key":"S0218195916500011BIB004","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1979.4766871"},{"key":"S0218195916500011BIB005","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-012-9446-0"},{"key":"S0218195916500011BIB006","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-005-1177-z"},{"key":"S0218195916500011BIB007","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-008-9056-z"},{"key":"S0218195916500011BIB008","doi-asserted-by":"publisher","DOI":"10.1145\/2543581.2543589"},{"key":"S0218195916500011BIB009","doi-asserted-by":"publisher","DOI":"10.1007\/BF01934990"},{"key":"S0218195916500011BIB010","doi-asserted-by":"publisher","DOI":"10.1137\/0215024"},{"key":"S0218195916500011BIB011","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.10.042"},{"key":"S0218195916500011BIB012","volume-title":"Graph Theory","author":"Diestel R.","year":"2005"}],"container-title":["International Journal of Computational Geometry &amp; Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218195916500011","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,19]],"date-time":"2020-09-19T10:28:15Z","timestamp":1600511295000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218195916500011"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3]]},"references-count":12,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2016,5,2]]},"published-print":{"date-parts":[[2016,3]]}},"alternative-id":["10.1142\/S0218195916500011"],"URL":"https:\/\/doi.org\/10.1142\/s0218195916500011","relation":{},"ISSN":["0218-1959","1793-6357"],"issn-type":[{"value":"0218-1959","type":"print"},{"value":"1793-6357","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3]]}}}