{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T10:22:20Z","timestamp":1725790940978},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642544224"},{"type":"electronic","value":"9783642544231"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54423-1_14","type":"book-chapter","created":{"date-parts":[[2014,3,24]],"date-time":"2014-03-24T23:02:27Z","timestamp":1395702147000},"page":"156-167","source":"Crossref","is-referenced-by-count":3,"title":["Drawing HV-Restricted Planar Graphs"],"prefix":"10.1007","author":[{"given":"Stephane","family":"Durocher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Felsner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saeed","family":"Mehrabi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Debajyoti","family":"Mondal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"1764","DOI":"10.1137\/S0097539794262847","volume":"27","author":"G.D. Battista","year":"1998","unstructured":"Battista, G.D., Liotta, G., Vargiu, F.: Spirality and optimal orthogonal drawings. SIAM Journal on Computing\u00a027, 1764\u20131811 (1998)","journal-title":"SIAM Journal on Computing"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Borradaile, G., Klein, P.N., Mozes, S., Nussbaum, Y., Wulff-Nilsen, C.: Multiple-source multiple-sink maximum flow in directed planar graphs in near-linear time. In: Ostrovsky, R. (ed.) IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS), pp. 170\u2013179. IEEE (2011)","DOI":"10.1109\/FOCS.2011.73"},{"issue":"3","key":"14_CR3","doi-asserted-by":"publisher","first-page":"635","DOI":"10.7155\/jgaa.00265","volume":"16","author":"S. Cornelsen","year":"2012","unstructured":"Cornelsen, S., Karrenbauer, A.: Accelerated bend minimization. Journal of Graph Algorithms and Applications\u00a016(3), 635\u2013650 (2012)","journal-title":"Journal of Graph Algorithms and Applications"},{"issue":"3","key":"14_CR4","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s00454-011-9381-5","volume":"47","author":"G. Di Battista","year":"2012","unstructured":"Di Battista, G., Kim, E., Liotta, G., Lubiw, A., Whitesides, S.: The shape of orthogonal cycles in three dimensions. Discrete & Computational Geometry\u00a047(3), 461\u2013491 (2012)","journal-title":"Discrete & Computational Geometry"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/3-540-36151-0_14","volume-title":"Graph Drawing","author":"E. Di Giacomo","year":"2002","unstructured":"Di Giacomo, E., Liotta, G., Patrignani, M.: Orthogonal 3D shapes of theta graphs. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol.\u00a02528, pp. 142\u2013149. Springer, Heidelberg (2002)"},{"issue":"2","key":"14_CR6","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1137\/S0097539794277123","volume":"31","author":"A. Garg","year":"2001","unstructured":"Garg, A., Tamassia, R.: On the computational complexity of upward and rectilinear planarity testing. SIAM Journal on Computing\u00a031(2), 601\u2013625 (2001)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"14_CR7","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0020-0190(88)90032-4","volume":"29","author":"F. Hoffmann","year":"1988","unstructured":"Hoffmann, F., Kriegel, K.: Embedding rectilinear graphs in linear time. Information Processing Letters\u00a029(2), 75\u201379 (1988)","journal-title":"Information Processing Letters"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/BF02086606","volume":"16","author":"G. Kant","year":"1996","unstructured":"Kant, G.: Drawing planar graphs using the canonical ordering. Algorithmica\u00a016, 4\u201332 (1996)","journal-title":"Algorithmica"},{"issue":"2","key":"14_CR9","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/1721837.1721846","volume":"6","author":"P.N. Klein","year":"2010","unstructured":"Klein, P.N., Mozes, S., Weimann, O.: Shortest paths in directed planar graphs with negative lengths: A linear-space O(nlog2\n                  n)-time algorithm. ACM Transactions on Algorithms\u00a06(2), 236\u2013245 (2010)","journal-title":"ACM Transactions on Algorithms"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-642-18469-7_28","volume-title":"Graph Drawing","author":"J. Ma\u0148uch","year":"2011","unstructured":"Ma\u0148uch, J., Patterson, M., Poon, S.-H., Thachuk, C.: Complexity of finding non-planar rectilinear drawings of graphs. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol.\u00a06502, pp. 305\u2013316. Springer, Heidelberg (2011)"},{"issue":"2-3","key":"14_CR11","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1142\/S0218195906002026","volume":"16","author":"K. Miura","year":"2006","unstructured":"Miura, K., Haga, H., Nishizeki, T.: Inner rectangular drawings of plane graphs. International Journal of Computational Geometry and Applications\u00a016(2-3), 249\u2013270 (2006)","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-642-15781-3_18","volume-title":"Algorithms \u2013 ESA 2010","author":"S. Mozes","year":"2010","unstructured":"Mozes, S., Wulff-Nilsen, C.: Shortest paths in planar graphs with real lengths in O(nlog2\n                  n \/loglogn)-time. In: de Berg, M., Meyer, U. (eds.) ESA 2010, Part II. LNCS, vol.\u00a06347, pp. 206\u2013217. Springer, Heidelberg (2010)"},{"issue":"6","key":"14_CR13","doi-asserted-by":"publisher","first-page":"1583","DOI":"10.1093\/ietfec\/e88-a.6.1583","volume":"E88-A","author":"K. Nomura","year":"2005","unstructured":"Nomura, K., Tayu, S., Ueno, S.: On the orthogonal drawing of outerplanar graphs. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences\u00a0E88-A(6), 1583\u20131588 (2005)","journal-title":"IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"},{"issue":"3","key":"14_CR14","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R. Tamassia","year":"1987","unstructured":"Tamassia, R.: On embedding a graph in the grid with the minimum number of bends. SIAM Journal on Computing\u00a016(3), 421\u2013444 (1987)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"14_CR15","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1137\/0214027","volume":"14","author":"G. Vijayan","year":"1985","unstructured":"Vijayan, G., Wigderson, A.: Rectilinear graphs and their embeddings. SIAM Journal on Computing\u00a014(2), 355\u2013372 (1985)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"14_CR16","doi-asserted-by":"publisher","first-page":"1570","DOI":"10.1137\/060667621","volume":"22","author":"X. Zhou","year":"2008","unstructured":"Zhou, X., Nishizeki, T.: Orthogonal drawings of series-parallel graphs with minimum bends. SIAM Journal on Discrete Mathematics\u00a022(4), 1570\u20131604 (2008)","journal-title":"SIAM Journal on Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","LATIN 2014: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54423-1_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T08:45:50Z","timestamp":1558860350000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54423-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642544224","9783642544231"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54423-1_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}