{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:02:40Z","timestamp":1743145360754,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030358013"},{"type":"electronic","value":"9783030358020"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-35802-0_9","type":"book-chapter","created":{"date-parts":[[2019,11,27]],"date-time":"2019-11-27T23:02:50Z","timestamp":1574895770000},"page":"114-121","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Balanced Schnyder Woods for Planar Triangulations: An Experimental Study with Applications to Graph Drawing and Graph Separators"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1142-2562","authenticated-orcid":false,"given":"Luca","family":"Castelli Aleardi","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,28]]},"reference":[{"issue":"1","key":"9_CR1","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.jcta.2008.05.005","volume":"116","author":"O Bernardi","year":"2009","unstructured":"Bernardi, O., Bonichon, N.: Catalan\u2019s intervals and realizers of triangulations. J. Comb. Theory Ser. A 116(1), 55\u201375 (2009). https:\/\/hal.archives-ouvertes.fr\/hal-00143870(22 pages)","journal-title":"J. Comb. Theory Ser. A"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.disc.2004.01.021","volume":"298","author":"N Bonichon","year":"2005","unstructured":"Bonichon, N.: A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths. Discret. Math. 298, 104\u2013114 (2005). https:\/\/hal.archives-ouvertes.fr\/hal-00307593","journal-title":"Discret. Math."},{"issue":"4","key":"9_CR3","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). https:\/\/doi.org\/10.1007\/s00453-006-0177-6","journal-title":"Algorithmica"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-642-16926-7_25","volume-title":"Graph Theoretic Concepts in Computer Science","author":"N Bonichon","year":"2010","unstructured":"Bonichon, N., Gavoille, C., Hanusse, N., Ilcinkas, D.: Connections between theta-graphs, delaunay triangulations, and orthogonal surfaces. In: Thilikos, D.M. (ed.) WG 2010. LNCS, vol. 6410, pp. 266\u2013278. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16926-7_25"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-642-14165-2_3","volume-title":"Automata, Languages and Programming","author":"N Bonichon","year":"2010","unstructured":"Bonichon, N., Gavoille, C., Hanusse, N., Perkovi\u0107, L.: Plane spanners of maximum degree six. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6198, pp. 19\u201330. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14165-2_3"},{"issue":"4","key":"9_CR6","doi-asserted-by":"publisher","first-page":"687","DOI":"10.7155\/jgaa.00435","volume":"21","author":"G Borradaile","year":"2017","unstructured":"Borradaile, G., Iglesias, J., Migler, T., Ochoa, A., Wilfong, G.T., Zhang, L.: Egalitarian graph orientations. J. Graph Algorithms Appl. 21(4), 687\u2013708 (2017). https:\/\/doi.org\/10.7155\/jgaa.00435","journal-title":"J. Graph Algorithms Appl."},{"key":"9_CR7","unstructured":"Brehm, E.: 3-orientations and Schnyder 3-tree-decompositions. Master\u2019s thesis, FB Mathematik und Informatik, Freie Universit\u00e4t Berlin (2000)"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Castelli Aleardi, L.: Balanced Schnyder woods for planar triangulations: an experimental study with applications to graph drawing and graph separators (2019). https:\/\/arxiv.org\/abs\/1908.06688","DOI":"10.1007\/978-3-030-35802-0_9"},{"issue":"1","key":"9_CR9","doi-asserted-by":"publisher","first-page":"247","DOI":"10.20382\/jocg.v9i1a8","volume":"9","author":"L Castelli Aleardi","year":"2018","unstructured":"Castelli Aleardi, L., Devillers, O.: Array-based compact data structures for triangulations: practical solutions with theoretical guarantees. JoCG 9(1), 247\u2013289 (2018). https:\/\/doi.org\/10.20382\/jocg.v9i1a8","journal-title":"JoCG"},{"issue":"3","key":"9_CR10","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/s00454-009-9169-z","volume":"42","author":"L Castelli Aleardi","year":"2009","unstructured":"Castelli Aleardi, L., Fusy, \u00c9., Lewiner, T.: Schnyder woods for higher genus triangulated surfaces, with applications to encoding. Discret. Comput. Geom. 42(3), 489\u2013516 (2009). https:\/\/hal.inria.fr\/hal-00712046v1","journal-title":"Discret. Comput. Geom."},{"issue":"3","key":"9_CR11","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s00454-016-9832-0","volume":"57","author":"V Despr\u00e9","year":"2017","unstructured":"Despr\u00e9, V., Gon\u00e7alves, D., L\u00e9v\u00eaque, B.: Encoding toroidal triangulations. Discret. Comput. Geom. 57(3), 507\u2013544 (2017). https:\/\/doi.org\/10.1007\/s00454-016-9832-0","journal-title":"Discret. Comput. Geom."},{"issue":"2","key":"9_CR12","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s00454-009-9235-6","volume":"43","author":"R Dhandapani","year":"2010","unstructured":"Dhandapani, R.: Greedy drawings of triangulations. Discret. Comput. Geom. 43(2), 375\u2013392 (2010). https:\/\/doi.org\/10.1007\/s00454-009-9235-6","journal-title":"Discret. Comput. Geom."},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Felsner, S.: Lattice structures from planar graphs. Electr. J. Comb. 11(1) (2004)","DOI":"10.37236\/1768"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Felsner, S., Zickfeld, F.: On the number of planar orientations with prescribed degrees. Electr. J. Comb. 15(1) (2008)","DOI":"10.37236\/801"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Fowler, J.J., Kobourov, S.G.: Planar preprocessing for spring embedders. In: 20th International Symposium Graph Drawing, pp. 388\u2013399 (2012)","DOI":"10.1007\/978-3-642-36763-2_35"},{"issue":"1","key":"9_CR16","first-page":"2:2:1","volume":"21","author":"E Fox-Epstein","year":"2016","unstructured":"Fox-Epstein, E., Mozes, S., Phothilimthana, P.M., Sommer, C.: Short and simple cycle separators in planar graphs. ACM J. Exp. Algorithm 21(1), 2:2:1\u20132:2:24 (2016)","journal-title":"ACM J. Exp. Algorithm"},{"issue":"1","key":"9_CR17","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"},{"issue":"1","key":"9_CR18","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s00454-013-9552-7","volume":"51","author":"D Gon\u00e7alves","year":"2014","unstructured":"Gon\u00e7alves, D., L\u00e9v\u00eaque, B.: Toroidal maps: Schnyder woods, orthogonal surfaces and straight-line representations. Discret. Comput. Geom. 51(1), 67\u2013131 (2014). https:\/\/doi.org\/10.1007\/s00454-013-9552-7","journal-title":"Discret. Comput. Geom."},{"issue":"1","key":"9_CR19","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1111\/1467-8659.t01-1-00649","volume":"22","author":"C Gotsman","year":"2003","unstructured":"Gotsman, C.: On the optimality of valence-based connectivity coding. Comput. Graph. Forum 22(1), 99\u2013102 (2003). https:\/\/doi.org\/10.1111\/1467-8659.t01-1-00649","journal-title":"Comput. Graph. Forum"},{"key":"9_CR20","doi-asserted-by":"publisher","unstructured":"Holzer, M., Schulz, F., Wagner, D., Prasinos, G., Zaroliagis, C.D.: Engineering planar separator algorithms. ACM J. Exp. Algorithm 14 (2009). https:\/\/doi.org\/10.1145\/1498698.1571635","DOI":"10.1145\/1498698.1571635"},{"key":"9_CR21","unstructured":"Li, Y., Sun, X., Watson, S.S.: Schnyder woods, sle(16), and liouville quantum gravity. Technical report arXiv:1705.03573v1 [math.PR], ArXiV, May 2016"},{"issue":"2","key":"9_CR22","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"RJ Lipton","year":"1979","unstructured":"Lipton, R.J., Tarjan, R.E.: A separator theorem for planar graphs. SIAM J. Appl. Math. 36(2), 177\u2013189 (1979)","journal-title":"SIAM J. Appl. Math."},{"issue":"3","key":"9_CR23","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1137\/0209046","volume":"9","author":"RJ Lipton","year":"1980","unstructured":"Lipton, R.J., Tarjan, R.E.: Applications of a planar separator theorem. SIAM J. Comput. 9(3), 615\u2013627 (1980). https:\/\/doi.org\/10.1137\/0209046","journal-title":"SIAM J. Comput."},{"issue":"3","key":"9_CR24","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0000(86)90030-9","volume":"32","author":"GL Miller","year":"1986","unstructured":"Miller, G.L.: Finding small simple cycle separators for 2-connected planar graphs. J. Comput. Syst. Sci. 32(3), 265\u2013279 (1986). https:\/\/doi.org\/10.1016\/0022-0000(86)90030-9","journal-title":"J. Comput. Syst. Sci."},{"key":"9_CR25","unstructured":"PIGALE, Public Implementation of a Graph Algorithm Library and Editor. http:\/\/pigale.sourceforge.net\/"},{"issue":"3\u20134","key":"9_CR26","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/s00453-006-0114-8","volume":"46","author":"D Poulalhon","year":"2006","unstructured":"Poulalhon, D., Schaeffer, G.: Optimal coding and sampling of triangulations. Algorithmica 46(3\u20134), 505\u2013527 (2006)","journal-title":"Algorithmica"},{"key":"9_CR27","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 90, pp. 138\u2013148 (1990). http:\/\/departamento.us.es\/dma1euita\/PAIX\/Referencias\/schnyder.pdf"},{"key":"9_CR28","doi-asserted-by":"publisher","unstructured":"Spielman, D.A., Teng, S.: Disk packings and planar separators. In: Proceedings of the Twelfth Annual Symposium on Computational Geometry, pp. 349\u2013358 (1996). https:\/\/doi.org\/10.1145\/237218.237404","DOI":"10.1145\/237218.237404"}],"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-35802-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,28]],"date-time":"2023-11-28T01:03:09Z","timestamp":1701133389000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-35802-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030358013","9783030358020"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35802-0_9","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":"28 November 2019","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":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","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":"17 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/kam.mff.cuni.cz\/gd2019\/","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":"113","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":"34","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":"8","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":"30% - 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.11","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":"12.55","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"}]}}