{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T06:23:24Z","timestamp":1769581404909,"version":"3.49.0"},"publisher-location":"Cham","reference-count":47,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030929305","type":"print"},{"value":"9783030929312","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-92931-2_12","type":"book-chapter","created":{"date-parts":[[2021,12,22]],"date-time":"2021-12-22T11:14:17Z","timestamp":1640171657000},"page":"166-183","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Planar Straight-Line Realizations of\u00a02-Trees with\u00a0Prescribed Edge Lengths"],"prefix":"10.1007","author":[{"given":"Carlos","family":"Alegr\u00eda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"Borrazzo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giordano","family":"Da Lozzo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe","family":"Di Battista","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabrizio","family":"Frati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurizio","family":"Patrignani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,23]]},"reference":[{"key":"12_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":"12_CR2","doi-asserted-by":"crossref","unstructured":"Alegr\u00eda, C., Borrazzo, M., Da Lozzo, G., Di Battista, G., Frati, F., Patrignani, M.: Planar straight-line realizations of 2-trees with prescribed edge lengths. CoRR abs\/2108.09483 (2021). https:\/\/arxiv.org\/abs\/2108.09483","DOI":"10.1007\/978-3-030-92931-2_12"},{"issue":"3","key":"12_CR3","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/j.comgeo.2014.10.006","volume":"48","author":"N Alon","year":"2015","unstructured":"Alon, N., Feldheim, O.N.: Drawing outerplanar graphs using three edge lengths. Comput. Geom. 48(3), 260\u2013267 (2015). https:\/\/doi.org\/10.1016\/j.comgeo.2014.10.006","journal-title":"Comput. Geom."},{"key":"12_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":"12_CR5","doi-asserted-by":"publisher","unstructured":"Angelini, P., et al.: Windrose planarity: embedding graphs with direction-constrained edges. ACM Trans. Algorithms 14(4), 54:1\u201354:24 (2018). https:\/\/doi.org\/10.1145\/3239561","DOI":"10.1145\/3239561"},{"issue":"3","key":"12_CR6","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","volume":"8","author":"B Aspvall","year":"1979","unstructured":"Aspvall, B., Plass, M.F., Tarjan, R.E.: A linear-time algorithm for testing the truth of certain quantified boolean formulas. Inf. Process. Lett. 8(3), 121\u2013123 (1979). https:\/\/doi.org\/10.1016\/0020-0190(79)90002-4","journal-title":"Inf. Process. Lett."},{"key":"12_CR7","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1142\/S0218195912500045","DOI":"10.1142\/S0218195912500045"},{"issue":"2","key":"12_CR8","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1145\/301970.301972","volume":"46","author":"B Berger","year":"1999","unstructured":"Berger, B., Kleinberg, J.M., Leighton, F.T.: Reconstructing a three-dimensional model with arbitrary errors. J. ACM 46(2), 212\u2013235 (1999). https:\/\/doi.org\/10.1145\/301970.301972","journal-title":"J. ACM"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-030-68766-3_7","volume-title":"Graph Drawing and Network Visualization","author":"V Bla\u017eej","year":"2020","unstructured":"Bla\u017eej, V., Fiala, J., Liotta, G.: On the edge-length ratio of 2-trees. In: GD 2020. LNCS, vol. 12590, pp. 85\u201398. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-68766-3_7"},{"key":"12_CR10","doi-asserted-by":"publisher","unstructured":"Borrazzo, M., Frati, F.: On the planar edge-length ratio of planar graphs. J. Comput. Geom. 11(1), 137\u2013155 (2020). https:\/\/doi.org\/10.20382\/jocg.v11i1a6","DOI":"10.20382\/jocg.v11i1a6"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-540-70904-6_7","volume-title":"Graph Drawing","author":"U Brandes","year":"2007","unstructured":"Brandes, U., Schlieper, B.: Angle and distance constraints on tree drawings. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 54\u201365. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70904-6_7"},{"issue":"1","key":"12_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."},{"issue":"2","key":"12_CR13","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1023\/A:1013933626682","volume":"5","author":"S Capkun","year":"2002","unstructured":"Capkun, S., Hamdi, M., Hubaux, J.: GPS-free positioning in mobile ad hoc networks. Clust. Comput. 5(2), 157\u2013167 (2002). https:\/\/doi.org\/10.1023\/A:1013933626682","journal-title":"Clust. Comput."},{"issue":"4","key":"12_CR14","doi-asserted-by":"publisher","first-page":"657","DOI":"10.7155\/jgaa.00524","volume":"24","author":"S Chaplick","year":"2020","unstructured":"Chaplick, S.: Recognizing stick graphs with and without length constraints. J. Graph Algorithms Appl. 24(4), 657\u2013681 (2020). https:\/\/doi.org\/10.7155\/jgaa.00524","journal-title":"J. Graph Algorithms Appl."},{"issue":"3","key":"12_CR15","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/BF02574703","volume":"6","author":"B Chazelle","year":"1991","unstructured":"Chazelle, B.: Triangulating a simple polygon in linear time. Discrete Comput. Geom. 6(3), 485\u2013524 (1991). https:\/\/doi.org\/10.1007\/BF02574703","journal-title":"Discrete Comput. Geom."},{"key":"12_CR16","doi-asserted-by":"publisher","unstructured":"Connelly, R.: On generic global rigidity. In: Gritzmann, P., Sturmfels, B. (eds.) Proceedings of a DIMACS Workshop on Applied Geometry And Discrete Mathematics. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 4, pp. 147\u2013156. DIMACS\/AMS (1990). https:\/\/doi.org\/10.1090\/dimacs\/004\/11","DOI":"10.1090\/dimacs\/004\/11"},{"issue":"4","key":"12_CR17","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1142\/S0218195992000202","volume":"2","author":"CR Coullard","year":"1992","unstructured":"Coullard, C.R., Lubiw, A.: Distance visibility graphs. Int. J. Comput. Geom. Appl. 2(4), 349\u2013362 (1992). https:\/\/doi.org\/10.1142\/S0218195992000202","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"12_CR18","doi-asserted-by":"publisher","unstructured":"Da Lozzo, G., Devanny, W.E., Eppstein, D., Johnson, T.: Square-contact representations of partial 2-trees and triconnected simply-nested graphs. In: Okamoto, Y., Tokuyama, T. (eds.) 28th International Symposium on Algorithms and Computation (ISAAC 2017). LIPIcs, vol. 92, pp. 24:1\u201324:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017). https:\/\/doi.org\/10.4230\/LIPIcs.ISAAC.2017.24","DOI":"10.4230\/LIPIcs.ISAAC.2017.24"},{"key":"12_CR19","unstructured":"Deng, T.: On the implementation and refinement of outerplanar graph algorithms. Master\u2019s thesis, University of Windsor, Ontario, Canada (2007)"},{"issue":"3\u20134","key":"12_CR20","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/S0925-7721(98)00039-X","volume":"11","author":"O Devillers","year":"1998","unstructured":"Devillers, O., Liotta, G., Preparata, F.P., Tamassia, R.: Checking the convexity of polytopes and the planarity of subdivisions. Comput. Geom. 11(3\u20134), 187\u2013208 (1998). https:\/\/doi.org\/10.1016\/S0925-7721(98)00039-X","journal-title":"Comput. Geom."},{"key":"12_CR21","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"G Di Battista","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Hoboken (1999)"},{"issue":"5","key":"12_CR22","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). https:\/\/doi.org\/10.1137\/S0097539794280736","journal-title":"SIAM J. Comput."},{"issue":"1","key":"12_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0020-0190(92)90072-4","volume":"41","author":"G Di Battista","year":"1992","unstructured":"Di Battista, G., Tamassia, R., Tollis, I.G.: Constrained visibility representations of graphs. Inf. Process. Lett. 41(1), 1\u20137 (1992). https:\/\/doi.org\/10.1016\/0020-0190(92)90072-4","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"12_CR24","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.jda.2006.12.007","volume":"6","author":"E Di Giacomo","year":"2008","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G.: Radial drawings of graphs: Geometric constraints and trade-offs. J. Discrete Algorithms 6(1), 109\u2013124 (2008). https:\/\/doi.org\/10.1016\/j.jda.2006.12.007","journal-title":"J. Discrete Algorithms"},{"key":"12_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-030-68211-8_20","volume-title":"WALCOM: Algorithms and Computation","author":"E Di Giacomo","year":"2021","unstructured":"Di Giacomo, E., Han\u010dl, J., Liotta, Gi.: 2-Colored point-set embeddings of partial 2-trees. In: Uehara, R., Hong, S., Nandy, S.C. (eds.) WALCOM 2021. LNCS, vol. 12635, pp. 247\u2013259. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-68211-8_20"},{"issue":"2","key":"12_CR26","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."},{"issue":"3","key":"12_CR27","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1002\/jgt.20304","volume":"58","author":"J Geelen","year":"2008","unstructured":"Geelen, J., Guo, A., McKinnon, D.: Straight line embeddings of cubic planar graphs with integer edge lengths. J. Graph Theory 58(3), 270\u2013274 (2008). https:\/\/doi.org\/10.1002\/jgt.20304","journal-title":"J. Graph Theory"},{"key":"12_CR28","unstructured":"Goodrich, M.T., Johnson, T.: Low ply drawings of trees and 2-trees. In: Durocher, S., Kamali, S. (eds.) Proceedings of the 30th Canadian Conference on Computational Geometry (CCCG 2018), pp. 2\u201310 (2018), http:\/\/www.cs.umanitoba.ca\/%7Ecccg2018\/papers\/session1A-p1.pdf"},{"key":"12_CR29","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). https:\/\/doi.org\/10.1007\/3-540-44541-2_8"},{"issue":"1","key":"12_CR30","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1137\/0221008","volume":"21","author":"B Hendrickson","year":"1992","unstructured":"Hendrickson, B.: Conditions for unique graph realizations. SIAM J. Comput. 21(1), 65\u201384 (1992). https:\/\/doi.org\/10.1137\/0221008","journal-title":"SIAM J. Comput."},{"issue":"4","key":"12_CR31","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1137\/0805040","volume":"5","author":"B Hendrickson","year":"1995","unstructured":"Hendrickson, B.: The molecule problem: exploiting structure in global optimization. SIAM J. Optim. 5(4), 835\u2013857 (1995). https:\/\/doi.org\/10.1137\/0805040","journal-title":"SIAM J. Optim."},{"key":"12_CR32","doi-asserted-by":"publisher","unstructured":"Jackson, B., Jord\u00e1n, T.: Connected rigidity matroids and unique realizations of graphs. J. Comb. Theory, Ser. B 94(1), 1\u201329 (2005). https:\/\/doi.org\/10.1016\/j.jctb.2004.11.002","DOI":"10.1016\/j.jctb.2004.11.002"},{"key":"12_CR33","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. 8242, pp. 412\u2013423. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03841-4_36"},{"key":"12_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-030-04414-5_28","volume-title":"Graph Drawing and Network Visualization","author":"A Lubiw","year":"2018","unstructured":"Lubiw, A., Miltzow, T., Mondal, D.: The complexity of drawing a graph in a polygonal region. In: Biedl, T., Kerren, A. (eds.) GD 2018. LNCS, vol. 11282, pp. 387\u2013401. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-04414-5_28"},{"issue":"1","key":"12_CR35","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0020-0190(87)90086-X","volume":"25","author":"AA Melkman","year":"1987","unstructured":"Melkman, A.A.: On-line construction of the convex hull of a simple polyline. Inf. Process. Lett. 25(1), 11\u201312 (1987). https:\/\/doi.org\/10.1016\/0020-0190(87)90086-X","journal-title":"Inf. Process. Lett."},{"issue":"5","key":"12_CR36","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0020-0190(79)90075-9","volume":"9","author":"SL Mitchell","year":"1979","unstructured":"Mitchell, S.L.: Linear algorithms to recognize outerplanar and maximal outerplanar graphs. Inf. Process. Lett. 9(5), 229\u2013232 (1979). https:\/\/doi.org\/10.1016\/0020-0190(79)90075-9","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"12_CR37","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1137\/0403034","volume":"3","author":"S Moran","year":"1990","unstructured":"Moran, S., Wolfstahl, Y.: One-page book embedding under vertex-neighborhood constraints. SIAM J. Discrete Math. 3(3), 376\u2013390 (1990). https:\/\/doi.org\/10.1137\/0403034","journal-title":"SIAM J. Discrete Math."},{"key":"12_CR38","doi-asserted-by":"publisher","unstructured":"Priyantha, N.B., Chakraborty, A., Balakrishnan, H.: The cricket location-support system. In: Pickholtz, R.L., Das, S.K., C\u00e1ceres, R., Garcia-Luna-Aceves, J.J. (eds.) 6th Annual International Conference on Mobile Computing and Networking (MOBICOM 2000), pp. 32\u201343. ACM (2000). https:\/\/doi.org\/10.1145\/345910.345917","DOI":"10.1145\/345910.345917"},{"key":"12_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/BFb0030834","volume-title":"Computing and Combinatorics","author":"S Rengarajan","year":"1995","unstructured":"Rengarajan, S., Veni Madhavan, C.E.: Stack and queue number of 2-trees. In: Du, D.-Z., Li, M. (eds.) COCOON 1995. LNCS, vol. 959, pp. 203\u2013212. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/BFb0030834"},{"key":"12_CR40","doi-asserted-by":"publisher","unstructured":"Savarese, C., Rabaey, J., Beutel, J.: Location in distributed ad-hoc wireless sensor networks. In: 2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings, vol. 4, pp. 2037\u20132040 (2001). https:\/\/doi.org\/10.1109\/ICASSP.2001.940391","DOI":"10.1109\/ICASSP.2001.940391"},{"key":"12_CR41","unstructured":"Saxe, J.: Embeddability of Weighted Graphs in K-space is Strongly NP-hard. CMU-CS-80-102, Carnegie-Mellon University, Department of Computer Science, Pittsburgh (1980). https:\/\/books.google.it\/books?id=vClAGwAACAAJ"},{"key":"12_CR42","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":"12_CR43","doi-asserted-by":"publisher","unstructured":"Silveira, R.I., Speckmann, B., Verbeek, K.: Non-crossing paths with geographic constraints. Discret. Math. Theor. Comput. Sci. 21(3), 1\u201313 (2019). https:\/\/doi.org\/10.23638\/DMTCS-21-3-15","DOI":"10.23638\/DMTCS-21-3-15"},{"issue":"1","key":"12_CR44","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0012-365X(79)90060-8","volume":"26","author":"MM Syslo","year":"1979","unstructured":"Syslo, M.M.: Characterizations of outerplanar graphs. Discret. Math. 26(1), 47\u201353 (1979). https:\/\/doi.org\/10.1016\/0012-365X(79)90060-8","journal-title":"Discret. Math."},{"issue":"1","key":"12_CR45","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1023\/A:1009760732249","volume":"3","author":"R Tamassia","year":"1998","unstructured":"Tamassia, R.: Constraints in graph drawing algorithms. Constraints Int. J. 3(1), 87\u2013120 (1998). https:\/\/doi.org\/10.1023\/A:1009760732249","journal-title":"Constraints Int. J."},{"key":"12_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/3-540-17218-1_57","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M Wiegers","year":"1987","unstructured":"Wiegers, M.: Recognizing outerplanar graphs in linear time. In: Tinhofer, G., Schmidt, G. (eds.) WG 1986. LNCS, vol. 246, pp. 165\u2013176. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-17218-1_57"},{"key":"12_CR47","doi-asserted-by":"publisher","unstructured":"Yemini, Y.: Some theoretical aspects of position-location problems. In: 20th Annual Symposium on Foundations of Computer Science (FOCS 1979), pp. 1\u20138. IEEE Computer Society (1979). https:\/\/doi.org\/10.1109\/SFCS.1979.39","DOI":"10.1109\/SFCS.1979.39"}],"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-030-92931-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T01:01:56Z","timestamp":1766365316000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92931-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030929305","9783030929312"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92931-2_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"23 December 2021","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":"T\u00fcbingen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/algo.inf.uni-tuebingen.de\/gd2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"74","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":"23","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":"5","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":"31% - 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.02","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":"8.6","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}