{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T02:14:31Z","timestamp":1767924871552,"version":"3.49.0"},"publisher-location":"Cham","reference-count":50,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031222023","type":"print"},{"value":"9783031222030","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-22203-0_10","type":"book-chapter","created":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T08:04:02Z","timestamp":1674029042000},"page":"127-143","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Unit-length Rectangular Drawings of\u00a0Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5512-5298","authenticated-orcid":false,"given":"Carlos","family":"Alegr\u00eda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2396-5174","authenticated-orcid":false,"given":"Giordano","family":"Da Lozzo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4224-1550","authenticated-orcid":false,"given":"Giuseppe","family":"Di Battista","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5987-8713","authenticated-orcid":false,"given":"Fabrizio","family":"Frati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5766-4567","authenticated-orcid":false,"given":"Fabrizio","family":"Grosso","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9806-7411","authenticated-orcid":false,"given":"Maurizio","family":"Patrignani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,19]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","unstructured":"Abel, Z., Demaine, E.D., Demaine, M.L., Eisenstat, S., Lynch, J., Schardl, T.B.: Who needs crossings? Hardness of plane graph rigidity. In: Fekete, S.P., Lubiw, A. (eds.) 32nd International Symposium on Computational Geometry (SoCG 2016). LIPIcs, vol. 51, pp. 3:1\u20133:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2016.3","DOI":"10.4230\/LIPIcs.SoCG.2016.3"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-030-92931-2_12","volume-title":"Graph Drawing and Network Visualization","author":"C Alegr\u00eda","year":"2021","unstructured":"Alegr\u00eda, C., Borrazzo, M., Da Lozzo, G., Di Battista, G., Frati, F., Patrignani, M.: Planar straight-line realizations of\u00a02-trees with\u00a0prescribed edge lengths. In: Purchase, H.C., Rutter, I. (eds.) GD 2021. LNCS, vol. 12868, pp. 166\u2013183. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92931-2_12"},{"key":"10_CR3","unstructured":"Alegr\u00eda, C., Da Lozzo, G., Di Battista, G., Frati, F., Grosso, F., Patrignani, M.: Unit-length rectangular drawings of graphs. CoRR abs\/2208.14142 (2022). https:\/\/arxiv.org\/abs\/2208.14142"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/978-3-662-45803-7_34","volume-title":"Graph Drawing","author":"P Angelini","year":"2014","unstructured":"Angelini, P., et al.: Anchored drawings of planar graphs. In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp. 404\u2013415. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45803-7_34"},{"key":"10_CR5","doi-asserted-by":"publisher","unstructured":"Angelini, P., Da Lozzo, G., Frati, F., Lubiw, A., Patrignani, M., Roselli, V.: Optimal morphs of convex drawings. In: Arge, L., Pach, J. (eds.) 31st International Symposium on Computational Geometry, SoCG 2015, 22\u201325 June 2015, Eindhoven, The Netherlands. LIPIcs, vol. 34, pp. 126\u2013140. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2015). https:\/\/doi.org\/10.4230\/LIPIcs.SOCG.2015.126","DOI":"10.4230\/LIPIcs.SOCG.2015.126"},{"issue":"4","key":"10_CR6","doi-asserted-by":"publisher","first-page":"1322","DOI":"10.1007\/s11227-016-1811-y","volume":"73","author":"A Asgharian Sardroud","year":"2016","unstructured":"Asgharian Sardroud, A., Bagheri, A.: Embedding cycles and paths on solid grid graphs. J. Supercomputing 73(4), 1322\u20131336 (2016). https:\/\/doi.org\/10.1007\/s11227-016-1811-y","journal-title":"J. Supercomputing"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Beck, M., Storandt, S.: Puzzling grid embeddings. In: Blelloch, G.E., Finocchi, I. (eds.) Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2020, Salt Lake City, UT, USA, 5\u20136 January 2020, pp. 94\u2013105. SIAM (2020)","DOI":"10.1137\/1.9781611976007.8"},{"issue":"03","key":"10_CR8","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1142\/S0218195912500045","volume":"22","author":"M de Berg","year":"2012","unstructured":"de Berg, M., Khosravi, A.: Optimal binary space partitions for segments in the plane. Int. J. Comput. Geom. Appl. 22(03), 187\u2013205 (2012). https:\/\/doi.org\/10.1142\/S0218195912500045","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"4","key":"10_CR9","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0020-0190(87)90173-6","volume":"25","author":"SN Bhatt","year":"1987","unstructured":"Bhatt, S.N., Cosmadakis, S.S.: The complexity of minimizing wire lengths in VLSI layouts. Inf. Process. Lett. 25(4), 263\u2013267 (1987). https:\/\/doi.org\/10.1016\/0020-0190(87)90173-6","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"10_CR10","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). https:\/\/doi.org\/10.1016\/S0925-7721(97)00026-6","journal-title":"Comput. Geom."},{"issue":"4","key":"10_CR11","doi-asserted-by":"publisher","first-page":"1280","DOI":"10.1137\/15M1042929","volume":"46","author":"G Borradaile","year":"2017","unstructured":"Borradaile, G., Klein, P.N., Mozes, S., Nussbaum, Y., Wulff-Nilsen, C.: Multiple-source multiple-sink maximum flow in directed planar graphs in near-linear time. SIAM J. Comput. 46(4), 1280\u20131303 (2017). https:\/\/doi.org\/10.1137\/15M1042929","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10_CR12","doi-asserted-by":"publisher","first-page":"259","DOI":"10.7155\/jgaa.00145","volume":"11","author":"S Cabello","year":"2007","unstructured":"Cabello, S., Demaine, E.D., Rote, G.: Planar embeddings of graphs with specified edge lengths. J. Graph Algorithms Appl. 11(1), 259\u2013276 (2007). https:\/\/doi.org\/10.7155\/jgaa.00145","journal-title":"J. Graph Algorithms Appl."},{"key":"10_CR13","doi-asserted-by":"publisher","unstructured":"Chang, Y., Yen, H.: On bend-minimized orthogonal drawings of planar 3-graphs. In: 33rd International Symposium on Computational Geometry, SoCG 2017, 4\u20137 July 2017, Brisbane, Australia, pp. 29:1\u201329:15 (2017). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2017.29","DOI":"10.4230\/LIPIcs.SoCG.2017.29"},{"issue":"3","key":"10_CR14","doi-asserted-by":"publisher","first-page":"635","DOI":"10.7155\/jgaa.00265","volume":"16","author":"S Cornelsen","year":"2012","unstructured":"Cornelsen, S., Karrenbauer, A.: Accelerated bend minimization. J. Graph Algorithms Appl. 16(3), 635\u2013650 (2012). https:\/\/doi.org\/10.7155\/jgaa.00265","journal-title":"J. Graph Algorithms Appl."},{"key":"10_CR15","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall (1999)"},{"issue":"6","key":"10_CR16","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 J. Comput. 27(6), 1764\u20131811 (1998). https:\/\/doi.org\/10.1137\/S0097539794262847","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10_CR17","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/BF01961541","volume":"15","author":"G Di Battista","year":"1996","unstructured":"Di Battista, G., Tamassia, R.: On-line maintenance of triconnected components with SPQR-trees. Algorithmica 15(4), 302\u2013318 (1996). https:\/\/doi.org\/10.1007\/BF01961541","journal-title":"Algorithmica"},{"issue":"5","key":"10_CR18","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1137\/S0097539794280736","volume":"25","author":"G Di Battista","year":"1996","unstructured":"Di Battista, G., Tamassia, R.: On-line planarity testing. SIAM J. Comput. 25(5), 956\u2013997 (1996)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10_CR19","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1006\/inco.2001.3031","volume":"169","author":"G Di Battista","year":"2001","unstructured":"Di Battista, G., Tamassia, R., Vismara, L.: Incremental convex planarity testing. Inf. Comput. 169(1), 94\u2013126 (2001). https:\/\/doi.org\/10.1006\/inco.2001.3031","journal-title":"Inf. Comput."},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1007\/978-3-030-68766-3_34","volume-title":"Graph Drawing and Network Visualization","author":"W Didimo","year":"2020","unstructured":"Didimo, W., Kaufmann, M., Liotta, G., Ortali, G.: Rectilinear planarity testing of plane series-parallel graphs in linear time. In: GD 2020. LNCS, vol. 12590, pp. 436\u2013449. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-68766-3_34"},{"key":"10_CR21","doi-asserted-by":"publisher","unstructured":"Didimo, W., Liotta, G., Ortali, G., Patrignani, M.: Optimal orthogonal drawings of planar 3-graphs in linear time. In: Chawla, S. (ed.) Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA 2020), pp. 806\u2013825. ACM-SIAM (2020). https:\/\/doi.org\/10.1137\/1.9781611975994.49","DOI":"10.1137\/1.9781611975994.49"},{"issue":"2","key":"10_CR22","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0166-218X(90)90110-X","volume":"28","author":"P Eades","year":"1990","unstructured":"Eades, P., Wormald, N.C.: Fixed edge-length graph drawing is NP-hard. Disc. Appl. Math. 28(2), 111\u2013134 (1990). https:\/\/doi.org\/10.1016\/0166-218X(90)90110-X","journal-title":"Disc. Appl. Math."},{"key":"10_CR23","doi-asserted-by":"publisher","unstructured":"Felsner, S.: Rectangle and square representations of planar graphs. In: Pach, J. (ed.) Thirty Essays on Geometric Graph Theory, pp. 213\u2013248. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4614-0110-0_12","DOI":"10.1007\/978-1-4614-0110-0_12"},{"key":"10_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-030-68766-3_33","volume-title":"Graph Drawing and Network Visualization","author":"F Frati","year":"2020","unstructured":"Frati, F.: Planar rectilinear drawings of outerplanar graphs in linear time. In: Auber, D., Valtr, P. (eds.) GD 2020. LNCS, vol. 12590, pp. 423\u2013435. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-68766-3_33"},{"key":"10_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/3-540-46648-7_4","volume-title":"Graph Drawing","author":"A Garg","year":"1999","unstructured":"Garg, A., Liotta, G.: Almost bend-optimal planar orthogonal drawings of biconnected degree-3 planar graphs in quadratic time. In: Kratochv\u00edyl, J. (ed.) GD 1999. LNCS, vol. 1731, pp. 38\u201348. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-46648-7_4"},{"issue":"2","key":"10_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). https:\/\/doi.org\/10.1137\/S0097539794277123","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10_CR27","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0020-0190(89)90118-X","volume":"31","author":"A Gregori","year":"1989","unstructured":"Gregori, A.: Unit-length embedding of binary trees on a square grid. Inf. Process. Lett. 31(4), 167\u2013173 (1989). https:\/\/doi.org\/10.1016\/0020-0190(89)90118-X","journal-title":"Inf. Process. Lett."},{"key":"10_CR28","doi-asserted-by":"publisher","unstructured":"Gupta, S., Sa\u2019ar, G., Zehavi, M.: Grid recognition: classical and parameterized computational perspectives (2021). https:\/\/doi.org\/10.48550\/ARXIV.2106.16180","DOI":"10.48550\/ARXIV.2106.16180"},{"key":"10_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-030-26176-4_21","volume-title":"Computing and Combinatorics","author":"MM Hasan","year":"2019","unstructured":"Hasan, M.M., Rahman, M.S.: No-bend orthogonal drawings and no-bend orthogonally convex drawings of planar graphs (extended abstract). In: Du, D.-Z., Duan, Z., Tian, C. (eds.) COCOON 2019. LNCS, vol. 11653, pp. 254\u2013265. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26176-4_21"},{"issue":"6","key":"10_CR30","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1145\/362248.362272","volume":"16","author":"J Hopcroft","year":"1973","unstructured":"Hopcroft, J., Tarjan, R.: Algorithm 447: efficient algorithms for graph manipulation. Commun. ACM 16(6), 372\u2013378 (1973). https:\/\/doi.org\/10.1145\/362248.362272","journal-title":"Commun. ACM"},{"issue":"4","key":"10_CR31","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1137\/0211056","volume":"11","author":"A Itai","year":"1982","unstructured":"Itai, A., Papadimitriou, C.H., Szwarcfiter, J.L.: Hamilton paths in grid graphs. SIAM J. Comput. 11(4), 676\u2013686 (1982). https:\/\/doi.org\/10.1137\/0211056","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10_CR32","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). https:\/\/doi.org\/10.1007\/BF02086606","journal-title":"Algorithmica"},{"issue":"1\u20133","key":"10_CR33","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0166-218X(97)00076-0","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). https:\/\/doi.org\/10.1016\/S0166-218X(97)00076-0","journal-title":"Discrete Appl. Math."},{"issue":"2\u20133","key":"10_CR34","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). https:\/\/doi.org\/10.1142\/S0218195906002026","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"10_CR35","doi-asserted-by":"publisher","unstructured":"Nishizeki, T., Rahman, M.S.: Planar Graph Drawing, Lecture Notes Series on Computing, vol. 12. World Scientific (2004). https:\/\/doi.org\/10.1142\/5648","DOI":"10.1142\/5648"},{"key":"10_CR36","unstructured":"Nishizeki, T., Rahman, M.S.: Rectangular drawing algorithms. In: Tamassia, R. (ed.) Handbook on Graph Drawing and Visualization, pp. 317\u2013348. Chapman and Hall\/CRC (2013)"},{"key":"10_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/11618058_37","volume-title":"Graph Drawing","author":"MS 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. 3843, pp. 409\u2013420. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11618058_37"},{"key":"10_CR38","doi-asserted-by":"crossref","unstructured":"Rahman, M.S., Egi, N., Nishizeki, T.: No-bend orthogonal drawings of subdivisions of planar triconnected cubic graphs. IEICE Trans. 88-D(1), 23\u201330 (2005)","DOI":"10.1093\/ietisy\/E88-D.1.23"},{"issue":"3","key":"10_CR39","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/S0925-7721(98)00003-0","volume":"10","author":"MS Rahman","year":"1998","unstructured":"Rahman, M.S., Nakano, S., Nishizeki, T.: Rectangular grid drawings of plane graphs. Comput. Geom. 10(3), 203\u2013220 (1998). https:\/\/doi.org\/10.1016\/S0925-7721(98)00003-0","journal-title":"Comput. Geom."},{"key":"10_CR40","doi-asserted-by":"crossref","unstructured":"Rahman, M.S., Nakano, S., Nishizeki, T.: A linear algorithm for bend-optimal orthogonal drawings of triconnected cubic plane graphs. J. Graph Algorithms Appl. 3(4), 31\u201362 (1999). http:\/\/www.cs.brown.edu\/publications\/jgaa\/accepted\/99\/SaidurNakanoNishizeki99.3.4.pdf","DOI":"10.7155\/jgaa.00017"},{"key":"10_CR41","doi-asserted-by":"publisher","unstructured":"Rahman, M.S., Nishizeki, T.: Bend-minimum orthogonal drawings of plane 3-graphs. In: Graph-Theoretic Concepts in Computer Science, 28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, 13\u201315 June 2002, Revised Papers, pp. 367\u2013378 (2002). https:\/\/doi.org\/10.1007\/3-540-36379-3_32","DOI":"10.1007\/3-540-36379-3_32"},{"issue":"1","key":"10_CR42","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/S0196-6774(03)00126-3","volume":"50","author":"MS Rahman","year":"2004","unstructured":"Rahman, M.S., Nishizeki, T., Ghosh, S.: Rectangular drawings of planar graphs. J. Algorithms 50(1), 62\u201378 (2004). https:\/\/doi.org\/10.1016\/S0196-6774(03)00126-3","journal-title":"J. Algorithms"},{"key":"10_CR43","doi-asserted-by":"crossref","unstructured":"Rahman, M.S., Nishizeki, T., Naznin, M.: Orthogonal drawings of plane graphs without bends. J. Graph Algorithms Appl. 7(4), 335\u2013362 (2003). http:\/\/jgaa.info\/accepted\/2003\/Rahman+2003.7.4.pdf","DOI":"10.7155\/jgaa.00074"},{"key":"10_CR44","doi-asserted-by":"publisher","unstructured":"Schaefer, M.: Realizability of graphs and linkages. In: Pach, J. (ed.) Thirty Essays on Geometric Graph Theory, pp. 461\u2013482. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4614-0110-0_24","DOI":"10.1007\/978-1-4614-0110-0_24"},{"key":"10_CR45","doi-asserted-by":"publisher","unstructured":"Storer, J.A.: The node cost measure for embedding graphs on the planar grid (extended abstract). In: Miller, R.E., Ginsburg, S., Burkhard, W.A., Lipton, R.J. (eds.) Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 28\u201330 April 1980, Los Angeles, California, USA, pp. 201\u2013210. ACM (1980). https:\/\/doi.org\/10.1145\/800141.804667","DOI":"10.1145\/800141.804667"},{"issue":"3","key":"10_CR46","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). https:\/\/doi.org\/10.1137\/0216030","journal-title":"SIAM J. Comput."},{"key":"10_CR47","first-page":"43","volume-title":"Progress in Graph Theory","author":"C Thomassen","year":"1987","unstructured":"Thomassen, C.: Plane representations of graphs. In: Bondy, J., Murty, U. (eds.) Progress in Graph Theory, pp. 43\u201369. Academic Press, Toronto, Orlando (1987)"},{"key":"10_CR48","doi-asserted-by":"publisher","unstructured":"Ungar, P.: On Diagrams Representing Maps. J. London Math. Soc. s1\u201328(3), 336\u2013342 (1953). https:\/\/doi.org\/10.1112\/jlms\/s1-28.3.336","DOI":"10.1112\/jlms\/s1-28.3.336"},{"issue":"2","key":"10_CR49","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 J. Comput. 14(2), 355\u2013372 (1985)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10_CR50","doi-asserted-by":"publisher","first-page":"1570","DOI":"10.1137\/060667621","volume":"22","author":"X Zhou","year":"2008","unstructured":"Zhou, X., Nishizeki, T.: Orthogonal drawings of series-parallel graphs with minimum bends. SIAM J. Discrete Math. 22(4), 1570\u20131604 (2008). https:\/\/doi.org\/10.1137\/060667621","journal-title":"SIAM J. Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22203-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,4]],"date-time":"2024-01-04T07:03:51Z","timestamp":1704351831000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22203-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031222023","9783031222030"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22203-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"19 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tokyo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/graphdrawing.github.io\/gd2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"70","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.01","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7.03","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}