{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:12:58Z","timestamp":1743023578468,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"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_36","type":"book-chapter","created":{"date-parts":[[2019,11,27]],"date-time":"2019-11-27T23:02:50Z","timestamp":1574895770000},"page":"468-481","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Homotopy Height, Grid-Major Height and Graph-Drawing Height"],"prefix":"10.1007","author":[{"given":"Therese","family":"Biedl","sequence":"first","affiliation":[]},{"given":"Erin Wolf","family":"Chambers","sequence":"additional","affiliation":[]},{"given":"David","family":"Eppstein","sequence":"additional","affiliation":[]},{"given":"Arnaud","family":"De Mesmay","sequence":"additional","affiliation":[]},{"given":"Tim","family":"Ophelders","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,28]]},"reference":[{"key":"36_CR1","first-page":"26","volume":"46","author":"K Wagner","year":"1936","unstructured":"Wagner, K.: Bemerkungen zum Vierfarbenproblem. Jahresber. Dtsch. Math. Ver. 46, 26\u201332 (1936)","journal-title":"Jahresber. Dtsch. Math. Ver."},{"issue":"4","key":"36_CR2","first-page":"229","volume":"11","author":"I F\u00e1ry","year":"1948","unstructured":"F\u00e1ry, I.: On straight line representation of planar graphs. Acta Sci. Math. (Szeged) 11(4), 229\u2013233 (1948)","journal-title":"Acta Sci. Math. (Szeged)"},{"key":"36_CR3","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1090\/S0002-9939-1951-0041425-5","volume":"2","author":"SK Stein","year":"1951","unstructured":"Stein, S.K.: Convex maps. Proc. Am. Math. Soc. 2, 464\u2013466 (1951)","journal-title":"Proc. Am. Math. Soc."},{"key":"36_CR4","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, 743\u2013767 (1963)","journal-title":"Proc. London Math. Soc."},{"key":"36_CR5","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"HD Fraysseix","year":"1990","unstructured":"Fraysseix, H.D., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10, 41\u201351 (1990)","journal-title":"Combinatorica"},{"key":"36_CR6","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: Symposium on Discrete Algorithms (SODA 1990), pp. 138\u2013148. SIAM (1990)"},{"key":"36_CR7","first-page":"147","volume":"2","author":"D Dolev","year":"1984","unstructured":"Dolev, D., Leighton, T., Trickey, H.: Planar embedding of planar graphs. Adv. Comput. Res. 2, 147\u2013161 (1984)","journal-title":"Adv. Comput. Res."},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"Fraysseix, H.D., Pach, J., Pollack, R.: Small sets supporting F\u00e1ry embeddings of planar graphs. In: Symposium Theory of Computing (STOC 1988), pp. 426\u2013433. ACM (1988)","DOI":"10.1145\/62212.62254"},{"issue":"5","key":"36_CR9","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1137\/0221055","volume":"21","author":"LS Heath","year":"1992","unstructured":"Heath, L.S., Rosenberg, A.L.: Laying out graphs using queues. SIAM J. Comput. 21(5), 927\u2013958 (1992)","journal-title":"SIAM J. Comput."},{"key":"36_CR10","doi-asserted-by":"crossref","unstructured":"Dujmovi\u0107, V., Fellows, M.R., Kitching, M., Liotta, G., McCartin, C., Nishimura, N., Ragde, P., Rosamond, F., Whitesides, S., Wood, D.R.: On the parameterized complexity of layered graph drawing. Algorithmica 52(2), 267\u2013292 (2008)","DOI":"10.1007\/s00453-007-9151-1"},{"issue":"4","key":"36_CR11","doi-asserted-by":"publisher","first-page":"335","DOI":"10.7155\/jgaa.00075","volume":"7","author":"S Felsner","year":"2003","unstructured":"Felsner, S., Liotta, G., Wismath, S.: Straight-line drawings on restricted integer grids in two and three dimensions. J. Graph Algorithms Appl. 7(4), 335\u2013362 (2003)","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"36_CR12","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s00454-010-9310-z","volume":"45","author":"T Biedl","year":"2011","unstructured":"Biedl, T.: Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs. Discret. Comput. Geom. 45(1), 141\u2013160 (2011)","journal-title":"Discret. Comput. Geom."},{"key":"36_CR13","unstructured":"Chambers, E.W., Letscher, D.: On the height of a homotopy. In: Canadian Conference on Computational Geometry (CCCG 2009), pp. 103\u2013106 (2009)"},{"issue":"1","key":"36_CR14","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s00454-015-9737-3","volume":"55","author":"S Har-Peled","year":"2016","unstructured":"Har-Peled, S., Nayyeri, A., Salavatipour, M., Sidiropoulos, A.: How to walk your dog in the mountains with no magic leash. Discret. Comput. Geom. 55(1), 39\u201373 (2016)","journal-title":"Discret. Comput. Geom."},{"key":"36_CR15","doi-asserted-by":"crossref","unstructured":"Chambers, E.W., de Mesmay, A., Ophelders, T.: On the complexity of optimal homotopies. In: Symposium on Discrete Algorithms (SODA 2018), pp. 1121\u20131134. SIAM (2018)","DOI":"10.1137\/1.9781611975031.73"},{"issue":"1","key":"36_CR16","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inf. Comput. 85(1), 12\u201375 (1990)","journal-title":"Inf. Comput."},{"key":"36_CR17","doi-asserted-by":"crossref","unstructured":"Wismath, S.K.: Characterizing bar line-of-sight graphs. In: Symposium on Computational Geometry (SoCG 1985), pp. 147\u2013152. ACM (1985)","DOI":"10.1145\/323233.323253"},{"key":"36_CR18","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF02187705","volume":"1","author":"R Tamassia","year":"1986","unstructured":"Tamassia, R., Tollis, I.: A unified approach to visibility representations of planar graphs. Discret. Comput. Geom. 1, 321\u2013341 (1986)","journal-title":"Discret. Comput. Geom."},{"key":"36_CR19","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/BF02187706","volume":"1","author":"P Rosenstiehl","year":"1986","unstructured":"Rosenstiehl, P., Tarjan, R.E.: Rectilinear planar layouts and bipolar orientation of planar graphs. Discret. Comput. Geom. 1, 343\u2013353 (1986)","journal-title":"Discret. Comput. Geom."},{"issue":"3","key":"36_CR20","doi-asserted-by":"publisher","first-page":"784","DOI":"10.1007\/s00454-013-9521-1","volume":"50","author":"MJ Alam","year":"2013","unstructured":"Alam, M.J., Biedl, T., Felsner, S., Kaufmann, M., Kobourov, S.G., Ueckerdt, T.: Computing cartograms with optimal complexity. Discret. Comput. Geom. 50(3), 784\u2013810 (2013)","journal-title":"Discret. Comput. Geom."},{"key":"36_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-662-45803-7_32","volume-title":"Graph Drawing","author":"T Biedl","year":"2014","unstructured":"Biedl, T.: Height-preserving transformations of planar graph drawings. In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp. 380\u2013391. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45803-7_32"},{"issue":"1","key":"36_CR22","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1002\/jgt.10168","volume":"46","author":"J Pach","year":"2004","unstructured":"Pach, J., T\u00f3th, G.: Monotone drawings of planar graphs. J. Graph Theory 46(1), 39\u201347 (2004)","journal-title":"J. Graph Theory"},{"issue":"1","key":"36_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-004-1144-8","volume":"44","author":"P Eades","year":"2006","unstructured":"Eades, P., Feng, Q., Lin, X., Nagamochi, H.: Straight-line drawing algorithms for hierarchical graphs and clustered graphs. Algorithmica 44(1), 1\u201332 (2006)","journal-title":"Algorithmica"},{"issue":"5","key":"36_CR24","first-page":"139","volume":"12","author":"F Frati","year":"2010","unstructured":"Frati, F.: Lower bounds on the area requirements of series-parallel graphs. Discret. Math. Theor. Comput. Sci. 12(5), 139\u2013174 (2010)","journal-title":"Discret. Math. Theor. Comput. Sci."},{"issue":"3","key":"36_CR25","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0166-218X(93)90012-D","volume":"45","author":"J Gustedt","year":"1993","unstructured":"Gustedt, J.: On the pathwidth of chordal graphs. Discret. Appl. Math. 45(3), 233\u2013248 (1993)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"36_CR26","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/BF01840379","volume":"5","author":"D Bienstock","year":"1990","unstructured":"Bienstock, D., Monma, C.L.: On the complexity of embedding planar graphs to minimize certain distance measures. Algorithmica 5(1), 93\u2013109 (1990)","journal-title":"Algorithmica"}],"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_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,28]],"date-time":"2023-11-28T01:05:49Z","timestamp":1701133549000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-35802-0_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030358013","9783030358020"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35802-0_36","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"}]}}