{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:58:48Z","timestamp":1740099528738,"version":"3.37.3"},"publisher-location":"Cham","reference-count":47,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030307851"},{"type":"electronic","value":"9783030307868"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-30786-8_10","type":"book-chapter","created":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T21:22:57Z","timestamp":1568236977000},"page":"120-134","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Flip Distances Between Graph Orientations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2364-0583","authenticated-orcid":false,"given":"Oswin","family":"Aichholzer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2312-0967","authenticated-orcid":false,"given":"Jean","family":"Cardinal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6908-923X","authenticated-orcid":false,"given":"Tony","family":"Huynh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8151-2184","authenticated-orcid":false,"given":"Kolja","family":"Knauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6383-7436","authenticated-orcid":false,"given":"Torsten","family":"M\u00fctze","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4234-6136","authenticated-orcid":false,"given":"Raphael","family":"Steiner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7166-4467","authenticated-orcid":false,"given":"Birgit","family":"Vogtenhuber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,12]]},"reference":[{"key":"10_CR1","unstructured":"Aguiar, M., Ardila, F.: Hopf monoids and generalized permutahedra, September 2017. arXiv: 1709.07504"},{"issue":"5","key":"10_CR2","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/s00373-007-0750-z","volume":"23","author":"O Aichholzer","year":"2007","unstructured":"Aichholzer, O., Aurenhammer, F., Huemer, C., Vogtenhuber, B.: Gray code enumeration of plane straight-line graphs. Graphs Comb. 23(5), 467\u2013479 (2007). https:\/\/doi.org\/10.1007\/s00373-007-0750-z","journal-title":"Graphs Comb."},{"issue":"2","key":"10_CR3","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/s00454-015-9709-7","volume":"54","author":"O Aichholzer","year":"2015","unstructured":"Aichholzer, O., Mulzer, W., Pilz, A.: Flip distance between triangulations of asimple polygon is NP-complete. Discrete Comput. Geom. 54(2), 368\u2013389 (2015). https:\/\/doi.org\/10.1007\/s00454-015-9709-7","journal-title":"Discrete Comput. Geom."},{"issue":"1\u20133","key":"10_CR4","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0166-218X(95)00026-N","volume":"65","author":"D Avis","year":"1996","unstructured":"Avis, D., Fukuda, K.: Reverse search for enumeration. Discrete Appl. Math. 65(1\u20133), 21\u201346 (1996). https:\/\/doi.org\/10.1016\/0166-218X(95)00026-N . First International Colloquium on Graphs and Optimization (GOI), Grimentz (1992)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10_CR5","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/j.jcta.2011.08.006","volume":"119","author":"O Bernardi","year":"2012","unstructured":"Bernardi, O., Fusy, E.: A bijection for triangulations, quadrangulations, pentagulations, etc. J. Comb. Theory Ser. A 119(1), 218\u2013244 (2012). https:\/\/doi.org\/10.1016\/j.jcta.2011.08.006","journal-title":"J. Comb. Theory Ser. A"},{"key":"10_CR6","unstructured":"Bonamy, M., et al.: The Perfect Matching Reconfiguration Problem, April 2019. arXiv:1904.06184"},{"issue":"1","key":"10_CR7","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.comgeo.2008.04.001","volume":"42","author":"P Bose","year":"2009","unstructured":"Bose, P., Hurtado, F.: Flips in planar graphs. Comput. Geom. 42(1), 60\u201380 (2009). https:\/\/doi.org\/10.1016\/j.comgeo.2008.04.001","journal-title":"Comput. Geom."},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-642-34191-5_3","volume-title":"Computational Geometry","author":"P Bose","year":"2012","unstructured":"Bose, P., Verdonschot, S.: A history of flips in combinatorial triangulations. In: M\u00e1rquez, A., Ramos, P., Urrutia, J. (eds.) EGC 2011. LNCS, vol. 7579, pp. 29\u201344. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34191-5_3"},{"key":"10_CR9","unstructured":"Brehm, E.: 3-orientations and Schnyder-3-tree-decompositions, Diploma Thesis, Freie Universit\u00e4t Berlin (2000)"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1017\/S000497270004140X","volume":"1","author":"RA Brualdi","year":"1969","unstructured":"Brualdi, R.A.: Comments on bases in dependence structures. Bull. Australas. Math. Soc. 1, 161\u2013167 (1969). https:\/\/doi.org\/10.1017\/S000497270004140X","journal-title":"Bull. Australas. Math. Soc."},{"issue":"2","key":"10_CR11","first-page":"1","volume":"20","author":"J Cardinal","year":"2018","unstructured":"Cardinal, J., Sacrist\u00e1n, V., Silveira, R.I.: A note on flips in diagonal rectangulations. Discrete Math. Theor. Comput. Sci. 20(2), 1\u201322 (2018)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"5","key":"10_CR12","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/s00493-014-2959-9","volume":"35","author":"C Ceballos","year":"2015","unstructured":"Ceballos, C., Santos, F., Ziegler, G.M.: Many non-equivalent realizations of the associahedron. Combinatorica 35(5), 513\u2013551 (2015). https:\/\/doi.org\/10.1007\/s00493-014-2959-9","journal-title":"Combinatorica"},{"issue":"16","key":"10_CR13","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1016\/j.ipl.2009.04.023","volume":"109","author":"S Cleary","year":"2009","unstructured":"Cleary, S., St. John, K.: Rotation distance is fixed-parameter tractable. Inform. Process. Lett. 109(16), 918\u2013922 (2009). https:\/\/doi.org\/10.1016\/j.ipl.2009.04.023","journal-title":"Inform. Process. Lett."},{"issue":"1","key":"10_CR14","doi-asserted-by":"crossref","first-page":"24","DOI":"10.37236\/1777","volume":"11","author":"S Felsner","year":"2004","unstructured":"Felsner, S.: Lattice structures from planar graphs. Electron. J. Comb. 11(1), 24 (2004). Research Paper 15","journal-title":"Electron. J. Comb."},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-1-4614-0110-0_12","volume-title":"Thirty Essays on Geometric Graph Theory","author":"S Felsner","year":"2013","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"},{"key":"10_CR16","doi-asserted-by":"publisher","unstructured":"Felsner, S., Kleist, L., M\u00fctze, T., Sering, L.: Rainbow cycles in flip graphs. In: Symposium on Computational Geometry 2018, pp. 38:1\u201338:14 (2018). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2018.38","DOI":"10.4230\/LIPIcs.SoCG.2018.38"},{"issue":"5","key":"10_CR17","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1017\/S0963548309010001","volume":"18","author":"S Felsner","year":"2009","unstructured":"Felsner, S., Knauer, K.: ULD-lattices and $$\\varDelta $$ -bonds. Comb. Probab. Comput. 18(5), 707\u2013724 (2009). https:\/\/doi.org\/10.1017\/S0963548309010001","journal-title":"Comb. Probab. Comput."},{"issue":"1","key":"10_CR18","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.ejc.2010.07.011","volume":"32","author":"S Felsner","year":"2011","unstructured":"Felsner, S., Knauer, K.: Distributive lattices, polyhedra, and generalized flows. Eur. J. Comb. 32(1), 45\u201359 (2011). https:\/\/doi.org\/10.1016\/j.ejc.2010.07.011","journal-title":"Eur. J. Comb."},{"key":"10_CR19","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-030-00256-5_17","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S Felsner","year":"2018","unstructured":"Felsner, S., Schrezenmaier, H., Steiner, R.: Equiangular polygon contact representations. In: Br\u00e4ndstadt, A., K\u00f6hler, E., Meer, K. (eds.) WG 2018. LNCS, vol. 11159, pp. 203\u2013215. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00256-5_17"},{"issue":"3","key":"10_CR20","doi-asserted-by":"crossref","first-page":"38","DOI":"10.37236\/7694","volume":"25","author":"S Felsner","year":"2018","unstructured":"Felsner, S., Schrezenmaier, H., Steiner, R.: Pentagon contact representations. Electron. J. Comb. 25(3), 38 (2018). Paper 3.39","journal-title":"Electron. J. Comb."},{"issue":"3, (Ser. B)","key":"10_CR21","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/BF01589418","volume":"42","author":"A Frank","year":"1988","unstructured":"Frank, A., Tardos, E.: Generalized polymatroids and submodular flows. Math. Program. 42(3, (Ser. B)), 489\u2013563 (1988). https:\/\/doi.org\/10.1007\/BF01589418 . Submodular optimization","journal-title":"Math. Program."},{"issue":"1","key":"10_CR22","first-page":"229","volume":"23","author":"PM Gilmer","year":"1986","unstructured":"Gilmer, P.M., Litherland, R.A.: The duality conjecture in formal knot theory. Osaka J. Math. 23(1), 229\u2013247 (1986)","journal-title":"Osaka J. Math."},{"issue":"1","key":"10_CR23","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s00454-012-9400-1","volume":"48","author":"D Gon\u00e7alves","year":"2012","unstructured":"Gon\u00e7alves, D., L\u00e9v\u00eaque, B., Pinlou, A.: Triangle contact representations and duality. Discrete Comput. Geom. 48(1), 239\u2013254 (2012). https:\/\/doi.org\/10.1007\/s00454-012-9400-1","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"10_CR24","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/s003730200038","volume":"18","author":"MC Hernando","year":"2002","unstructured":"Hernando, M.C., Hurtado, F., Noy, M.: Graphs of non-crossing perfect matchings. Graphs Comb. 18(3), 517\u2013532 (2002). https:\/\/doi.org\/10.1007\/s003730200038","journal-title":"Graphs Comb."},{"issue":"3","key":"10_CR25","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s00373-005-0615-2","volume":"21","author":"ME Houle","year":"2005","unstructured":"Houle, M.E., Hurtado, F., Noy, M., Rivera-Campo, E.: Graphs of triangulations and perfect matchings. Graphs Comb. 21(3), 325\u2013331 (2005). https:\/\/doi.org\/10.1007\/s00373-005-0615-2","journal-title":"Graphs Comb."},{"issue":"7","key":"10_CR26","doi-asserted-by":"publisher","first-page":"1509","DOI":"10.1016\/j.dam.2008.06.018","volume":"157","author":"C Huemer","year":"2009","unstructured":"Huemer, C., Hurtado, F., Noy, M., Oma\u00f1a-Pulido, E.: Gray codes for non-crossing partitions and dissections of a convex polygon. Discrete Appl. Math. 157(7), 1509\u20131520 (2009). https:\/\/doi.org\/10.1016\/j.dam.2008.06.018","journal-title":"Discrete Appl. Math."},{"issue":"1\u20133","key":"10_CR27","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0012-365X(01)00167-4","volume":"242","author":"S Iwata","year":"2002","unstructured":"Iwata, S.: On matroid intersection adjacency. Discrete Math. 242(1\u20133), 277\u2013281 (2002). https:\/\/doi.org\/10.1016\/S0012-365X(01)00167-4","journal-title":"Discrete Math."},{"issue":"2","key":"10_CR28","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s00454-017-9867-x","volume":"58","author":"I Kanj","year":"2017","unstructured":"Kanj, I., Sedgwick, E., Xia, G.: Computing the flip distance between triangulations. Discrete Comput. Geom. 58(2), 313\u2013344 (2017). https:\/\/doi.org\/10.1007\/s00454-017-9867-x","journal-title":"Discrete Comput. Geom."},{"key":"10_CR29","unstructured":"Knauer, K.: Partial orders on orientations via cycle flips. Master\u2019s thesis, Faculty of Mathematics, TU Berlin (2007)"},{"issue":"1","key":"10_CR30","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1023\/A:1024483217354","volume":"20","author":"PCB Lam","year":"2003","unstructured":"Lam, P.C.B., Zhang, H.: A distributive lattice on the set of perfect matchings of a plane bipartite graph. Order 20(1), 13\u201329 (2003). https:\/\/doi.org\/10.1023\/A:1024483217354","journal-title":"Order"},{"key":"10_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/3-540-68535-9_12","volume-title":"Computing and Combinatorics","author":"M Li","year":"1998","unstructured":"Li, M., Zhang, L.: Better approximation of diagonal-flip transformation and rotation transformation. In: Hsu, W.-L., Kao, M.-Y. (eds.) COCOON 1998. LNCS, vol. 1449, pp. 85\u201394. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-68535-9_12"},{"key":"10_CR32","series-title":"No. 25 in Algorithms and Computation in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12971-1","volume-title":"Triangulations: Structures for Algorithms and Applications","author":"JAD Loera","year":"2010","unstructured":"Loera, J.A.D., Rambau, J., Santos, F.: Triangulations: Structures for Algorithms and Applications. No. 25 in Algorithms and Computation in Mathematics. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12971-1"},{"key":"10_CR33","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.comgeo.2014.11.001","volume":"49","author":"A Lubiw","year":"2015","unstructured":"Lubiw, A., Pathak, V.: Flip distance between two triangulations of a point set is NP-complete. Comput. Geom. 49, 17\u201323 (2015). https:\/\/doi.org\/10.1016\/j.comgeo.2014.11.001","journal-title":"Comput. Geom."},{"issue":"1\u20133","key":"10_CR34","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0012-365X(93)E0101-9","volume":"135","author":"S Negami","year":"1994","unstructured":"Negami, S.: Diagonal flips in triangulations of surfaces. Discrete Math. 135(1\u20133), 225\u2013232 (1994). https:\/\/doi.org\/10.1016\/0012-365X(93)E0101-9","journal-title":"Discrete Math."},{"issue":"3","key":"10_CR35","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/BF01588973","volume":"14","author":"CH Papadimitriou","year":"1978","unstructured":"Papadimitriou, C.H.: The adjacency relation on the traveling salesman polytope is NP-complete. Math. Program. 14(3), 312\u2013324 (1978). https:\/\/doi.org\/10.1007\/BF01588973","journal-title":"Math. Program."},{"key":"10_CR36","unstructured":"Pilaud, V., Santos, F.: Quotientopes, August 2018. arXiv: 1711.05353"},{"key":"10_CR37","doi-asserted-by":"publisher","first-page":"1026","DOI":"10.1093\/imrn\/rnn153","volume":"6","author":"A Postnikov","year":"2009","unstructured":"Postnikov, A.: Permutohedra, associahedra, and beyond. Int. Math. Res. Not. IMRN 6, 1026\u20131106 (2009). https:\/\/doi.org\/10.1093\/imrn\/rnn153","journal-title":"Int. Math. Res. Not. IMRN"},{"key":"10_CR38","unstructured":"Propp, J.: Lattice structure for orientations of graphs, September 2002. arXiv: math\/0209005"},{"key":"10_CR39","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1090\/dimacs\/041\/09","volume-title":"Microsurveys in Discrete Probability","author":"James Propp","year":"1998","unstructured":"Propp, J., Wilson, D.: Coupling from the past: a user\u2019s guide. In: Microsurveys in discrete probability, Princeton, NJ (1997). DIMACS Series Discrete Mathematics Theoretical Computer Science, vol. 41, pp. 181\u2013192. American Mathematical Society, Providence, RI (1998)"},{"issue":"2","key":"10_CR40","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/j.tcs.2004.03.020","volume":"322","author":"E R\u00e9mila","year":"2004","unstructured":"R\u00e9mila, E.: The lattice structure of the set of domino tilings of a polygon. Theor. Comput. Sci. 322(2), 409\u2013422 (2004). https:\/\/doi.org\/10.1016\/j.tcs.2004.03.020","journal-title":"Theor. Comput. Sci."},{"key":"10_CR41","first-page":"75","volume":"12","author":"G Ringel","year":"1957","unstructured":"Ringel, G.: \u00dcber Geraden in allgemeiner lage. Elem. Math. 12, 75\u201382 (1957)","journal-title":"Elem. Math."},{"issue":"3","key":"10_CR42","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1137\/S0895480196312462","volume":"11","author":"FJ Rispoli","year":"1998","unstructured":"Rispoli, F.J., Cosares, S.: A bound of $$4$$ for the diameter of the symmetric traveling salesman polytope. SIAM J. Discrete Math. 11(3), 373\u2013380 (1998). https:\/\/doi.org\/10.1137\/S0895480196312462","journal-title":"SIAM J. Discrete Math."},{"key":"10_CR43","unstructured":"Rogers, R.O.: On finding shortest paths in the rotation graph of binary trees. In: Proceedings of the Thirtieth Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, FL, vol. 137, pp. 77\u201395 (1999)"},{"issue":"3","key":"10_CR44","doi-asserted-by":"publisher","first-page":"647","DOI":"10.2307\/1990951","volume":"1","author":"DD Sleator","year":"1988","unstructured":"Sleator, D.D., Tarjan, R.E., Thurston, W.P.: Rotation distance, triangulations, and hyperbolic geometry. J. Am. Math. Soc. 1(3), 647\u2013681 (1988). https:\/\/doi.org\/10.2307\/1990951","journal-title":"J. Am. Math. Soc."},{"issue":"8","key":"10_CR45","doi-asserted-by":"publisher","first-page":"757","DOI":"10.2307\/2324578","volume":"97","author":"WP Thurston","year":"1990","unstructured":"Thurston, W.P.: Conway\u2019s tiling groups. Am. Math. Mon. 97(8), 757\u2013773 (1990). https:\/\/doi.org\/10.2307\/2324578","journal-title":"Am. Math. Mon."},{"issue":"2\u20133","key":"10_CR46","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0012-365X(87)90198-1","volume":"64","author":"FJ Zhang","year":"1987","unstructured":"Zhang, F.J., Guo, X.F.: Hamilton cycles in directed Euler tour graphs. Discrete Math. 64(2\u20133), 289\u2013298 (1987). https:\/\/doi.org\/10.1016\/0012-365X(87)90198-1","journal-title":"Discrete Math."},{"key":"10_CR47","doi-asserted-by":"publisher","unstructured":"Zhang, W.J., Qian, J.G., Zhang, F.J.: Distance between $$\\alpha $$ -orientations of plane graphs by facial cycle reversals. Acta Mathematica Sinica, English Series (2019). https:\/\/doi.org\/10.1007\/s10114-018-7403-4","DOI":"10.1007\/s10114-018-7403-4"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30786-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,20]],"date-time":"2021-01-20T04:01:58Z","timestamp":1611115318000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30786-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030307851","9783030307868"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30786-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"12 September 2019","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":"Vall de N\u00faria","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wg2019.sau.thilikos.info\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","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":"87","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":"29","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":"33% - 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.4","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":"1-2","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}