{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:11:15Z","timestamp":1743102675592,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319130743"},{"type":"electronic","value":"9783319130750"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13075-0_50","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T16:37:06Z","timestamp":1415983026000},"page":"633-645","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Planar Embeddings with Small and Uniform Faces"],"prefix":"10.1007","author":[{"given":"Giordano","family":"Da Lozzo","sequence":"first","affiliation":[]},{"given":"V\u00edt","family":"Jel\u00ednek","sequence":"additional","affiliation":[]},{"given":"Jan","family":"Kratochv\u00edl","sequence":"additional","affiliation":[]},{"given":"Ignaz","family":"Rutter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,11,8]]},"reference":[{"key":"50_CR1","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1007\/s00453-009-9380-6","volume":"60","author":"P Angelini","year":"2011","unstructured":"Angelini, P., Di Battista, G., Patrignani, M.: Finding a minimum-depth embedding of a planar graph in $${O}(n^4)$$ time. Algorithmica 60, 890\u2013937 (2011)","journal-title":"Algorithmica"},{"issue":"1","key":"50_CR2","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1137\/0217004","volume":"17","author":"D Bienstock","year":"1988","unstructured":"Bienstock, D., Monma, C.L.: On the complexity of covering vertices by faces in a planar graph. SIAM J. Comput. 17(1), 53\u201376 (1988)","journal-title":"SIAM J. Comput."},{"key":"50_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 68, 859\u2013885 (2014)","journal-title":"Algorithmica"},{"key":"50_CR4","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":"50_CR5","doi-asserted-by":"crossref","unstructured":"Da Lozzo, G., Jel\u00ednek, V., Kratochv\u00edl, J., Rutter, I.: Planar Embeddings with Small and Uniform Faces. ArXiv e-prints (September 2014)","DOI":"10.1007\/978-3-319-13075-0_50"},{"issue":"6","key":"50_CR6","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 Journal on Computing 27(6), 1764\u20131811 (1998)","journal-title":"SIAM Journal on Computing"},{"key":"50_CR7","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 Di Battista","year":"1990","unstructured":"Di Battista, G., Tamassia, R.: On-line graph algorithms with SPQR-trees. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol. 443, pp. 598\u2013611. Springer, Heidelberg (1990)"},{"key":"50_CR8","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/BF01190507","volume":"13","author":"MR Fellows","year":"1995","unstructured":"Fellows, M.R., Kratochv\u00edl, J., Middendorf, M., Pfeiffer, F.: The complexity of induced minors and related problems. Algorithmica 13, 266\u2013282 (1995)","journal-title":"Algorithmica"},{"key":"50_CR9","doi-asserted-by":"crossref","unstructured":"Gabow, H.N.: An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems. In: Theory of Computing, STOC 1983, pp. 448\u2013456. ACM (1983)","DOI":"10.1145\/800061.808776"},{"issue":"2","key":"50_CR10","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 Comput. 31(2), 601\u2013625 (2001)","journal-title":"SIAM J. on Comput."},{"key":"50_CR11","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. 1984, pp. 77\u201390. Springer, Heidelberg (2001)"},{"key":"50_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-540-24595-7_24","volume-title":"Graph Drawing","author":"C Gutwenger","year":"2004","unstructured":"Gutwenger, C., Mutzel, P.: Graph embedding with minimum depth and maximum external face. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 259\u2013272. Springer, Heidelberg (2004)"},{"issue":"4","key":"50_CR13","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/s00454-001-0047-6","volume":"26","author":"C Moore","year":"2001","unstructured":"Moore, C., Robson, J.M.: Hard tiling problems with simple tiles. Discrete Comput. Geom. 26(4), 573\u2013590 (2001)","journal-title":"Discrete Comput. Geom."},{"key":"50_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/3-540-48777-8_27","volume-title":"Integer Programming and Combinatorial Optimization","author":"P Mutzel","year":"1999","unstructured":"Mutzel, P., Weiskircher, R.: Optimizing over all combinatorial embeddings of a planar graph. In: Cornu\u00e9jols, G., Burkard, R.E., Woeginger, G.J. (eds.) IPCO 1999. LNCS, vol. 1610, pp. 361\u2013376. Springer, Heidelberg (1999)"},{"key":"50_CR15","doi-asserted-by":"crossref","unstructured":"Woeginger, G.J.: Embeddings of planar graphs that minimize the number of long-face cycles. Oper. Res. Lett., 167\u2013168 (2002)","DOI":"10.1016\/S0167-6377(02)00119-0"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13075-0_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T00:42:58Z","timestamp":1674175378000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-13075-0_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319130743","9783319130750"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13075-0_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"8 November 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}