{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:32:02Z","timestamp":1725795122400},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319080154"},{"type":"electronic","value":"9783319080161"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08016-1_10","type":"book-chapter","created":{"date-parts":[[2014,5,30]],"date-time":"2014-05-30T00:18:07Z","timestamp":1401409087000},"page":"105-116","source":"Crossref","is-referenced-by-count":4,"title":["Monotone Grid Drawings of Planar Graphs"],"prefix":"10.1007","author":[{"given":"Md. Iqbal","family":"Hossain","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Md. Saidur","family":"Rahman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"10_CR1","doi-asserted-by":"crossref","first-page":"5","DOI":"10.7155\/jgaa.00249","volume":"16","author":"P. Angelini","year":"2012","unstructured":"Angelini, P., Colasante, E., Di Battista, G., Frati, F., Patrignani, M.: Monotone drawings of graphs. Journal of Graph Algorithms and Applications\u00a016(1), 5\u201335 (2012)","journal-title":"Journal of Graph Algorithms and Applications"},{"doi-asserted-by":"crossref","unstructured":"Angelini, P., Didimo, W., Kobourov, S., Mchedlidze, T., Roselli, V., Symvonis, A., Wismath, S.: Monotone drawings of graphs with fixed embedding. Algorithmica, 1\u201325 (2013)","key":"10_CR2","DOI":"10.1007\/978-3-642-25878-7_36"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1145\/73833.73870","volume-title":"Proceedings of the Fifth Annual Symposium on Computational Geometry, SCG 1989","author":"E.M. Arkin","year":"1989","unstructured":"Arkin, E.M., Connelly, R., Mitchell, J.B.: On monotone paths among obstacles with applications to planning assemblies. In: Proceedings of the Fifth Annual Symposium on Computational Geometry, SCG 1989, pp. 334\u2013343. ACM, New York (1989)"},{"unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall (1999)","key":"10_CR4"},{"issue":"2\u20133","key":"10_CR5","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0304-3975(88)90123-5","volume":"61","author":"G. Battista Di","year":"1988","unstructured":"Di Battista, G., Tamassia, R.: Algorithms for plane representations of acyclic digraphs. Theoretical Computer Science\u00a061(2\u20133), 175\u2013198 (1988)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"10_CR6","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/0202012","volume":"2","author":"J.E. Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Tarjan, R.E.: Dividing a graph into triconnected components. SIAM Journal on Computing\u00a02(3), 135\u2013158 (1973)","journal-title":"SIAM Journal on Computing"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1007\/978-3-642-38768-5_59","volume-title":"Computing and Combinatorics","author":"M.. I. Hossain","year":"2013","unstructured":"Hossain, M. I., Rahman, M. S.: Straight-line monotone grid drawings of series-parallel graphs. In: Du, D.-Z., Zhang, G. (eds.) COCOON 2013. LNCS, vol.\u00a07936, pp. 672\u2013679. Springer, Heidelberg (2013)"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1109\/PACIFICVIS.2009.4906848","volume-title":"Proceedings of the 2009, IEEE Pacific Visualization Symposium, PACIFICVIS 2009","author":"W. Huang","year":"2009","unstructured":"Huang, W., Eades, P., Hong, S.-H.: A graph reading behavior: Geodesic-path tendency. In: Proceedings of the 2009, IEEE Pacific Visualization Symposium, PACIFICVIS 2009, pp. 137\u2013144. IEEE Computer Society, Washington, DC (2009)"},{"key":"10_CR9","series-title":"Lecture notes series on computing","doi-asserted-by":"crossref","DOI":"10.1142\/5648","volume-title":"Planar Graph Drawing","author":"T. Nishizeki","year":"2004","unstructured":"Nishizeki, T., Rahman, M. S.: Planar Graph Drawing. Lecture notes series on computing. World Scientific, Singapore (2004)"},{"unstructured":"Hassan Samee, M.A., Rahman, M.S.: Upward planar drawings of series-parallel digraphs with maximum degree three. In: WALCOM 2007, pp. 28\u201345 (2007)","key":"10_CR10"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08016-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T19:32:03Z","timestamp":1558899123000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08016-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319080154","9783319080161"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08016-1_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}