{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T15:04:15Z","timestamp":1725807855752},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319125671"},{"type":"electronic","value":"9783319125688"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-45803-7_29","type":"book-chapter","created":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T06:12:53Z","timestamp":1417414373000},"page":"343-354","source":"Crossref","is-referenced-by-count":3,"title":["On the Complexity of HV-rectilinear Planarity Testing"],"prefix":"10.1007","author":[{"given":"Walter","family":"Didimo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurizio","family":"Patrignani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"8","key":"29_CR1","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1109\/12.868028","volume":"49","author":"P. Bertolazzi","year":"2000","unstructured":"Bertolazzi, P., Di Battista, G., Didimo, W.: Computing orthogonal drawings with the minimum number of bends. IEEE Transactions on Computers\u00a049(8), 826\u2013840 (2000)","journal-title":"IEEE Transactions on Computers"},{"issue":"4","key":"29_CR2","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1007\/s00453-012-9705-8","volume":"68","author":"T. Bl\u00e4sius","year":"2014","unstructured":"Bl\u00e4sius, T., Krug, M., Rutter, I., Wagner, D.: Orthogonal graph drawing with flexibility constraints. Algorithmica\u00a068(4), 859\u2013885 (2014)","journal-title":"Algorithmica"},{"key":"29_CR3","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press (2009)"},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1137\/S0097539794280736","volume":"25","author":"G. Di Battista","year":"1996","unstructured":"Di Battista, G., Tamassia, R.: On-line planarity testing. SIAM J. on Comp.\u00a025, 956\u2013997 (1996)","journal-title":"SIAM J. on Comp."},{"issue":"3","key":"29_CR5","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"},{"issue":"2","key":"29_CR6","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1016\/S0304-3975(01)00408-X","volume":"289","author":"G. Di Battista","year":"2002","unstructured":"Di Battista, G., Liotta, G., Lubiw, A., Whitesides, S.: Embedding problems for paths with direction constrained edges. Theoretical Computer Science\u00a0289(2), 897\u2013917 (2002)","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"29_CR7","doi-asserted-by":"publisher","first-page":"1764","DOI":"10.1137\/S0097539794262847","volume":"27","author":"G. Di Battista","year":"1998","unstructured":"Di Battista, G., Liotta, G., Vargiu, F.: Spirality and optimal orthogonal drawings. SIAM J. on Comp.\u00a027(6), 1764\u20131811 (1998)","journal-title":"SIAM J. on Comp."},{"issue":"2","key":"29_CR8","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.ipl.2004.01.015","volume":"90","author":"E. Di Giacomo","year":"2004","unstructured":"Di Giacomo, E., Liotta, G., Patrignani, M.: A note on 3D orthogonal drawings with direction constrained edges. Inf. Proc. Lett.\u00a090(2), 97\u2013101 (2004)","journal-title":"Inf. Proc. Lett."},{"key":"29_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-642-54423-1_14","volume-title":"LATIN 2014: Theoretical Informatics","author":"S. Durocher","year":"2014","unstructured":"Durocher, S., Felsner, S., Mehrabi, S., Mondal, D.: Drawing HV-restricted planar graphs. In: Pardo, A., Viola, A. (eds.) LATIN 2014. LNCS, vol.\u00a08392, pp. 156\u2013167. Springer, Heidelberg (2014)"},{"issue":"3","key":"29_CR10","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1016\/j.comgeo.2013.03.002","volume":"47","author":"S. Felsner","year":"2014","unstructured":"Felsner, S., Kaufmann, M., Valtr, P.: Bend-optimal orthogonal graph drawing in the general position model. Computational Geometry\u00a047(3), 460\u2013468 (2014)","journal-title":"Computational Geometry"},{"issue":"2","key":"29_CR11","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 J. on Comp.\u00a031(2), 601\u2013625 (2001)","journal-title":"SIAM J. on Comp."},{"issue":"2","key":"29_CR12","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0020-0190(88)90032-4","volume":"29","author":"F. Hoffman","year":"1988","unstructured":"Hoffman, F.: Embedding rectilinear graphs in linear time. Inf. Proc. Lett.\u00a029(2), 75\u201379 (1988)","journal-title":"Inf. Proc. Lett."},{"key":"29_CR13","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":"3","key":"29_CR14","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1137\/040614086","volume":"17","author":"P. Mutzel","year":"2006","unstructured":"Mutzel, P., Weiskircher, R.: Bend minimization in planar orthogonal drawings using integer programming. SIAM J. on Opt.\u00a017(3), 665\u2013687 (2006)","journal-title":"SIAM J. on Opt."},{"issue":"4","key":"29_CR15","first-page":"31","volume":"3","author":"M.S. Rahman","year":"1999","unstructured":"Rahman, M.S., Nakano, S.I., Nishizeki, T.: A linear algorithm for bend-optimal orthogonal drawings of triconnected cubic plane graphs. J. of Graph Alg. and Appl.\u00a03(4), 31\u201362 (1999)","journal-title":"J. of Graph Alg. and Appl."},{"issue":"4","key":"29_CR16","first-page":"335","volume":"7","author":"M.S. Rahman","year":"2003","unstructured":"Rahman, M.S., Nishizeki, T., Naznin, M.: Orthogonal drawings of plane graphs without bends. J. of Graph Alg. and Appl.\u00a07(4), 335\u2013362 (2003)","journal-title":"J. of Graph Alg. and Appl."},{"issue":"9","key":"29_CR17","doi-asserted-by":"publisher","first-page":"1230","DOI":"10.1109\/31.34669","volume":"CAS-36","author":"R. Tamassia","year":"1989","unstructured":"Tamassia, R., Tollis, I.G.: Planar grid embedding in linear time. IEEE Transactions on Circuits Systems\u00a0CAS-36(9), 1230\u20131234 (1989)","journal-title":"IEEE Transactions on Circuits Systems"},{"issue":"3","key":"29_CR18","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 J. on Comp.\u00a016(3), 421\u2013444 (1987)","journal-title":"SIAM J. on Comp."},{"issue":"2","key":"29_CR19","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 J. on Comp.\u00a014(2), 355\u2013372 (1985)","journal-title":"SIAM J. on Comp."},{"issue":"4","key":"29_CR20","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 J. on Discr. Math.\u00a022(4), 1570\u20131604 (2008)","journal-title":"SIAM J. on Discr. Math."}],"container-title":["Lecture Notes in Computer Science","Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-45803-7_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T17:23:48Z","timestamp":1559064228000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-45803-7_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319125671","9783319125688"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-45803-7_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}