{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T02:27:57Z","timestamp":1649039277796},"reference-count":15,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"8","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2015]]},"DOI":"10.1587\/transinf.2015edl8068","type":"journal-article","created":{"date-parts":[[2015,7,31]],"date-time":"2015-07-31T22:42:28Z","timestamp":1438382548000},"page":"1592-1595","source":"Crossref","is-referenced-by-count":0,"title":["Dominating Sets in Two-Directional Orthogonal Ray Graphs"],"prefix":"10.1587","volume":"E98.D","author":[{"given":"Asahi","family":"TAKAOKA","sequence":"first","affiliation":[{"name":"Department of Communications and Computer Engineering, Tokyo Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satoshi","family":"TAYU","sequence":"additional","affiliation":[{"name":"Department of Communications and Computer Engineering, Tokyo Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuichi","family":"UENO","sequence":"additional","affiliation":[{"name":"Department of Communications and Computer Engineering, Tokyo Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] R. Belmonte and M. Vatshelle, \u201cGraph classes with structured neighborhoods and algorithmic applications,\u201d Theor. Comput. Sci., vol.511, pp.54-65, 2013.","DOI":"10.1016\/j.tcs.2013.01.011"},{"key":"2","unstructured":"[2] B.-M. Bui-Xuan, J.A. Telle, and M. Vatshelle, \u201cBoolean-width of graphs,\u201d Proc. 4th International Workshop on Parameterized and Exact Computation (IWPEC), Lecture Notes in Computer Science, vol.5917, pp.61-74, Springer, Berlin, Heidelberg, 2009."},{"key":"3","unstructured":"[3] B.-M. Bui-Xuan, J.A. Telle, and M. Vatshelle, \u201cBoolean-width of graphs,\u201d Theor. Comput. Sci., vol.412, no.39, pp.5187-5204, 2011."},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] B.-M. Bui-Xuan, J.A. Telle, and M. Vatshelle, \u201cFast dynamic programming for locally checkable vertex subset and vertex partitioning problems,\u201d Theor. Comput. Sci., vol.511, pp.66-76, 2013.","DOI":"10.1016\/j.tcs.2013.01.009"},{"key":"5","unstructured":"[5] A. Ershadi, List homomorphisms and bipartite co-circular arc graphs, Master's thesis, Simon Fraser University, 2012."},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] G.K. Manacher and T.A. Mankus, \u201cIncorporating negative-weight vertices in certain vertex-search graph algorithms,\u201d Inform. Process. Lett., vol.42, no.6, pp.293-294, 1992.","DOI":"10.1016\/0020-0190(92)90224-J"},{"key":"7","unstructured":"[7] C.G. Plaxton, \u201cVertex-weighted matching in two-directional orthogonal ray graphs,\u201d Proc. 24th International Symposium on Algorithms and Computation (ISAAC), Lecture Notes in Computer Science, vol.8283, pp.524-534, Springer, Berlin, Heidelberg, 2013."},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] A.M.S. Shrestha, A. Takaoka, S. Tayu, and S. Ueno, \u201cOn two problems of nano-PLA design,\u201d IEICE Trans. Inf. & Syst., vol.E94-D, no.1, pp.35-41, Jan. 2011.","DOI":"10.1587\/transinf.E94.D.35"},{"key":"9","unstructured":"[9] A.M.S. Shrestha, S. Tayu, and S. Ueno, \u201cOrthogonal ray graphs and nano-PLA design,\u201d Proc. IEEE International Symposium on Circuits and Systems (ISCAS), pp.2930-2933, May 2009."},{"key":"10","unstructured":"[10] A.M.S. Shrestha, S. Tayu, and S. Ueno, \u201cOn orthogonal ray graphs,\u201d Discrete Appl. Math., vol.158, no.15, pp.1650-1659, 2010."},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] A.M.S. Shrestha, S. Tayu, and S. Ueno, \u201cBandwidth of convex bipartite graphs and related graphs,\u201d Inform. Process. Lett., vol.112, no.11, pp.411-417, 2012.","DOI":"10.1016\/j.ipl.2012.02.012"},{"key":"12","unstructured":"[12] J.A. Soto and C. Telha, \u201cJump number of two-directional orthogonal ray graphs,\u201d Proc. 15th International Conference on Integer Programming and Combinatorial Optimization (IPCO), Lecture Notes in Computer Science, vol.6655, pp.389-403, Springer, Berlin, Heidelberg, 2011."},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] A. Takaoka, S. Tayu, and S. Ueno, \u201cDominating sets and induced matchings in orthogonal ray graphs,\u201d IEICE Trans. Inf. & Syst., vol.E97-D, no.12, pp.3101-3109, Dec. 2014.","DOI":"10.1587\/transinf.2014EDP7184"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] A. Takaoka, S. Tayu, and S. Ueno, \u201cWeighted dominating sets and induced matchings in orthogonal ray graphs,\u201d Proc. IEEE-2nd International Conference on Control, Decision and Information Technologies (CoDIT), pp.69-73, Nov. 2014.","DOI":"10.1109\/CoDIT.2014.6996870"},{"key":"15","unstructured":"[15] M. Vatshelle, Personal communication, 2013."}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E98.D\/8\/E98.D_2015EDL8068\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,28]],"date-time":"2019-08-28T23:55:35Z","timestamp":1567036535000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E98.D\/8\/E98.D_2015EDL8068\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"references-count":15,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2015]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2015edl8068","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}