{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:10:35Z","timestamp":1725577835952},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642184680"},{"type":"electronic","value":"9783642184697"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-18469-7_28","type":"book-chapter","created":{"date-parts":[[2011,2,10]],"date-time":"2011-02-10T00:30:40Z","timestamp":1297297840000},"page":"305-316","source":"Crossref","is-referenced-by-count":5,"title":["Complexity of Finding Non-Planar Rectilinear Drawings of Graphs"],"prefix":"10.1007","author":[{"given":"J\u00e1n","family":"Ma\u0148uch","sequence":"first","affiliation":[]},{"given":"Murray","family":"Patterson","sequence":"additional","affiliation":[]},{"given":"Sheung-Hung","family":"Poon","sequence":"additional","affiliation":[]},{"given":"Chris","family":"Thachuk","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-642-03367-4_19","volume-title":"Algorithms and Data Structures","author":"W. Didimo","year":"2009","unstructured":"Didimo, W., Eades, P., Liotta, G.: Drawing graphs with right angle crossings. In: Dehne, F., Gavrilova, M., Sack, J.-R., T\u00f3th, C.D. (eds.) WADS 2009. LNCS, vol.\u00a05664, pp. 206\u2013217. Springer, Heidelberg (2009)"},{"key":"28_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/978-3-642-11805-0_23","volume-title":"Graph Drawing","author":"P. Eades","year":"2010","unstructured":"Eades, P., Hong, S.-H., Poon, S.-H.: On rectilinear drawing of graphs. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol.\u00a05849, pp. 232\u2013243. Springer, Heidelberg (2010)"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-642-00219-9_9","volume-title":"Graph Drawing","author":"D. Eppstein","year":"2009","unstructured":"Eppstein, D.: The topology of bendless three-dimensional orthogonal graph drawing. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol.\u00a05417, pp. 78\u201389. Springer, Heidelberg (2009)"},{"issue":"5","key":"28_CR4","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1137\/0222063","volume":"22","author":"M. Formann","year":"1993","unstructured":"Formann, M., Hagerup, T., Haralambides, J., Kaufmann, M., Leighton, F.T., Symvonis, A., Welzl, E., Woeginger, G.: Drawing graphs in the plane with high resolution. SIAM Journal on Computing\u00a022(5), 1035\u20131052 (1993)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"28_CR5","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 of Computing\u00a031(2), 601\u2013625 (2001)","journal-title":"SIAM Journal of Computing"},{"issue":"2","key":"28_CR6","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., Kriegel, K.: Embedding rectilinear graphs in linear time. Information Processing Letters\u00a029(2), 75\u201379 (1988)","journal-title":"Information Processing Letters"},{"doi-asserted-by":"crossref","unstructured":"Huang, W., Hong, S., Eades, P.: Effects of crossing angles. In: Proc. of IEEE Pacific Visualization Symposium (PacificVis 2008), pp. 41\u201346 (2008)","key":"28_CR7","DOI":"10.1109\/PACIFICVIS.2008.4475457"},{"issue":"1","key":"28_CR8","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1137\/0208008","volume":"8","author":"J. Opatrny","year":"1979","unstructured":"Opatrny, J.: Total ordering problem. SIAM Journal of Computing\u00a08(1), 111\u2013114 (1979)","journal-title":"SIAM Journal of Computing"},{"key":"28_CR9","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0925-7721(01)00010-4","volume":"19","author":"M. Patrignani","year":"2001","unstructured":"Patrignani, M.: On the complexity of orthogonal compaction. Computational Geometry\u00a019, 47\u201367 (2001)","journal-title":"Computational Geometry"},{"key":"28_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-540-24595-7_36","volume-title":"Graph Drawing","author":"M..S. Rahman","year":"2004","unstructured":"Rahman, M.S., Egi, N., Nishizeki, T.: No-bend orthogonal drawings of subdivisions of planar triconnected cubic graphs. In: Liotta, G. (ed.) GD 2003. LNCS, vol.\u00a02912, pp. 387\u2013392. Springer, Heidelberg (2004)"},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/11618058_37","volume-title":"Graph Drawing","author":"M..S. Rahman","year":"2006","unstructured":"Rahman, M.S., Egi, N., Nishizeki, T.: No-bend orthogonal drawings of series-parallel graphs. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 409\u2013420. Springer, Heidelberg (2006)"},{"issue":"4","key":"28_CR13","doi-asserted-by":"publisher","first-page":"335","DOI":"10.7155\/jgaa.00074","volume":"7","author":"M..S. Rahman","year":"2003","unstructured":"Rahman, M.S., Naznin, M., Nishizeki, T.: Orthogonal drawings of plane graphs without bends. Journal of Graph Algorithms and Applications\u00a07(4), 335\u2013362 (2003)","journal-title":"Journal of Graph Algorithms and Applications"},{"issue":"2","key":"28_CR14","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 of Computing\u00a014(2), 355\u2013372 (1985)","journal-title":"SIAM Journal of Computing"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18469-7_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T18:19:09Z","timestamp":1548440349000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18469-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642184680","9783642184697"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18469-7_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}