{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T02:29:48Z","timestamp":1747880988155,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"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_39","type":"book-chapter","created":{"date-parts":[[2019,11,27]],"date-time":"2019-11-27T23:02:50Z","timestamp":1574895770000},"page":"517-531","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An SPQR-Tree-Like Embedding Representation for Upward Planarity"],"prefix":"10.1007","author":[{"given":"Guido","family":"Br\u00fcckner","sequence":"first","affiliation":[]},{"given":"Markus","family":"Himmel","sequence":"additional","affiliation":[]},{"given":"Ignaz","family":"Rutter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,28]]},"reference":[{"key":"39_CR1","doi-asserted-by":"publisher","unstructured":"Angelini, P., Di Battista, G., Frati, F., Jel\u00ednek, V., Kratochv\u00edl, J., Patrignani, M., Rutter, I.: Testing planarity of partially embedded graphs. ACM Trans. Algorithms 11(4), 32:1\u201332:42 (2015). https:\/\/doi.org\/10.1145\/2629341","DOI":"10.1145\/2629341"},{"issue":"4","key":"39_CR2","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1007\/s00453-009-9380-6","volume":"60","author":"P Angelini","year":"2011","unstructured":"Angelini, P., Di Battista, G., Patrignani, M.: Finding a minimum-depth embedding of a planar graph in $$o(n^4)$$ time. Algorithmica 60(4), 890\u2013937 (2011). https:\/\/doi.org\/10.1007\/s00453-009-9380-6","journal-title":"Algorithmica"},{"issue":"6","key":"39_CR3","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/BF01188716","volume":"12","author":"P Bertolazzi","year":"1994","unstructured":"Bertolazzi, P., Di Battista, G., Liotta, G., Mannino, C.: Upward drawings of triconnected digraphs. Algorithmica 12(6), 476\u2013497 (1994)","journal-title":"Algorithmica"},{"issue":"1","key":"39_CR4","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1137\/S0097539794279626","volume":"27","author":"P Bertolazzi","year":"1998","unstructured":"Bertolazzi, P., Di Battista, G., Mannino, C., Tamassia, R.: Optimal upward planarity testing of single-source digraphs. SIAM J. Comput. 27(1), 132\u2013169 (1998)","journal-title":"SIAM J. Comput."},{"key":"39_CR5","unstructured":"Bl\u00e4sius, T., Kobourov, S.G., Rutter, I.: Simultaneous embedding of planar graphs. In: Tamassia, R. (ed.) Handbook of Graph Drawing and Visualization, Discrete Mathematics and its Applications, pp. 349\u2013373. CRC Press (2014)"},{"key":"39_CR6","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.comgeo.2016.03.001","volume":"55","author":"T Bl\u00e4sius","year":"2016","unstructured":"Bl\u00e4sius, T., Lehmann, S., Rutter, I.: Orthogonal graph drawing with inflexible edges. Comput. Geom. 55, 26\u201340 (2016). https:\/\/doi.org\/10.1016\/j.comgeo.2016.03.001","journal-title":"Comput. Geom."},{"issue":"3","key":"39_CR7","doi-asserted-by":"publisher","first-page":"33:1","DOI":"10.1145\/2838736","volume":"12","author":"T Bl\u00e4sius","year":"2016","unstructured":"Bl\u00e4sius, T., Rutter, I., Wagner, D.: Optimal orthogonal graph drawing with convex bend costs. ACM Trans. Algorithms 12(3), 33:1\u201333:32 (2016). https:\/\/doi.org\/10.1145\/2838736","journal-title":"ACM Trans. Algorithms"},{"issue":"4","key":"39_CR8","doi-asserted-by":"publisher","first-page":"1214","DOI":"10.1007\/s00453-017-0301-9","volume":"80","author":"T Bl\u00e4sius","year":"2018","unstructured":"Bl\u00e4sius, T., Karrer, A., Rutter, I.: Simultaneous embedding: edge orderings, relative positions, cutvertices. Algorithmica 80(4), 1214\u20131277 (2018)","journal-title":"Algorithmica"},{"key":"39_CR9","unstructured":"Br\u00fcckner, G., Himmel, M., Rutter, I.: An SPQR-tree-like embedding representation for upward planarity. CoRR abs\/1908.00352v1 (2019). https:\/\/arxiv.org\/abs\/1908.00352v1"},{"key":"39_CR10","doi-asserted-by":"crossref","unstructured":"Br\u00fcckner, G., Rutter, I.: Partial and constrained level planarity. In: Klein, P.N. (ed.) Proceedings of 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017), pp. 2000\u20132011. SIAM (2017)","DOI":"10.1137\/1.9781611974782.130"},{"key":"39_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-030-04414-5_3","volume-title":"Graph Drawing and Network Visualization","author":"G Br\u00fcckner","year":"2018","unstructured":"Br\u00fcckner, G., Rutter, I., Stumpf, P.: Level planarity: transitivity vs. even crossings. In: Biedl, T., Kerren, A. (eds.) GD 2018. LNCS, vol. 11282, pp. 39\u201352. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-04414-5_3"},{"key":"39_CR12","doi-asserted-by":"crossref","unstructured":"Da Lozzo, G., Di Battista, G., Frati, F.: Extending upward planar graph drawings. CoRR abs\/1902.06575 (2019)","DOI":"10.1007\/978-3-030-24766-9_25"},{"key":"39_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1007\/978-3-319-13075-0_50","volume-title":"Algorithms and Computation","author":"G Da Lozzo","year":"2014","unstructured":"Da Lozzo, G., Jel\u00ednek, V., Kratochv\u00edl, J., Rutter, I.: Planar embeddings with small and uniform faces. In: Ahn, H.-K., Shin, C.-S. (eds.) ISAAC 2014. LNCS, vol. 8889, pp. 633\u2013645. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13075-0_50"},{"key":"39_CR14","doi-asserted-by":"publisher","unstructured":"Da Lozzo, G., Rutter, I.: Approximation algorithms for facial cycles in planar embeddings. In: Hsu, W.L., Lee, D.T., Liao, C.S. (eds.) Proceedings of the 29th International Symposium on Algorithms and Computation (ISAAC 2018). LIPIcs, vol. 123, pp. 41:1\u201341:13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ISAAC.2018.41","DOI":"10.4230\/LIPIcs.ISAAC.2018.41"},{"key":"39_CR15","doi-asserted-by":"publisher","unstructured":"Di Battista, G., Tamassia, R.: Incremental planarity testing. In: Proceedings of the 30th Annual Symposium on Foundations of Computer Science, pp. 436\u2013441, October 1989. https:\/\/doi.org\/10.1109\/SFCS.1989.63515","DOI":"10.1109\/SFCS.1989.63515"},{"key":"39_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1007\/BFb0032061","volume-title":"Automata, Languages and Programming","author":"G Di Battista","year":"1990","unstructured":"Di Battista, G., Tamassia, R.: On-line graph algorithms with SPQR-trees. In: Paterson, M.S. (ed.) ICALP 1990. LNCS, vol. 443, pp. 598\u2013611. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/BFb0032061"},{"issue":"4","key":"39_CR17","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/BF01961541","volume":"15","author":"G Di Battista","year":"1996","unstructured":"Di Battista, G., Tamassia, R.: On-line maintenance of triconnected components with SPQR-trees. Algorithmica 15(4), 302\u2013318 (1996). https:\/\/doi.org\/10.1007\/BF01961541","journal-title":"Algorithmica"},{"key":"39_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/978-3-030-04414-5_34","volume-title":"Graph Drawing and Network Visualization","author":"W Didimo","year":"2018","unstructured":"Didimo, W., Liotta, G., Patrignani, M.: Bend-minimum orthogonal drawings in quadratic time. In: Biedl, T., Kerren, A. (eds.) GD 2018. LNCS, vol. 11282, pp. 481\u2013494. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-04414-5_34"},{"key":"39_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-60313-1_145","volume-title":"Algorithms\u2014ESA 1995","author":"Q-W Feng","year":"1995","unstructured":"Feng, Q.-W., Cohen, R.F., Eades, P.: Planarity for clustered graphs. In: Spirakis, P. (ed.) ESA 1995. LNCS, vol. 979, pp. 213\u2013226. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60313-1_145"},{"key":"39_CR20","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-1-4614-0110-0_14","volume-title":"Thirty Essays on Geometric Graph Theory","author":"R Fulek","year":"2013","unstructured":"Fulek, R., Pelsmajer, M.J., Schaefer, M., \u0160tefankovi\u010d, D.: Hanani-Tutte, monotone drawings, and level-planarity. In: Pach, J. (ed.) Thirty Essays on Geometric Graph Theory, pp. 263\u2013287. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4614-0110-0_14"},{"issue":"2","key":"39_CR21","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0022-0000(85)90014-5","volume":"30","author":"HN Gabow","year":"1985","unstructured":"Gabow, H.N., Tarjan, R.E.: A linear-time algorithm for a special case of disjoint set union. J. Comput. Syst. Sci. 30(2), 209\u2013221 (1985)","journal-title":"J. Comput. Syst. Sci."},{"key":"39_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/3-540-44541-2_8","volume-title":"Graph Drawing","author":"C Gutwenger","year":"2001","unstructured":"Gutwenger, C., Mutzel, P.: A linear time implementation of SPQR-trees. In: Marks, J. (ed.) GD 2000. LNCS, vol. 1984, pp. 77\u201390. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44541-2_8"},{"issue":"3","key":"39_CR23","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/0202012","volume":"2","author":"JE Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Tarjan, R.E.: Dividing a graph into triconnected components. SIAM J. Comput. 2(3), 135\u2013158 (1973)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"39_CR24","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1137\/S0097539792235906","volume":"25","author":"MD Hutton","year":"1996","unstructured":"Hutton, M.D., Lubiw, A.: Upward planar drawing of single-source acyclic digraphs. SIAM J. Comput. 25(2), 291\u2013311 (1996)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"39_CR25","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1016\/j.comgeo.2012.07.005","volume":"46","author":"V Jel\u00ednek","year":"2013","unstructured":"Jel\u00ednek, V., Kratochv\u00edl, J., Rutter, I.: A Kuratowski-type theorem for planarity of partially embedded graphs. Comput. Geom.: Theory Appl. 46(4), 466\u2013492 (2013)","journal-title":"Comput. Geom.: Theory Appl."},{"key":"39_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/3-540-46648-7_7","volume-title":"Graph Drawing","author":"M J\u00fcnger","year":"1999","unstructured":"J\u00fcnger, M., Leipert, S.: Level planar embedding in linear time. In: Kratochv\u00edyl, J. (ed.) GD 1999. LNCS, vol. 1731, pp. 72\u201381. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-46648-7_7"},{"issue":"3","key":"39_CR27","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1215\/S0012-7094-37-00336-3","volume":"3","author":"S Mac Lane","year":"1937","unstructured":"Mac Lane, S.: A structural characterization of planar combinatorial graphs. Duke Math. J. 3(3), 460\u2013472 (1937). https:\/\/doi.org\/10.1215\/S0012-7094-37-00336-3","journal-title":"Duke Math. J."},{"issue":"1","key":"39_CR28","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/0095-8956(76)90024-1","volume":"21","author":"CR Platt","year":"1976","unstructured":"Platt, C.R.: Planar lattices and planar graphs. J. Comb. Theory Ser. B 21(1), 30\u201339 (1976)","journal-title":"J. Comb. Theory Ser. B"},{"key":"39_CR29","doi-asserted-by":"crossref","unstructured":"Randerath, B., Speckenmeyer, E., Boros, E., Hammer, P., Kogan, A., Makino, K., Simeone, B., Cepek, O.: A satisfiability formulation of problems on level graphs. Electron. Notes Discret. Math. 9, 269\u2013277 (2001). lICS 2001 Workshop on Theory and Applications of Satisfiability Testing (SAT 2001)","DOI":"10.1016\/S1571-0653(04)00327-0"},{"key":"39_CR30","doi-asserted-by":"publisher","DOI":"10.3138\/9781487584863","volume-title":"Connectivity in Graphs","author":"WT Tutte","year":"1966","unstructured":"Tutte, W.T.: Connectivity in Graphs. University of Toronto Press, Toronto (1966)"}],"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_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,28]],"date-time":"2023-11-28T01:06:01Z","timestamp":1701133561000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-35802-0_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030358013","9783030358020"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35802-0_39","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"}]}}