{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,12]],"date-time":"2023-10-12T06:00:33Z","timestamp":1697090433160},"reference-count":12,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"7","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2017]]},"DOI":"10.1587\/transinf.2016edl8251","type":"journal-article","created":{"date-parts":[[2017,6,30]],"date-time":"2017-06-30T21:39:53Z","timestamp":1498858793000},"page":"1521-1525","source":"Crossref","is-referenced-by-count":1,"title":["Finding the Minimum Number of Open-Edge Guards in an Orthogonal Polygon is NP-Hard"],"prefix":"10.1587","volume":"E100.D","author":[{"given":"Chuzo","family":"IWAMOTO","sequence":"first","affiliation":[{"name":"Graduate School of Engineering, Hiroshima University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] M.R. Cerioli, L. Faria, T.O. Ferreira, C.A.J. Martinhon, F. Protti, and B. Reed, \u201cPartition into cliques for cubic graphs: Planar case, complexity and approximation,\u201d Discrete Appl. Math., vol.156, no.12, pp.2270-2278, 2008. 10.1016\/j.dam.2007.10.015","DOI":"10.1016\/j.dam.2007.10.015"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] V. Chv\u00e1tal, \u201cA combinatorial theorem in plane geometry,\u201d J. Combin. Theory, ser.B, vol.18, no.1, pp.39-41, 1975. 10.1016\/0095-8956(75)90061-1","DOI":"10.1016\/0095-8956(75)90061-1"},{"key":"3","unstructured":"[3] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, NY, 1979."},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] F. Hoffman, \u201cOn the rectilinear art gallery problem,\u201d Paterson, M. (eds.), ICALP 1990, Lecture Notes in Computer Science, vol.443, pp.717-728, Springer, Heidelberg, 1990. 10.1007\/bfb0032069","DOI":"10.1007\/BFb0032069"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] M.J. Katz and G.S. Roisman, \u201cOn guarding the vertices of rectilinear domains,\u201d Comp. Geom. Theor. Appl., vol.39, no.3, pp.219-228, 2008. 10.1016\/j.comgeo.2007.02.002","DOI":"10.1016\/j.comgeo.2007.02.002"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] D.T. Lee and A.K. Lin, \u201cComputational complexity of art gallery problems,\u201d IEEE Trans. Inform. Theory, vol.32, no.2, pp.276-282, 1986. 10.1109\/tit.1986.1057165","DOI":"10.1109\/TIT.1986.1057165"},{"key":"7","unstructured":"[7] J. O'Rourke, Art Gallery Theorems and Algorithms, Oxford University Press, New York, 1987."},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] F.P. Preparata and M.I. Shamos, Computational Geometry: An Introduction, Springer-Verlag, New York, 1985. 10.1007\/978-1-4612-1098-6_1","DOI":"10.1007\/978-1-4612-1098-6"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] D. Schuchardt and H.-D. Hecker, \u201cTwo NP-hard art-gallery problems for ortho-polygons,\u201d Math. Logic Quar., vol.41, no.2, pp.261-267, 1995. 10.1002\/malq.19950410212","DOI":"10.1002\/malq.19950410212"},{"key":"10","unstructured":"[10] T. Shermer, \u201cA tight bound on the combinatorial edge guarding problem,\u201d D. Avis and P. Bose (eds.), Snapshots of Computational and Discrete Geometry, vol.3, pp.191-223, McGill University, 1994."},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] C.D. T\u00f3th, G.T. Toussaint, and A. Winslow, \u201cOpen guard edges and edge guards in simple polygons,\u201d A. M\u00e1rquez, P. Ramos, and J. Urrutia (eds.), Computational Geometry, Lecture Notes in Computer Science, vol.7579, pp.54-64. Springer, Berlin, Heidelberg, 2012. 10.1007\/978-3-642-34191-5_5","DOI":"10.1007\/978-3-642-34191-5_5"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] G. Viglietta, \u201cFace-guarding polyhedra,\u201d Comput. Geom. Theory Appl., vol.48, no.5, pp.415-428, 2015. 10.1016\/j.comgeo.2015.01.003","DOI":"10.1016\/j.comgeo.2015.01.003"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E100.D\/7\/E100.D_2016EDL8251\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,27]],"date-time":"2019-09-27T23:31:16Z","timestamp":1569627076000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E100.D\/7\/E100.D_2016EDL8251\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":12,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2017]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2016edl8251","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}