{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T01:06:14Z","timestamp":1766365574344,"version":"3.48.0"},"publisher-location":"Cham","reference-count":49,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030929305"},{"type":"electronic","value":"9783030929312"}],"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_9","type":"book-chapter","created":{"date-parts":[[2021,12,22]],"date-time":"2021-12-22T11:14:17Z","timestamp":1640171657000},"page":"123-137","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Planar and\u00a0Toroidal Morphs Made Easier"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5253-2282","authenticated-orcid":false,"given":"Jeff","family":"Erickson","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4215-2443","authenticated-orcid":false,"given":"Patrick","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,23]]},"reference":[{"issue":"2","key":"9_CR1","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1137\/16M1069171","volume":"46","author":"S Alamdari","year":"2017","unstructured":"Alamdari, S., et al.: How to morph planar graph drawings. SIAM J. Comput. 46(2), 824\u2013852 (2017). https:\/\/doi.org\/10.1137\/16M1069171","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9_CR2","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1137\/S0895480194272183","volume":"9","author":"L Aleksandrov","year":"1996","unstructured":"Aleksandrov, L., Djidjev, H.: Linear algorithms for partitioning embedded graphs of bounded genus. SIAM J. Discrete Math. 9(1), 129\u2013150 (1996). https:\/\/doi.org\/10.1137\/S0895480194272183","journal-title":"SIAM J. Discrete Math."},{"key":"9_CR3","doi-asserted-by":"publisher","unstructured":"Alman, J., Williams, V.V.: A refined laser method and faster matrix multiplication. In: Proceedings of the 32nd Annual ACM-SIAM Symposium Discrete Algorithms, October 2021. https:\/\/doi.org\/10.1137\/1.9781611976465.32","DOI":"10.1137\/1.9781611976465.32"},{"key":"9_CR4","doi-asserted-by":"publisher","unstructured":"Alon, N., Yuster, R.: Matrix sparsification and nested dissection over arbitrary fields. J. ACM 60(4), 25:1\u201325:8 (2013). https:\/\/doi.org\/10.1145\/2508028.2505989","DOI":"10.1145\/2508028.2505989"},{"key":"9_CR5","unstructured":"Angelini, P., Lozzo, G.D., Frati, F., Lubiw, A., Patrignani, M., Roselli, V.: Optimal morphs of convex drawings. In: Proceedings of 31st International Symposium on Computational Geometry, pp. 126\u2013140. No. 34 in Leibniz International Proceedings in Informatics (2015)"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1515\/crll.1860.57.111","volume":"57","author":"CW Borchardt","year":"1860","unstructured":"Borchardt, C.W.: Ueber eine der interpolation entsprechende Darstellung der Eliminations-Resultante. J. Reine Angew. Math. 57, 111\u2013121 (1860). https:\/\/doi.org\/10.1515\/crll.1860.57.111","journal-title":"J. Reine Angew. Math."},{"issue":"5","key":"9_CR7","doi-asserted-by":"publisher","first-page":"247","DOI":"10.2307\/2304300","volume":"51","author":"SS Cairns","year":"1944","unstructured":"Cairns, S.S.: Deformations of plane rectilinear complexes. Amer. Math. Monthly 51(5), 247\u2013252 (1944). https:\/\/doi.org\/10.2307\/2304300","journal-title":"Amer. Math. Monthly"},{"issue":"2","key":"9_CR8","doi-asserted-by":"publisher","first-page":"207","DOI":"10.2307\/1969263","volume":"45","author":"SS Cairns","year":"1944","unstructured":"Cairns, S.S.: Isotopic deformations of geodesic complexes on the 2-sphere and on the plane. Ann. Math. 45(2), 207\u2013217 (1944). https:\/\/doi.org\/10.2307\/1969263","journal-title":"Ann. Math."},{"key":"9_CR9","doi-asserted-by":"publisher","unstructured":"Chambers, E.W., Erickson, J., Lin, P., Parsa, S.: How to morph graphs on the torus. In: Proceedings of 32nd Annual ACM-SIAM Symposium Discrete Algorithms, pp. 2759\u20132778 (2021). https:\/\/doi.org\/10.1137\/1.9781611976465.164","DOI":"10.1137\/1.9781611976465.164"},{"key":"9_CR10","doi-asserted-by":"publisher","unstructured":"Chrobak, M., Goodrich, M.T., Tamassia, R.: Convex drawings of graphs in two and three dimensions (preliminary version). In: Proceedings of 12th Annual Symposium on Computational Geometry, pp. 319\u2013328 (1996). https:\/\/doi.org\/10.1145\/237218.237401","DOI":"10.1145\/237218.237401"},{"key":"9_CR11","doi-asserted-by":"publisher","unstructured":"Cohen, M.B., Kelner, J., Peebles, J., Peng, R., Sidford, A., Vladu, A.: Faster algorithms for computing the stationary distribution, simulating random walks, and more. In: Proceedings of 57th Annual IEEE Symposium on Foundations of Computer Science, pp. 583\u2013592 (2016). https:\/\/doi.org\/10.1109\/FOCS.2016.69","DOI":"10.1109\/FOCS.2016.69"},{"issue":"1","key":"9_CR12","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s00454-013-9555-4","volume":"51","author":"\u00c9 Colin de\u00a0Verdi\u00e8re","year":"2013","unstructured":"Colin de\u00a0Verdi\u00e8re, \u00c9., de Mesmay, A.: Testing graph isotopy on surfaces. Discrete Comput. Geom. 51(1), 171\u2013206 (2013). https:\/\/doi.org\/10.1007\/s00454-013-9555-4","journal-title":"Discrete Comput. Geom."},{"key":"9_CR13","doi-asserted-by":"publisher","unstructured":"Colin de Verdi\u00e8re, \u00c9., Pocchiola, M., Vegter, G.: Tutte\u2019s barycenter method applied to isotopies. Comput. Geom. Theory Appl. 26(1), 81\u201397 (2003). https:\/\/doi.org\/10.1016\/S0925-7721(02)00174-8","DOI":"10.1016\/S0925-7721(02)00174-8"},{"key":"9_CR14","doi-asserted-by":"publisher","unstructured":"Colin de Verdi\u00e8re, Y.: Comment rendre g\u00e9od\u00e9sique une triangulation d\u2019une surface? L\u2019Enseignment Math\u00e9matique 37, 201\u2013212 (1991). https:\/\/doi.org\/10.5169\/seals-58738","DOI":"10.5169\/seals-58738"},{"key":"9_CR15","unstructured":"Connelly, R., Henderson, D.W., Ho, C.W., Starbird, M.: On the problems related to linear homeomorphisms, embeddings, and isotopies. In: Continua, Decompositions, Manifolds: Proceedings of Texas Topology Symposium, 1980, pp. 229\u2013239. University of Texas Press (1983)"},{"issue":"10","key":"9_CR16","doi-asserted-by":"publisher","first-page":"2985","DOI":"10.1007\/s00453-020-00714-6","volume":"82","author":"G Da Lozzo","year":"2020","unstructured":"Da Lozzo, G., Di Battista, G., Frati, F., Patrignani, M., Roselli, V.: Upward planar morphs. Algorithmica 82(10), 2985\u20133017 (2020). https:\/\/doi.org\/10.1007\/s00453-020-00714-6","journal-title":"Algorithmica"},{"issue":"3","key":"9_CR17","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1137\/19M1265193","volume":"62","author":"P De Leenheer","year":"2020","unstructured":"De Leenheer, P.: An elementary proof of a matrix tree theorem for directed graphs. SIAM Rev. 62(3), 716\u2013726 (2020). https:\/\/doi.org\/10.1137\/19M1265193","journal-title":"SIAM Rev."},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-540-24595-7_17","volume-title":"Graph Drawing","author":"O Delgado-Friedrichs","year":"2004","unstructured":"Delgado-Friedrichs, O.: Barycentric drawings of periodic graphs. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 178\u2013189. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24595-7_17"},{"issue":"1","key":"9_CR19","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s00454-004-1147-x","volume":"33","author":"O Delgado-Friedrichs","year":"2004","unstructured":"Delgado-Friedrichs, O.: Equilibrium placement of periodic graphs and convexity of plane tilings. Discrete Comput. Geom. 33(1), 67\u201381 (2004). https:\/\/doi.org\/10.1007\/s00454-004-1147-x","journal-title":"Discrete Comput. Geom."},{"key":"9_CR20","doi-asserted-by":"publisher","unstructured":"Erickson, J., Lin, P.: A toroidal Maxwell-Cremona-Delaunay correspondence. In: Proceedings of 36th International Symposium on Computational Geometry, pp. 40:1\u201340:17. No. 164 in Leibniz International Proceedings in Informatics, Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2020.40","DOI":"10.4230\/LIPIcs.SoCG.2020.40"},{"key":"9_CR21","unstructured":"Erickson, J., Lin, P.: Planar and toroidal morphs made easier. Preprint, August 2021. https:\/\/arxiv.org\/abs\/2106.14086v2"},{"issue":"3\u20134","key":"9_CR22","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1142\/S021865439800012X","volume":"4","author":"MS Floater","year":"1998","unstructured":"Floater, M.S.: Parametric tilings and scattered data approximation. Int. J. Shape Modeling 4(3\u20134), 165\u2013182 (1998). https:\/\/doi.org\/10.1142\/S021865439800012X","journal-title":"Int. J. Shape Modeling"},{"issue":"1","key":"9_CR23","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/S0167-8396(03)00002-5","volume":"20","author":"MS Floater","year":"2003","unstructured":"Floater, M.S.: Mean value coordinates. Comput. Aided Geom. Design 20(1), 19\u201327 (2003). https:\/\/doi.org\/10.1016\/S0167-8396(03)00002-5","journal-title":"Comput. Aided Geom. Design"},{"issue":"1\u20132","key":"9_CR24","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0377-0427(98)00202-7","volume":"101","author":"MS Floater","year":"1999","unstructured":"Floater, M.S., Gotsman, C.: How to morph tilings injectively. J. Comput. Appl. Math. 101(1\u20132), 117\u2013129 (1999). https:\/\/doi.org\/10.1016\/S0377-0427(98)00202-7","journal-title":"J. Comput. Appl. Math."},{"issue":"2","key":"9_CR25","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.cagd.2005.05.002","volume":"23","author":"SJ Gortler","year":"2006","unstructured":"Gortler, S.J., Gotsman, C., Thurston, D.: Discrete one-forms on meshes and applications to 3D mesh parameterization. Comput. Aided Geom. Des. 23(2), 83\u2013112 (2006). https:\/\/doi.org\/10.1016\/j.cagd.2005.05.002","journal-title":"Comput. Aided Geom. Des."},{"issue":"1","key":"9_CR26","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/S0097-8493(00)00108-4","volume":"25","author":"C Gotsman","year":"2001","unstructured":"Gotsman, C., Surazhsky, V.: Guaranteed intersection-free polygon morphing. Comput. Graph. 25(1), 67\u201375 (2001). https:\/\/doi.org\/10.1016\/S0097-8493(00)00108-4","journal-title":"Comput. Graph."},{"issue":"4","key":"9_CR27","doi-asserted-by":"publisher","first-page":"593","DOI":"10.4310\/AJM.2015.v19.n4.a2","volume":"19","author":"J Hass","year":"2015","unstructured":"Hass, J., Scott, P.: Simplicial energy and simplicial harmonic maps. Asian J. Math. 19(4), 593\u2013636 (2015). https:\/\/doi.org\/10.4310\/AJM.2015.v19.n4.a2","journal-title":"Asian J. Math."},{"issue":"3","key":"9_CR28","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/j.jda.2009.05.003","volume":"8","author":"SH Hong","year":"2010","unstructured":"Hong, S.H., Nagamochi, H.: Convex drawings of hierarchical planar graphs and clustered planar graphs. J. Discrete Algorithms 8(3), 282\u2013295 (2010). https:\/\/doi.org\/10.1016\/j.jda.2009.05.003","journal-title":"J. Discrete Algorithms"},{"issue":"1\u20136","key":"9_CR29","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/BF01758769","volume":"7","author":"JE Hopcroft","year":"1992","unstructured":"Hopcroft, J.E., Kahn, P.J.: A paradigm for robust geometric algorithms. Algorithmica 7(1\u20136), 339\u2013380 (1992). https:\/\/doi.org\/10.1007\/BF01758769","journal-title":"Algorithmica"},{"issue":"4","key":"9_CR30","doi-asserted-by":"publisher","first-page":"1424","DOI":"10.1145\/1183287.1183295","volume":"25","author":"K Hormann","year":"2006","unstructured":"Hormann, K., Floater, M.S.: Mean value coordinates for arbitrary planar polygons. ACM Trans. Graph. 25(4), 1424\u20131441 (2006). https:\/\/doi.org\/10.1145\/1183287.1183295","journal-title":"ACM Trans. Graph."},{"key":"9_CR31","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.comgeo.2019.07.007","volume":"84","author":"L Kleist","year":"2019","unstructured":"Kleist, L., Klemz, B., Lubiw, A., Schlipf, L., Staals, F., Strash, D.: Convexity-increasing morphs of planar graphs. Comput. Geom. Theory Appl. 84, 69\u201388 (2019). https:\/\/doi.org\/10.1016\/j.comgeo.2019.07.007","journal-title":"Comput. Geom. Theory Appl."},{"key":"9_CR32","doi-asserted-by":"publisher","unstructured":"Klemz, B.: Convex drawings of hierarchical graphs in linear time, with applications to planar graph morphing. In: Proceedings of the 29th Annual European Symposium on Algorithms. Leibniz International Proceedings in Informatics, vol. 204, pp. 57:1\u201357:15. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2021.57","DOI":"10.4230\/LIPIcs.ESA.2021.57"},{"key":"9_CR33","doi-asserted-by":"publisher","unstructured":"Le Gall, F.: Powers of tensors and fast matrix multiplication. In: Proceedings of 25th International Symposium on Algebraic Computation, pp. 296\u2013303 (2014). https:\/\/doi.org\/10.1145\/2608628.2608664","DOI":"10.1145\/2608628.2608664"},{"key":"9_CR34","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1137\/0716027","volume":"16","author":"RJ Lipton","year":"1979","unstructured":"Lipton, R.J., Rose, D.J., Tarjan, R.E.: Generalized nested dissection. SIAM J. Numer. Anal. 16, 346\u2013358 (1979). https:\/\/doi.org\/10.1137\/0716027","journal-title":"SIAM J. Numer. Anal."},{"key":"9_CR35","doi-asserted-by":"publisher","unstructured":"Lov\u00e1sz, L.: Discrete analytic functions: an exposition. In: Grigor\u2019yan, A., Yau, S.T. (eds.) Eigenvalues of Laplacians and other geometric operators, pp. 241\u2013273. No. 9 in Surveys in Differential Geometry, International Press (2004). https:\/\/doi.org\/10.4310\/SDG.2004.v9.n1.a7","DOI":"10.4310\/SDG.2004.v9.n1.a7"},{"key":"9_CR36","unstructured":"Luo, Y.: Spaces of geodesic triangulations of surfaces. Preprint, August 2020. https:\/\/arxiv.org\/abs\/1910.03070v3"},{"key":"9_CR37","unstructured":"Luo, Y., Wu, T., Zhu, X.: The deformation space of geodesic triangulations and generalized Tutte\u2019s embedding theorem. Preprint, May 2021. https:\/\/arxiv.org\/abs\/2105.00612"},{"key":"9_CR38","unstructured":"Luo, Y., Wu, T., Zhu, X.: The deformation space of geodesic triangulations of flat tori. Preprint, July 2021. https:\/\/arxiv.org\/abs\/2107.05159"},{"issue":"1","key":"9_CR39","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BF02930499","volume":"67","author":"B Mohar","year":"1997","unstructured":"Mohar, B.: Circle packings of maps\u2013the Euclidean case. Rend. Sem. Mat. Fis. Milano 67(1), 191\u2013206 (1997). https:\/\/doi.org\/10.1007\/BF02930499","journal-title":"Rend. Sem. Mat. Fis. Milano"},{"issue":"7","key":"9_CR40","doi-asserted-by":"publisher","first-page":"785","DOI":"10.1006\/eujc.1996.0135","volume":"18","author":"B Mohar","year":"1997","unstructured":"Mohar, B.: Circle packings of maps in polynomial time. Europ. J. Combin. 18(7), 785\u2013805 (1997). https:\/\/doi.org\/10.1006\/eujc.1996.0135","journal-title":"Europ. J. Combin."},{"key":"9_CR41","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0093761","volume-title":"Realization Spaces of Polytopes","author":"J Richter-Gebert","year":"1996","unstructured":"Richter-Gebert, J.: Realization Spaces of Polytopes. Lecture Notes in Mathematics, vol. 1643. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0093761"},{"key":"9_CR42","unstructured":"Steiner, D., Fischer, A.: Planar parameterization for closed 2-manifold genus-1 meshes. In: Proceedings of the 9th ACM Symposium Solid Modeling Applications, pp. 83\u201391 (2004)"},{"issue":"4","key":"9_CR43","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1145\/502783.502784","volume":"20","author":"V Surazhsky","year":"2001","unstructured":"Surazhsky, V., Gotsman, C.: Controllable morphing of compatible planar triangulations. ACM Trans. Graph. 20(4), 203\u2013231 (2001). https:\/\/doi.org\/10.1145\/502783.502784","journal-title":"ACM Trans. Graph."},{"key":"9_CR44","doi-asserted-by":"publisher","unstructured":"Surazhsky, V., Gotsman, C.: Morphing stick figures using optimal compatible triangulations. In: Proceedings of the 9th Pacific Conference on Computer Graphics Applications, pp. 40\u201349 (2001). https:\/\/doi.org\/10.1109\/PCCGA.2001.962856","DOI":"10.1109\/PCCGA.2001.962856"},{"issue":"2","key":"9_CR45","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1142\/S0218654303000115","volume":"9","author":"V Surazhsky","year":"2003","unstructured":"Surazhsky, V., Gotsman, C.: Intrinsic morphing of compatible triangulations. Int. J. Shape Modeling 9(2), 191\u2013201 (2003). https:\/\/doi.org\/10.1142\/S0218654303000115","journal-title":"Int. J. Shape Modeling"},{"issue":"3","key":"9_CR46","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/0095-8956(83)90038-2","volume":"34","author":"C Thomassen","year":"1983","unstructured":"Thomassen, C.: Deformations of plane graphs. J. Comb. Theory Ser. B 34(3), 244\u2013257 (1983). https:\/\/doi.org\/10.1016\/0095-8956(83)90038-2","journal-title":"J. Comb. Theory Ser. B"},{"issue":"4","key":"9_CR47","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1002\/jgt.10163","volume":"45","author":"C Thomassen","year":"2004","unstructured":"Thomassen, C.: Tutte\u2019s spring theorem. J. Graph Theory 45(4), 275\u2013280 (2004). https:\/\/doi.org\/10.1002\/jgt.10163","journal-title":"J. Graph Theory"},{"issue":"4","key":"9_CR48","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1017\/S030500410002449X","volume":"44","author":"WT Tutte","year":"1948","unstructured":"Tutte, W.T.: The dissection of equilateral triangles into equilateral triangles. Math. Proc. Cambridge Phil. Soc. 44(4), 463\u2013482 (1948)","journal-title":"Math. Proc. Cambridge Phil. Soc."},{"issue":"3","key":"9_CR49","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","volume":"13","author":"WT Tutte","year":"1963","unstructured":"Tutte, W.T.: How to draw a graph. Proc. London Math. Soc. 13(3), 743\u2013768 (1963). https:\/\/doi.org\/10.1112\/plms\/s3-13.1.743","journal-title":"Proc. London Math. Soc."}],"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_9","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_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030929305","9783030929312"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92931-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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"}]}}