{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,2]],"date-time":"2023-09-02T05:06:30Z","timestamp":1693631190386},"reference-count":16,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"9","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2021,9,1]]},"DOI":"10.1587\/transfun.2020dmp0011","type":"journal-article","created":{"date-parts":[[2021,3,9]],"date-time":"2021-03-09T22:06:46Z","timestamp":1615327606000},"page":"1142-1149","source":"Crossref","is-referenced-by-count":1,"title":["Convex Grid Drawings of Plane Graphs with Pentagonal Contours on &lt;i&gt;O&lt;\/i&gt;(&lt;i&gt;n&lt;\/i&gt;&lt;sup&gt;2&lt;\/sup&gt;) Grids"],"prefix":"10.1587","volume":"E104.A","author":[{"given":"Kei","family":"SATO","sequence":"first","affiliation":[{"name":"Faculty of Symbiotic Systems Science, Fukushima University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuyuki","family":"MIURA","sequence":"additional","affiliation":[{"name":"Faculty of Symbiotic Systems Science, Fukushima University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] N. Bonichon, S. Felsner, and M. Mosbah, \u201cConvex drawings of 3-connected plane graphs,\u201d Algorithmica, vol.47, no.4, pp.399-420, 2007. 10.1007\/s00453-006-0177-6","DOI":"10.1007\/s00453-006-0177-6"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] M. Chrobak and G. Kant, \u201cConvex grid drawings of 3-connected planar graphs,\u201d Int. J. Comput. Geom. Appl., vol.7, no.3, pp.211-223, 1997. 10.1142\/s0218195997000144","DOI":"10.1142\/S0218195997000144"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] N. Chiba, K. Onoguchi, and T. Nishizeki, \u201cDrawing planar graphs nicely,\u201d Acta Inform., vol.22, pp.187-201, 1985. 10.1007\/bf00264230","DOI":"10.1007\/BF00264230"},{"key":"4","unstructured":"[4] N. Chiba, T. Yamanouchi, and T. Nishizeki, \u201cLinear algorithms for convex drawings of planar graphs,\u201d Progress in Graph Theory, J.A. Bondy and U.S.R. Murty, eds., Academic Press, pp.153-173, 1984."},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] H. de Fraysseix, J. Pach and R. Pollack, \u201cHow to draw a planar graph on a grid,\u201d Combinatorica, vol.10, pp.41-51, 1990. 10.1007\/bf02122694","DOI":"10.1007\/BF02122694"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] J.E. Hopcroft and R.E. Tarjan, \u201cDividing a graph into triconnected components,\u201d SIAM J. Compt., vol.2, no.3, pp.135-158, 1973. 10.1137\/0202012","DOI":"10.1137\/0202012"},{"key":"7","unstructured":"[7] T. Hashimoto, K. Miura, and T. Nishizeki, \u201cConvex grid drawings of internally triconnected plane graphs,\u201d IEICE Trans. Inf. &amp; Syst. (Japanese edition), vol.J95-D, no.3, pp.356-365, March 2012."},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] K. Miura, \u201cConvex grid drawings of plane graphs with pentagonal contours,\u201d IEICE Trans. Inf. &amp; Syst., vol.E97-D, no.3, pp.413-420, March 2014. 10.1587\/transinf.e97.d.413","DOI":"10.1587\/transinf.E97.D.413"},{"key":"9","unstructured":"[9] K. Miura, \u201cConvex grid drawings of plane graphs with hexagonal contours,\u201d 19th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2016), 1.1, pp.1-8, 2016."},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] K. Miura, M. Azuma, and T. Nishizeki, \u201cCanonical decomposition, realizer, Schnyder labeling and orderly spanning trees of plane graphs,\u201d Int. J. Found. Comput. Sci., vol.16, no.1, pp.117-141, 2005. 10.1142\/S0129054105002905","DOI":"10.1142\/S0129054105002905"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] K. Miura, M. Azuma, and T. Nishizeki, \u201cConvex drawings of plane graphs of minimum outer apices,\u201d Int. J. Found. Comput. Sci., vol.17, no.5, pp.1115-1127, 2006. 10.1142\/s0129054106004297","DOI":"10.1142\/S0129054106004297"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] K. Miura, A. Kamada and T. Nishizeki, \u201cConvex grid drawings of plane graphs with rectangular contours,\u201d J. Graph Algorithms Appl., vol.12, no.2, pp.197-224, 2008. 10.7155\/jgaa.00164","DOI":"10.7155\/jgaa.00164"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] T. Nishizeki and M.S. Rahman, Planar Graph Drawing, World Scientific, Singapore, 2004. 10.1142\/5648","DOI":"10.1142\/5648"},{"key":"14","unstructured":"[14] K. Sato and K. Miura, \u201cConvex grid drawings of plane graphs with heptagonal contours,\u201d IPSJ Tohoku Branch SIG Technical Report, 1, 1, pp.3-3-1-3-3-10, 2019 (in Japanese)."},{"key":"15","doi-asserted-by":"publisher","unstructured":"[15] C. Thomassen, \u201cPlanarity and duality of finite and infinite graphs,\u201d J. Combinatorial Theory, Series B, vol.29, no.2, pp.244-271, 1980. 10.1016\/0095-8956(80)90083-0","DOI":"10.1016\/0095-8956(80)90083-0"},{"key":"16","doi-asserted-by":"publisher","unstructured":"[16] X. Zhou and T. Nishizeki, \u201cConvex drawings of internally triconnected plane graphs on <i>O<\/i>(<i>n<\/i><sup>2<\/sup>) grids,\u201d Discrete Math. Algorithms Appl., vol.2, no.3, pp.347-362, 2009. 10.1142\/s179383091000070x","DOI":"10.1142\/S179383091000070X"}],"container-title":["IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E104.A\/9\/E104.A_2020DMP0011\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,4]],"date-time":"2021-09-04T03:25:21Z","timestamp":1630725921000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E104.A\/9\/E104.A_2020DMP0011\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,1]]},"references-count":16,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2021]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2020dmp0011","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,1]]},"article-number":"2020DMP0011"}}