{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T01:53:34Z","timestamp":1725846814003},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662491911"},{"type":"electronic","value":"9783662491928"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-49192-8_10","type":"book-chapter","created":{"date-parts":[[2016,1,7]],"date-time":"2016-01-07T10:47:27Z","timestamp":1452163647000},"page":"121-133","source":"Crossref","is-referenced-by-count":3,"title":["Orthogonal Layout with Optimal Face Complexity"],"prefix":"10.1007","author":[{"given":"M.","family":"Jawaherul Alam","sequence":"first","affiliation":[]},{"given":"Stephen G.","family":"Kobourov","sequence":"additional","affiliation":[]},{"given":"Debajyoti","family":"Mondal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,1,8]]},"reference":[{"issue":"4","key":"10_CR1","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":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-642-39206-1_16","volume-title":"Automata, Languages, and Programming","author":"T Bl\u00e4sius","year":"2013","unstructured":"Bl\u00e4sius, T., Rutter, I., Wagner, D.: Optimal orthogonal graph drawing with convex bend costs. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part I. LNCS, vol. 7965, pp. 184\u2013195. Springer, Heidelberg (2013)"},{"key":"10_CR3","unstructured":"Chimani, M., Gutwenger, C., J\u00fcnger, M., Klau, G., Klein, K., Mutzel, P.: The open graph drawing framework. In: Handbook of Graph Drawing and Visualization, pp. 543\u2013571 (2013)"},{"issue":"3","key":"10_CR4","doi-asserted-by":"publisher","first-page":"635","DOI":"10.7155\/jgaa.00265","volume":"16","author":"S Cornelsen","year":"2012","unstructured":"Cornelsen, S., Karrenbauer, A.: Acclerated bend minimization. J. Graph Algorithms Appl. 16(3), 635\u2013650 (2012)","journal-title":"J. Graph Algorithms Appl."},{"issue":"3","key":"10_CR5","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1142\/S0218195912500045","volume":"22","author":"M Berg de","year":"2012","unstructured":"de Berg, M., Khosravi, A.: Optimal binary space partitions for segments in the plane. Int. J. Comput. Geom. Appl. 22(3), 187\u2013206 (2012)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"10_CR6","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"G Battista Di","year":"2009","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs, 3rd edn. The MIT Press, Cambridge (2009)","edition":"3"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/3-540-45848-4_57","volume-title":"Graph Drawing","author":"J Ellson","year":"2002","unstructured":"Ellson, J., Gansner, E.R., Koutsofios, L., North, S.C., Woodhull, G.: Graphviz\u2014open source graph drawing tools. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) GD 2001. LNCS, vol. 2265, p. 483. Springer, Heidelberg (2002)"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/BFb0021809","volume-title":"Graph Drawing","author":"U F\u00f6\u00dfmeier","year":"1996","unstructured":"F\u00f6\u00dfmeier, U., Kaufmann, M.: Drawing high degree graphs with low bend numbers. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol. 1027, pp. 254\u2013266. Springer, Heidelberg (1996)"},{"issue":"2","key":"10_CR9","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."},{"issue":"4","key":"10_CR10","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"JE Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An \n                      \n                        \n                      \n                      $$n^{5\/2}$$\n                     algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2(4), 225\u2013231 (1973)","journal-title":"SIAM J. Comput."},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44969-8","volume-title":"Drawing Graphs: Methods and Models","author":"M Kaufmann","year":"2001","unstructured":"Kaufmann, M., Wagner, D.: Drawing Graphs: Methods and Models. LNCS, vol. 2025. Springer, London (2001)"},{"key":"10_CR12","unstructured":"Kempe, D.: On the complexity of the \u201creflections\u201d game (2003). \n                      http:\/\/www-bcf.usc.edu\/dkempe\/publications\/reflections.pdf"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Leiserson, C.E.: Area-efficient graph layouts (for VLSI). In: Symposium on Foundations of Computer Science (FOCS), pp. 270\u2013281 (1980)","DOI":"10.1109\/SFCS.1980.13"},{"key":"10_CR14","volume-title":"Introduction to Algorithms","author":"CE Leiserson","year":"1999","unstructured":"Leiserson, C.E., Cormen, T.H., Stein, C., Rivest, R.: Introduction to Algorithms. Prentice Hall, Englewood Cliffs (1999)"},{"issue":"2\u20133","key":"10_CR15","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. Int. J. Comput. Geom. Appl. 16(2\u20133), 249\u2013270 (2006)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"10_CR16","doi-asserted-by":"publisher","DOI":"10.1142\/5648","volume-title":"Planar Graph Drawing","author":"T Nishizeki","year":"2004","unstructured":"Nishizeki, T., Rahman, M.S.: Planar Graph Drawing. World Scientific, Singapore (2004)"},{"issue":"1","key":"10_CR17","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1093\/ietisy\/E88-D.1.23","volume":"88\u2013D","author":"MS Rahman","year":"2005","unstructured":"Rahman, M.S., Egi, N., Nishizeki, T.: No-bend orthogonal drawings of subdivisions of planar triconnected cubic graphs. IEICE Trans. 88\u2013D(1), 23\u201330 (2005)","journal-title":"IEICE Trans."},{"issue":"3","key":"10_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. Comput. 16(3), 421\u2013444 (1987)","journal-title":"SIAM J. Comput."},{"key":"10_CR19","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1111\/j.1467-8306.2004.09401004.x","volume":"94","author":"W Tobler","year":"2004","unstructured":"Tobler, W.: Thirty five years of computer cartograms. Ann. Assoc. Am. Geogr. 94, 58\u201373 (2004)","journal-title":"Ann. Assoc. Am. Geogr."},{"issue":"2","key":"10_CR20","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1109\/TC.1981.6312176","volume":"30","author":"LG Valiant","year":"1981","unstructured":"Valiant, L.G.: Universality considerations in VLSI circuits. IEEE Trans. Comput. 30(2), 135\u2013140 (1981)","journal-title":"IEEE Trans. Comput."},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/3-540-45848-4_42","volume-title":"Graph Drawing","author":"R Wiese","year":"2002","unstructured":"Wiese, R., Eiglsperger, M., Kaufmann, M.: yFiles: visualization and automatic layout of graphs. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) GD 2001. LNCS, vol. 2265, pp. 453\u2013454. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2016: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49192-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T04:47:49Z","timestamp":1559364469000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49192-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662491911","9783662491928"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49192-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}