{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:01:39Z","timestamp":1742983299911,"version":"3.40.3"},"publisher-location":"Cham","reference-count":51,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030604394"},{"type":"electronic","value":"9783030604400"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-60440-0_25","type":"book-chapter","created":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T09:03:18Z","timestamp":1602752598000},"page":"310-324","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Drawing Graphs as Spanners"],"prefix":"10.1007","author":[{"given":"Oswin","family":"Aichholzer","sequence":"first","affiliation":[]},{"given":"Manuel","family":"Borrazzo","sequence":"additional","affiliation":[]},{"given":"Prosenjit","family":"Bose","sequence":"additional","affiliation":[]},{"given":"Jean","family":"Cardinal","sequence":"additional","affiliation":[]},{"given":"Fabrizio","family":"Frati","sequence":"additional","affiliation":[]},{"given":"Pat","family":"Morin","sequence":"additional","affiliation":[]},{"given":"Birgit","family":"Vogtenhuber","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,10,9]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Abrahamsen, M., Adamaszek, A., Miltzow, T.: The art gallery problem is $$\\exists \\mathbb{R}$$-complete. In: Diakonikolas, I., Kempe, D., Henzinger, M. (eds.) 50th Annual Symposium on Theory of Computing (STOC 2018), pp. 65\u201373. ACM (2018)","DOI":"10.1145\/3188745.3188868"},{"issue":"2","key":"25_CR2","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1016\/0097-3165(95)90058-6","volume":"69","author":"DM Acketa","year":"1995","unstructured":"Acketa, D.M., Zunic, J.D.: On the maximal number of edges of convex digital polygons included into an $$m \\times m$$-grid. J. Comb. Theory Ser. A 69(2), 358\u2013368 (1995)","journal-title":"J. Comb. Theory Ser. A"},{"key":"25_CR3","unstructured":"Aichholzer, O., et al.: Drawing graphs as spanners. CoRR abs\/2002.05580 (2020). https:\/\/arxiv.org\/abs\/2002.05580"},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-642-36763-2_23","volume-title":"Graph Drawing","author":"S Alamdari","year":"2013","unstructured":"Alamdari, S., Chan, T.M., Grant, E., Lubiw, A., Pathak, V.: Self-approaching Graphs. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 260\u2013271. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36763-2_23"},{"issue":"1","key":"25_CR5","doi-asserted-by":"publisher","first-page":"5","DOI":"10.7155\/jgaa.00249","volume":"16","author":"P Angelini","year":"2012","unstructured":"Angelini, P., Colasante, E., Di Battista, G., Frati, F., Patrignani, M.: Monotone drawings of graphs. J. Graph Algorithms Appl. 16(1), 5\u201335 (2012)","journal-title":"J. Graph Algorithms Appl."},{"issue":"3","key":"25_CR6","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1002\/net.21449","volume":"59","author":"P Angelini","year":"2012","unstructured":"Angelini, P., Di Battista, G., Frati, F.: Succinct greedy drawings do not always exist. Networks 59(3), 267\u2013274 (2012)","journal-title":"Networks"},{"issue":"2","key":"25_CR7","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s00453-013-9790-3","volume":"71","author":"P Angelini","year":"2015","unstructured":"Angelini, P., et al.: Monotone drawings of graphs with fixed embedding. Algorithmica 71(2), 233\u2013257 (2015)","journal-title":"Algorithmica"},{"issue":"1","key":"25_CR8","doi-asserted-by":"publisher","first-page":"19","DOI":"10.7155\/jgaa.00197","volume":"14","author":"P Angelini","year":"2010","unstructured":"Angelini, P., Frati, F., Grilli, L.: An algorithm to construct greedy drawings of triangulations. J. Graph Algorithms Appl. 14(1), 19\u201351 (2010)","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"25_CR9","doi-asserted-by":"publisher","first-page":"97","DOI":"10.7155\/jgaa.00219","volume":"15","author":"M Badent","year":"2011","unstructured":"Badent, M., Brandes, U., Cornelsen, S.: More canonical ordering. J. Graph Algorithms Appl. 15(1), 97\u2013126 (2011)","journal-title":"J. Graph Algorithms Appl."},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/978-3-319-50106-2_40","volume-title":"Graph Drawing and Network Visualization","author":"N Bonichon","year":"2016","unstructured":"Bonichon, N., Bose, P., Carmi, P., Kostitsyna, I., Lubiw, A., Verdonschot, S.: Gabriel triangulations and angle-monotone graphs: local routing and recognition. In: Hu, Y., N\u00f6llenburg, M. (eds.) GD 2016. LNCS, vol. 9801, pp. 519\u2013531. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50106-2_40"},{"issue":"4","key":"25_CR11","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s00453-006-0177-6","volume":"47","author":"N Bonichon","year":"2007","unstructured":"Bonichon, N., Felsner, S., Mosbah, M.: Convex drawings of 3-connected plane graphs. Algorithmica 47(4), 399\u2013420 (2007)","journal-title":"Algorithmica"},{"issue":"2","key":"25_CR12","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.comgeo.2010.09.009","volume":"44","author":"P Bose","year":"2011","unstructured":"Bose, P., Devroye, L., L\u00f6ffler, M., Snoeyink, J., Verma, V.: Almost all Delaunay triangulations have stretch factor greater than $$\\pi \/2$$. Comput. Geom. Theory Appl. 44(2), 121\u2013127 (2011)","journal-title":"Comput. Geom. Theory Appl."},{"key":"25_CR13","unstructured":"Bose, P., Fagerberg, R., van Renssen, A., Verdonschot, S.: Competitive routing in the half-$$\\theta _6$$-graph. In: Rabani, Y. (ed.) 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2012), pp. 1319\u20131328 (2012)"},{"issue":"4","key":"25_CR14","doi-asserted-by":"publisher","first-page":"1392","DOI":"10.1007\/s00453-018-0476-8","volume":"81","author":"P Bose","year":"2019","unstructured":"Bose, P., Fagerberg, R., van Renssen, A., Verdonschot, S.: On plane constrained bounded-degree spanners. Algorithmica 81(4), 1392\u20131415 (2019)","journal-title":"Algorithmica"},{"issue":"7","key":"25_CR15","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1016\/j.comgeo.2013.04.002","volume":"46","author":"P Bose","year":"2013","unstructured":"Bose, P., Smid, M.H.M.: On plane geometric spanners: a survey and open problems. Comput. Geom. Theory Appl. 46(7), 818\u2013830 (2013)","journal-title":"Comput. Geom. Theory Appl."},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Canny, J.F.: Some algebraic and geometric computations in PSPACE. In: Simon, J. (ed.) 20th Annual ACM Symposium on Theory of Computing (STOC 1988), pp. 460\u2013467. ACM (1988)","DOI":"10.1145\/62212.62257"},{"issue":"1","key":"25_CR17","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/s00454-016-9831-1","volume":"57","author":"J Cardinal","year":"2017","unstructured":"Cardinal, J., Hoffmann, U.: Recognition and complexity of point visibility graphs. Discrete Comput. Geom. 57(1), 164\u2013178 (2017)","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"25_CR18","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0022-0000(89)90044-5","volume":"39","author":"P Chew","year":"1989","unstructured":"Chew, P.: There are planar graphs almost as good as the complete graph. J. Comput. Syst. Sci. 39(2), 205\u2013219 (1989)","journal-title":"J. Comput. Syst. Sci."},{"key":"25_CR19","unstructured":"Da Lozzo, G., D\u2019Angelo, A., Frati, F.: On planar greedy drawings of 3-connected planar graphs. In: Aronov, B., Katz, M.J. (eds.) 33rd International Symposium on Computational Geometry (SoCG 2017). LIPIcs, vol. 77, pp. 33:1\u201333:16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017)"},{"issue":"2","key":"25_CR20","doi-asserted-by":"publisher","first-page":"761","DOI":"10.7155\/jgaa.00348","volume":"19","author":"HR Dehkordi","year":"2015","unstructured":"Dehkordi, H.R., Frati, F., Gudmundsson, J.: Increasing-chord graphs on point sets. J. Graph Algorithms Appl. 19(2), 761\u2013778 (2015)","journal-title":"J. Graph Algorithms Appl."},{"key":"25_CR21","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/BF02187801","volume":"5","author":"DP Dobkin","year":"1990","unstructured":"Dobkin, D.P., Friedman, S.J., Supowit, K.J.: Delaunay graphs are almost as good as complete graphs. Discrete Comput. Geom. 5, 399\u2013407 (1990)","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"25_CR22","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.comgeo.2006.09.002","volume":"38","author":"V Dujmovi\u0107","year":"2007","unstructured":"Dujmovi\u0107, V., Eppstein, D., Suderman, M., Wood, D.R.: Drawings of planar graphs with few slopes and segments. Comput. Geom. Theory Appl. 38(3), 194\u2013212 (2007)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"2","key":"25_CR23","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1142\/S0218195916500059","volume":"26","author":"A Dumitrescu","year":"2016","unstructured":"Dumitrescu, A., Ghosh, A.: Lower bounds on the dilation of plane spanners. Int. J. Comput. Geom. Appl. 26(2), 89\u2013110 (2016)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"11","key":"25_CR24","doi-asserted-by":"publisher","first-page":"1571","DOI":"10.1109\/TC.2010.257","volume":"60","author":"D Eppstein","year":"2011","unstructured":"Eppstein, D., Goodrich, M.T.: Succinct greedy geometric routing using hyperbolic geometry. IEEE Trans. Comput. 60(11), 1571\u20131580 (2011)","journal-title":"IEEE Trans. Comput."},{"key":"25_CR25","unstructured":"Felsner, S., Igamberdiev, A., Kindermann, P., Klemz, B., Mchedlidze, T., Scheucher, M.: Strongly monotone drawings of planar graphs. In: 32nd International Symposium on Computational Geometry (SoCG 2016). LIPIcs, vol. 51, pp. 37:1\u201337:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016)"},{"issue":"1","key":"25_CR26","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H de Fraysseix","year":"1990","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10(1), 41\u201351 (1990)","journal-title":"Combinatorica"},{"key":"25_CR27","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)"},{"issue":"4","key":"25_CR28","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1137\/0205049","volume":"5","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Tarjan, R.E.: The planar Hamiltonian circuit problem is NP-complete. SIAM J. Comput. 5(4), 704\u2013714 (1976)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"25_CR29","doi-asserted-by":"publisher","first-page":"1867","DOI":"10.1137\/16M1080045","volume":"31","author":"D He","year":"2017","unstructured":"He, D., He, X.: Optimal monotone drawings of trees. SIAM J. Discrete Math. 31(3), 1867\u20131877 (2017)","journal-title":"SIAM J. Discrete Math."},{"key":"25_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/978-3-662-48350-3_61","volume-title":"Algorithms - ESA 2015","author":"X He","year":"2015","unstructured":"He, X., He, D.: Monotone drawings of 3-connected plane graphs. In: Bansal, N., Finocchi, I. (eds.) ESA 2015. LNCS, vol. 9294, pp. 729\u2013741. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48350-3_61"},{"issue":"2","key":"25_CR31","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/s00453-012-9682-y","volume":"68","author":"X He","year":"2014","unstructured":"He, X., Zhang, H.: On succinct greedy drawings of plane triangulations and 3-connected plane graphs. Algorithmica 68(2), 531\u2013544 (2014)","journal-title":"Algorithmica"},{"key":"25_CR32","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.tcs.2015.09.004","volume":"607","author":"MI Hossain","year":"2015","unstructured":"Hossain, M.I., Rahman, M.S.: Good spanning trees in graph drawing. Theoret. Comput. Sci. 607, 149\u2013165 (2015)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"25_CR33","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1017\/S0305004198003016","volume":"125","author":"C Icking","year":"1999","unstructured":"Icking, C., Klein, R., Langetepe, E.: Self-approaching curves. Math. Proc. Cambridge Philos. Soc. 125(3), 441\u2013453 (1999)","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"issue":"1","key":"25_CR34","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)","journal-title":"Algorithmica"},{"key":"25_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1007\/978-3-662-45803-7_41","volume-title":"Graph Drawing","author":"P Kindermann","year":"2014","unstructured":"Kindermann, P., Schulz, A., Spoerhase, J., Wolff, A.: On monotone drawings of trees. In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp. 488\u2013500. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45803-7_41"},{"issue":"3","key":"25_CR36","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1007\/s00454-009-9227-6","volume":"44","author":"T Leighton","year":"2010","unstructured":"Leighton, T., Moitra, A.: Some results on greedy embeddings in metric spaces. Discrete Comput. Geom. 44(3), 686\u2013705 (2010)","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"25_CR37","doi-asserted-by":"publisher","first-page":"345","DOI":"10.7155\/jgaa.00494","volume":"23","author":"A Lubiw","year":"2019","unstructured":"Lubiw, A., Mondal, D.: Construction and local routing for angle-monotone graphs. J. Graph Algorithms Appl. 23(2), 345\u2013369 (2019)","journal-title":"J. Graph Algorithms Appl."},{"key":"25_CR38","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/BFb0082792","volume-title":"Topology and Geometry \u2014 Rohlin Seminar","author":"NE Mnev","year":"1988","unstructured":"Mnev, N.E.: The universality theorems on the classification problem of configuration varieties and convex polytopes varieties. In: Viro, O.Y., Vershik, A.M. (eds.) Topology and Geometry \u2014 Rohlin Seminar. LNM, vol. 1346, pp. 527\u2013543. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/BFb0082792"},{"key":"25_CR39","unstructured":"Mulzer, W.: Minimum dilation triangulations for the regular $$n$$-gon. Master\u2019s thesis, Freie Universit\u00e4t Berlin (2004)"},{"issue":"3","key":"25_CR40","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/s00454-017-9913-8","volume":"58","author":"M N\u00f6llenburg","year":"2017","unstructured":"N\u00f6llenburg, M., Prutkin, R.: Euclidean greedy drawings of trees. Discrete Comput. Geom. 58(3), 543\u2013579 (2017)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"25_CR41","first-page":"47","volume":"7","author":"M N\u00f6llenburg","year":"2016","unstructured":"N\u00f6llenburg, M., Prutkin, R., Rutter, I.: On self-approaching and increasing-chord drawings of 3-connected planar graphs. J. Comput. Geom. 7(1), 47\u201369 (2016)","journal-title":"J. Comput. Geom."},{"issue":"1","key":"25_CR42","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2005.06.022","volume":"344","author":"CH Papadimitriou","year":"2005","unstructured":"Papadimitriou, C.H., Ratajczak, D.: On a conjecture related to geometric routing. Theoret. Comput. Sci. 344(1), 3\u201314 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"25_CR43","doi-asserted-by":"crossref","unstructured":"Rao, A., Papadimitriou, C.H., Shenker, S., Stoica, I.: Geographic routing without location information. In: Johnson, D.B., Joseph, A.D., Vaidya, N.H. (eds.) 9th Annual International Conference on Mobile Computing and Networking (MOBICOM 2003), pp. 96\u2013108. ACM (2003)","DOI":"10.1145\/938985.938996"},{"issue":"1","key":"25_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0305004100071875","volume":"115","author":"G Rote","year":"1994","unstructured":"Rote, G.: Curves with increasing chords. Math. Proc. Cambridge Philos. Soc. 115(1), 1\u201312 (1994)","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"25_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-642-11805-0_32","volume-title":"Graph Drawing","author":"M Schaefer","year":"2010","unstructured":"Schaefer, M.: Complexity of some geometric and topological problems. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol. 5849, pp. 334\u2013344. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11805-0_32"},{"key":"25_CR46","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: Johnson, D.S. (ed.) 1st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1990), pp. 138\u2013148 (1990)"},{"key":"25_CR47","unstructured":"Shiloach, Y.: Linear and planar arrangements of graphs. Ph.D. thesis, Weizmann Institute of Science (1976)"},{"key":"25_CR48","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.tcs.2013.05.024","volume":"532","author":"JJ Wang","year":"2014","unstructured":"Wang, J.J., He, X.: Succinct strictly convex greedy drawing of 3-connected plane graphs. Theoret. Comput. Sci. 532, 80\u201390 (2014)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"25_CR49","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF01788671","volume":"5","author":"S Win","year":"1989","unstructured":"Win, S.: On a connection between the existence of $$k$$-trees and the toughness of a graph. Graphs Comb. 5(1), 201\u2013205 (1989)","journal-title":"Graphs Comb."},{"issue":"4","key":"25_CR50","first-page":"1620","volume":"42","author":"G Xia","year":"2013","unstructured":"Xia, G.: The stretch factor of the Delaunay triangulation is less than 1.998. Comput. Geom. Theory Appl. 42(4), 1620\u20131659 (2013)","journal-title":"Comput. Geom. Theory Appl."},{"key":"25_CR51","doi-asserted-by":"crossref","unstructured":"Xia, G., Zhang, L.: Toward the tight bound of the stretch factor of Delaunay triangulations. In: 23rd Annual Canadian Conference on Computational Geometry (CCCG 2011) (2011)","DOI":"10.1145\/1998196.1998235"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-60440-0_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:02:56Z","timestamp":1710266576000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-60440-0_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030604394","9783030604400"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-60440-0_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"9 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leeds","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"46","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algorithms.leeds.ac.uk\/wg2020\/","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":"94","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":"32","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":"0","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":"34% - 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.7","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":"2.1","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":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}