{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T02:32:47Z","timestamp":1771036367653,"version":"3.50.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2018,10,22]],"date-time":"2018-10-22T00:00:00Z","timestamp":1540166400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["Ka812\/17-1"],"award-info":[{"award-number":["Ka812\/17-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1007\/s00453-018-0523-5","type":"journal-article","created":{"date-parts":[[2018,10,22]],"date-time":"2018-10-22T01:40:06Z","timestamp":1540172406000},"page":"2046-2071","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings"],"prefix":"10.1007","volume":"81","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3414-7444","authenticated-orcid":false,"given":"Michael A.","family":"Bekos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1441-4189","authenticated-orcid":false,"given":"Henry","family":"F\u00f6rster","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,22]]},"reference":[{"key":"523_CR1","first-page":"144","volume-title":"LATIN, Volume 8392 of LNCS","author":"MJ Alam","year":"2014","unstructured":"Alam, M.J., Bekos, M.A., Kaufmann, M., Kindermann, P., Kobourov, S.G., Wolff, A.: Smooth orthogonal drawings of planar graphs. In: Pardo, A., Viola, A. (eds.) LATIN, Volume 8392 of LNCS, pp. 144\u2013155. Springer, Berlin (2014)"},{"key":"523_CR2","doi-asserted-by":"crossref","unstructured":"Bekos, M.A., F\u00f6rster, H., Kaufmann, M.: On smooth orthogonal and octilinear drawings: relations, complexity and kandinsky drawings. In: Frati, F., Ma, K.-L. (eds.) Graph Drawing, Volume 10692 of LNCS, pp. 169\u2013183. Springer, Berlin (2017)","DOI":"10.1007\/978-3-319-73915-1_15"},{"issue":"2","key":"523_CR3","doi-asserted-by":"publisher","first-page":"657","DOI":"10.7155\/jgaa.00369","volume":"19","author":"MA Bekos","year":"2015","unstructured":"Bekos, M.A., Gronemann, M., Kaufmann, M., Krug, R.: Planar octilinear drawings with one bend per edge. J. Graph Algorithms Appl. 19(2), 657\u2013680 (2015)","journal-title":"J. Graph Algorithms Appl."},{"key":"523_CR4","doi-asserted-by":"crossref","unstructured":"Bekos, M.A., Gronemann, M., Pupyrev, S., Raftopoulou, C.N.: Perfect smooth orthogonal drawings. In: Bourbakis, N.G., Tsihrintzis, G.A., Virvou, M. (eds.) IISA, pp. 76\u201381. IEEE (2014)","DOI":"10.1109\/IISA.2014.6878731"},{"issue":"5","key":"523_CR5","doi-asserted-by":"publisher","first-page":"575","DOI":"10.7155\/jgaa.00305","volume":"17","author":"MA Bekos","year":"2013","unstructured":"Bekos, M.A., Kaufmann, M., Kobourov, S.G., Symvonis, A.: Smooth orthogonal layouts. J. Graph Algorithms Appl. 17(5), 575\u2013595 (2013)","journal-title":"J. Graph Algorithms Appl."},{"issue":"4","key":"523_CR6","doi-asserted-by":"publisher","first-page":"709","DOI":"10.7155\/jgaa.00436","volume":"21","author":"MA Bekos","year":"2017","unstructured":"Bekos, M.A., Kaufmann, M., Krug, R.: On the total number of bends for planar octilinear drawings. J. Graph Algorithms Appl. 21(4), 709\u2013730 (2017)","journal-title":"J. Graph Algorithms Appl."},{"issue":"8","key":"523_CR7","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 Trans. Comput. 49(8), 826\u2013840 (2000)","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"523_CR8","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0925-7721(97)00026-6","volume":"9","author":"TC Biedl","year":"1998","unstructured":"Biedl, T.C., Kant, G.: A better heuristic for orthogonal graph drawings. Comput. Geom. 9(3), 159\u2013180 (1998)","journal-title":"Comput. Geom."},{"issue":"4","key":"523_CR9","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 68(4), 859\u2013885 (2014)","journal-title":"Algorithmica"},{"key":"523_CR10","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.comgeo.2016.03.001","volume":"55","author":"T Bl\u00e4sius","year":"2016","unstructured":"Bl\u00e4sius, T., Lehmann, S., Rutter, I.: Orthogonal graph drawing with inflexible edges. Comput. Geom. 55, 26\u201340 (2016)","journal-title":"Comput. Geom."},{"key":"523_CR11","unstructured":"Cardinal, J., Hoffmann, M., Kusters, V., T\u00f3th, C.D., Wettstein, M.: Arc diagrams, flip distances, and hamiltonian triangulations. CoRR, arXiv:1611.02541 (2016)"},{"issue":"4","key":"523_CR12","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0020-0190(95)00020-D","volume":"54","author":"M Chrobak","year":"1995","unstructured":"Chrobak, M., Payne, T.H.: A linear-time algorithm for drawing a planar graph on a grid. Inf. Process. Lett. 54(4), 241\u2013246 (1995)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"523_CR13","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H Fraysseix de","year":"1990","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10(1), 41\u201351 (1990)","journal-title":"Combinatorica"},{"key":"523_CR14","first-page":"297","volume-title":"Graph Drawing, Volume 1731 of LNCS","author":"G Battista Di","year":"1999","unstructured":"Di Battista, G., Didimo, W., Patrignani, M., Pizzonia, M.: Orthogonal and quasi-upward drawings with vertices of prescribed size. In: Kratochv\u00edl, J. (ed.) Graph Drawing, Volume 1731 of LNCS, pp. 297\u2013310. Springer, Berlin (1999)"},{"key":"523_CR15","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"G Battista Di","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Upper Saddle River (1999)"},{"key":"523_CR16","first-page":"343","volume-title":"Graph Drawing, Volume 8871 of LNCS","author":"W Didimo","year":"2014","unstructured":"Didimo, W., Liotta, G., Patrignani, M.: On the complexity of HV-rectilinear planarity testing. In: Duncan, C.A., Symvonis, A. (eds.) Graph Drawing, Volume 8871 of LNCS, pp. 343\u2013354. Springer, Berlin (2014)"},{"key":"523_CR17","first-page":"132","volume-title":"LATIN, Volume 8392 of LNCS","author":"E Giacomo Di","year":"2014","unstructured":"Di Giacomo, E., Liotta, G., Montecchiani, F.: The planar slope number of subcubic graphs. In: Pardo, A., Viola, A. (eds.) LATIN, Volume 8392 of LNCS, pp. 132\u2013143. Springer, Berlin (2014)"},{"issue":"1","key":"523_CR18","doi-asserted-by":"publisher","first-page":"85","DOI":"10.7155\/jgaa.00251","volume":"16","author":"CA Duncan","year":"2012","unstructured":"Duncan, C.A., Eppstein, D., Goodrich, M.T., Kobourov, S.G., N\u00f6llenburg, M.: Lombardi drawings of graphs. J. Graph Algorithms Appl. 16(1), 85\u2013108 (2012)","journal-title":"J. Graph Algorithms Appl."},{"key":"523_CR19","first-page":"223","volume-title":"Handbook on Graph Drawing and Visualization","author":"CA Duncan","year":"2013","unstructured":"Duncan, C.A., Goodrich, M.T.: Planar orthogonal and polyline drawing algorithms. In: Tamassia, R. (ed.) Handbook on Graph Drawing and Visualization, pp. 223\u2013246. Chapman and Hall\/CRC, Boca Raton (2013)"},{"key":"523_CR20","first-page":"156","volume-title":"LATIN, Volume 8392 of LNCS","author":"S Durocher","year":"2014","unstructured":"Durocher, S., Felsner, S., Mehrabi, S., Mondal, D.: Drawing HV-restricted planar graphs. In: Alberto, P., Alfredo, V. (eds.) LATIN, Volume 8392 of LNCS, pp. 156\u2013167. Springer, Berlin (2014)"},{"key":"523_CR21","first-page":"126","volume-title":"Graph Drawing, Volume 7704 of LNCS","author":"D Eppstein","year":"2012","unstructured":"Eppstein, D.: Planar lombardi drawings for subcubic graphs. In: Didimo, W., Patrignani, M. (eds.) Graph Drawing, Volume 7704 of LNCS, pp. 126\u2013137. Springer, Berlin (2012)"},{"key":"523_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-322-80303-0","volume-title":"Geometric Graphs and Arrangements. Advanced Lectures in Mathematics","author":"S Felsner","year":"2004","unstructured":"Felsner, S.: Geometric Graphs and Arrangements. Advanced Lectures in Mathematics. Vieweg, Berlin (2004)"},{"key":"523_CR23","first-page":"254","volume-title":"Graph Drawing, Volume 1027 of LNCS","author":"U F\u00f6\u00dfmeier","year":"1995","unstructured":"F\u00f6\u00dfmeier, U., Kaufmann, M.: Drawing high degree graphs with low bend numbers. In: Brandenburg, F.-J. (ed.) Graph Drawing, Volume 1027 of LNCS, pp. 254\u2013266. Springer, Berlin (1995)"},{"key":"523_CR24","first-page":"283","volume-title":"WG, Volume 6986 of LNCS","author":"R Fulek","year":"2011","unstructured":"Fulek, R., Pelsmajer, M.J., Schaefer, M., Stefankovic, D.: Hanani-tutte and monotone drawings. In: Kolman, P., Kratochv\u00edl, J. (eds.) WG, Volume 6986 of LNCS, pp. 283\u2013294. Springer, Berlin (2011)"},{"key":"523_CR25","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)"},{"issue":"2","key":"523_CR26","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. Comput. 31(2), 601\u2013625 (2001)","journal-title":"SIAM J. Comput."},{"key":"523_CR27","volume-title":"Graph Theory","author":"F Harary","year":"1991","unstructured":"Harary, F.: Graph Theory. Addison-Wesley, Boston (1991)"},{"issue":"3","key":"523_CR28","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.jvlc.2005.09.001","volume":"17","author":"S-H Hong","year":"2006","unstructured":"Hong, S.-H., Merrick, D., do Nascimento, H.A.D.: Automatic visualisation of metro maps. J. Vis. Lang. Comput. 17(3), 203\u2013224 (2006)","journal-title":"J. Vis. Lang. Comput."},{"key":"523_CR29","first-page":"263","volume-title":"WG, Volume 657 of LNCS","author":"G Kant","year":"1992","unstructured":"Kant, G.: Hexagonal grid drawings. In: Mayr, E.W. (ed.) WG, Volume 657 of LNCS, pp. 263\u2013276. Springer, Berlin (1992)"},{"issue":"1","key":"523_CR30","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 16(1), 4\u201332 (1996)","journal-title":"Algorithmica"},{"key":"523_CR31","volume-title":"Drawing Graphs, Methods and Models, Volume 2025 of LNCS","year":"2001","unstructured":"Kaufmann, M., Wagner, D. (eds.): Drawing Graphs, Methods and Models, Volume 2025 of LNCS. Springer, Berlin (2001)"},{"issue":"2","key":"523_CR32","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1137\/100815001","volume":"27","author":"B Keszegh","year":"2013","unstructured":"Keszegh, B., Pach, J., P\u00e1lv\u00f6lgyi, D.: Drawing planar graphs of bounded degree with few slopes. SIAM J. Discrete Math. 27(2), 1171\u20131183 (2013)","journal-title":"SIAM J. Discrete Math."},{"issue":"1\u20133","key":"523_CR33","first-page":"69","volume":"81","author":"Y Liu","year":"1998","unstructured":"Liu, Y., Morgana, A., Simeone, B.: A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid. Discrete Appl. Math. 81(1\u20133), 69\u201391 (1998)","journal-title":"Discrete Appl. Math."},{"key":"523_CR34","first-page":"305","volume-title":"Graph Drawing, Volume 6502 of LNCS","author":"J Manuch","year":"2010","unstructured":"Manuch, J., Murray, P., Sheung-Hung, P., Thachuk, C.: Complexity of finding non-planar rectilinear drawings of graphs. In: Brandes, U., Cornelsen, S. (eds.) Graph Drawing, Volume 6502 of LNCS, pp. 305\u2013316. Springer, Berlin (2010)"},{"key":"523_CR35","unstructured":"N\u00f6llenburg, M.: Automated drawing of metro maps. Master\u2019s Thesis. Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t Karlsruhe (TH) (August 2005)"},{"issue":"5","key":"523_CR36","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1109\/TVCG.2010.81","volume":"17","author":"M N\u00f6llenburg","year":"2011","unstructured":"N\u00f6llenburg, M., Wolff, A.: Drawing and labeling high-quality metro maps by mixed-integer programming. IEEE Trans. Vis. Comput. Graph. 17(5), 626\u2013641 (2011)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"523_CR37","first-page":"138","volume-title":"SODA","author":"W Schnyder","year":"1990","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: Johnson, D.S. (ed.) SODA, pp. 138\u2013148. SIAM, San Francisco (1990)"},{"issue":"1","key":"523_CR38","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1109\/TVCG.2010.24","volume":"17","author":"JM Stott","year":"2011","unstructured":"Stott, J.M., Rodgers, P., Martinez-Ovando, J.C., Walker, S.G.: Automatic metro map layout using multicriteria optimization. IEEE Trans. Vis. Comput. Graph. 17(1), 101\u2013114 (2011)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"3","key":"523_CR39","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. Comput. 16(3), 421\u2013444 (1987)","journal-title":"SIAM J. Comput."},{"key":"523_CR40","volume-title":"Handbook on Graph Drawing and Visualization","year":"2013","unstructured":"Tamassia, R. (ed.): Handbook on Graph Drawing and Visualization. Chapman and Hall\/CRC, Boca Raton (2013)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-018-0523-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-018-0523-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-018-0523-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,27]],"date-time":"2019-10-27T06:57:32Z","timestamp":1572159452000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-018-0523-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,22]]},"references-count":40,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,5]]}},"alternative-id":["523"],"URL":"https:\/\/doi.org\/10.1007\/s00453-018-0523-5","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,10,22]]},"assertion":[{"value":"12 September 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 October 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 October 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}