{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T15:04:02Z","timestamp":1725807842795},"publisher-location":"Cham","reference-count":21,"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_28","type":"book-chapter","created":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T06:12:53Z","timestamp":1417414373000},"page":"331-342","source":"Crossref","is-referenced-by-count":1,"title":["Planar Octilinear Drawings with One Bend Per Edge"],"prefix":"10.1007","author":[{"given":"Michael A.","family":"Bekos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Gronemann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Krug","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Bekos, M.A., Gronemann, M., Kaufmann, M., Krug, R.: Planar octilinear drawings with one bend per edge. Arxiv report arxiv.org\/abs\/1408.5920 (2014)","DOI":"10.1007\/978-3-662-45803-7_28"},{"key":"28_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/BFb0049394","volume-title":"Algorithms - ESA \u201994","author":"T.C. Biedl","year":"1994","unstructured":"Biedl, T.C., Kant, G.: A better heuristic for orthogonal graph drawings. In: van Leeuwen, J. (ed.) ESA 1994. LNCS, vol.\u00a0855, pp. 24\u201335. Springer, Heidelberg (1994)"},{"issue":"4","key":"28_CR3","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"},{"issue":"1","key":"28_CR4","doi-asserted-by":"publisher","first-page":"89","DOI":"10.7155\/jgaa.00083","volume":"8","author":"H.L. Bodlaender","year":"2004","unstructured":"Bodlaender, H.L., Tel, G.: A note on rectilinearity and angular resolution. Journal of Graph Algorithms and Applications\u00a08(1), 89\u201394 (2004)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1007\/BFb0032061","volume-title":"Automata, Languages and Programming","author":"G. Battista Di","year":"1990","unstructured":"Di Battista, G., Tamassia, R.: On-line graph algorithms with SPQR-trees. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol.\u00a0443, pp. 598\u2013611. Springer, Heidelberg (1990)"},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-642-54423-1_12","volume-title":"LATIN 2014: Theoretical Informatics","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 2014. LNCS, vol.\u00a08392, pp. 132\u2013143. Springer, Heidelberg (2014)"},{"issue":"2","key":"28_CR7","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"},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/3-540-44541-2_8","volume-title":"Graph Drawing","author":"C. Gutwenger","year":"2001","unstructured":"Gutwenger, C., Mutzel, P.: A linear time implementation of SPQR-trees. In: Marks, J. (ed.) GD 2000. LNCS, vol.\u00a01984, pp. 77\u201390. Springer, Heidelberg (2001)"},{"issue":"3","key":"28_CR9","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. Journal of Visual Languages and Computing\u00a017(3), 203\u2013224 (2006)","journal-title":"Journal of Visual Languages and Computing"},{"issue":"4","key":"28_CR10","doi-asserted-by":"publisher","first-page":"981","DOI":"10.1007\/s00373-012-1157-z","volume":"29","author":"V. Jel\u00ednek","year":"2013","unstructured":"Jel\u00ednek, V., Jel\u00ednkov\u00e1, E., Kratochv\u00edl, J., Lidick\u00fd, B., Tesar, M., Vyskocil, T.: The planar slope number of planar partial 3-trees of bounded degree. Graphs and Combinatorics\u00a029(4), 981\u20131005 (2013)","journal-title":"Graphs and Combinatorics"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Kant, G.: Drawing planar graphs using the lmc-ordering. In: 33rd Annual Symposium on Foundations of Computer Science (FOCS 1992), pp. 101\u2013110. IEEE (1992)","DOI":"10.1109\/SFCS.1992.267814"},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/3-540-56402-0_53","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"G. Kant","year":"1993","unstructured":"Kant, G.: Hexagonal grid drawings. In: Mayr, E.W. (ed.) WG 1992. LNCS, vol.\u00a0657, pp. 263\u2013276. Springer, Heidelberg (1993)"},{"issue":"2","key":"28_CR13","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 Journal of Discrete Mathematics\u00a027(2), 1171\u20131183 (2013)","journal-title":"SIAM Journal of Discrete Mathematics"},{"issue":"2","key":"28_CR14","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.comgeo.2007.05.003","volume":"40","author":"B. Keszegh","year":"2008","unstructured":"Keszegh, B., Pach, J., P\u00e1lv\u00f6lgyi, D., T\u00f3th, G.: Drawing cubic graphs with at most five slopes. Computational Geometry\u00a040(2), 138\u2013147 (2008)","journal-title":"Computational Geometry"},{"key":"28_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/978-3-319-03841-4_36","volume-title":"Graph Drawing","author":"W. Lenhart","year":"2013","unstructured":"Lenhart, W., Liotta, G., Mondal, D., Nishat, R.I.: Planar and plane slope number of partial 2-trees. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol.\u00a08242, pp. 412\u2013423. Springer, Heidelberg (2013)"},{"key":"28_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-642-25878-7_25","volume-title":"Graph Drawing","author":"P. Mukkamala","year":"2011","unstructured":"Mukkamala, P., P\u00e1lv\u00f6lgyi, D.: Drawing cubic graphs with the four basic slopes. In: van Kreveld, M., Speckmann, B. (eds.) GD 2011. LNCS, vol.\u00a07034, pp. 254\u2013265. Springer, Heidelberg (2011)"},{"key":"28_CR17","unstructured":"N\u00f6llenburg, M.: Automated drawings of metro maps. Tech. Rep. 2005-25, Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t Karlsruhe (2005)"},{"issue":"5","key":"28_CR18","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 Transactions on Visualization and Computer Graphics\u00a017(5), 626\u2013641 (2011)","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"issue":"1","key":"28_CR19","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1109\/TVCG.2010.24","volume":"17","author":"J.M. Stott","year":"2011","unstructured":"Stott, J.M., Rodgers, P., Martinez-Ovando, J.C., Walker, S.G.: Automatic metro map layout using multicriteria optimization. IEEE Transactions on Visualization and Computer Graphics\u00a017(1), 101\u2013114 (2011)","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"issue":"3","key":"28_CR20","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 of Computing\u00a016(3), 421\u2013444 (1987)","journal-title":"SIAM Journal of Computing"},{"key":"28_CR21","unstructured":"Wolff, A.: Graph drawing and cartography. In: Tamassia, R. (ed.) Handbook of Graph Drawing and Visualization, ch. 23, pp. 697\u2013736. CRC Press (2013)"}],"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_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T17:23:14Z","timestamp":1559064194000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-45803-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319125671","9783319125688"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-45803-7_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}