{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:24:59Z","timestamp":1760441099793},"reference-count":8,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"11","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2012]]},"DOI":"10.1587\/transinf.e95.d.2716","type":"journal-article","created":{"date-parts":[[2012,10,31]],"date-time":"2012-10-31T22:38:57Z","timestamp":1351723137000},"page":"2716-2719","source":"Crossref","is-referenced-by-count":4,"title":["Finding the Minimum Number of Face Guards is NP-Hard"],"prefix":"10.1587","volume":"E95.D","author":[{"given":"Chuzo","family":"IWAMOTO","sequence":"first","affiliation":[{"name":"Graduate School of Engineering, Hiroshima University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yusuke","family":"KITAGAKI","sequence":"additional","affiliation":[{"name":"Graduate School of Engineering, Hiroshima University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenichi","family":"MORITA","sequence":"additional","affiliation":[{"name":"Graduate School of Engineering, Hiroshima University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","unstructured":"[1] V.H.F. Batista, F.L.B. Ribeiro, and F. Protti, “On the complexity of the edge guarding problem,” Proc. 26th European Workshop on Computational Geometry, pp.53-56, Dortmund, Germany, 2010."},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] P. Bose, D. Kirkpatrick, and Z. Li, “Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces,” Comput. Geom. Theory Appl., vol.26, pp.209-219, 2003.","DOI":"10.1016\/S0925-7721(03)00027-0"},{"key":"3","unstructured":"[7] I. Fáry, “On straight-line representation of planar graphs,” Acta Sci. Math., vol.11, pp.229-233, 1948."},{"key":"4","unstructured":"[8] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, New York, NY, USA, 1979."},{"key":"5","doi-asserted-by":"crossref","unstructured":"[9] C. Iwamoto, J. Kishi, and K. Morita, “Lower bound of face guards of polyhedral terrains,” J. Inf. Process., vol.20, no.2, pp.435-437, 2012.","DOI":"10.2197\/ipsjjip.20.435"},{"key":"6","unstructured":"[10] C. Iwamoto and T. Kuranobu, “Improved lower and upper bounds of face guards of polyhedral terrains,” IEICE Trans. Inf. & Syst. (Japanese Edition), vol.J95-D, no.10, pp.1869-1872, Oct. 2012."},{"key":"7","doi-asserted-by":"crossref","unstructured":"[11] J. Kratochvíl, “A special planar satisfiability problem and a consequence of its NP-completeness” Discrete Appl. Math., vol.52, pp.233-252, 1994.","DOI":"10.1016\/0166-218X(94)90143-0"},{"key":"8","unstructured":"[13] J. O'Rourke, Art Gallery Theorems and Algorithms, Oxford University Press, New York, NY, USA, 1987."}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E95.D\/11\/E95.D_2716\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,26]],"date-time":"2021-04-26T06:40:01Z","timestamp":1619419201000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E95.D\/11\/E95.D_2716\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"references-count":8,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2012]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.e95.d.2716","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}