{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:09Z","timestamp":1759639089605,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030687656"},{"type":"electronic","value":"9783030687663"}],"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-68766-3_12","type":"book-chapter","created":{"date-parts":[[2021,2,14]],"date-time":"2021-02-14T09:11:53Z","timestamp":1613293913000},"page":"151-159","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Mixed Linear Layouts of Series-Parallel Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7602-1524","authenticated-orcid":false,"given":"Patrizio","family":"Angelini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3414-7444","authenticated-orcid":false,"given":"Michael A.","family":"Bekos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5764-7719","authenticated-orcid":false,"given":"Philipp","family":"Kindermann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1545-5580","authenticated-orcid":false,"given":"Tamara","family":"Mchedlidze","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,14]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","unstructured":"Alam, J.M., Bekos, M.A., Gronemann, M., Kaufmann, M., Pupyrev, S.: On dispersable book embeddings. In: Brandst\u00e4dt, A., K\u00f6hler, E., Meer, K. (eds.) WG. LNCS, vol. 11159, pp. 1\u201314. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00256-5_1","DOI":"10.1007\/978-3-030-00256-5_1"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-030-04414-5_15","volume-title":"Graph Drawing and Network Visualization","author":"JM Alam","year":"2018","unstructured":"Alam, J.M., Bekos, M.A., Gronemann, M., Kaufmann, M., Pupyrev, S.: Queue layouts of planar 3-trees. In: Biedl, T., Kerren, A. (eds.) GD 2018. LNCS, vol. 11282, pp. 213\u2013226. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-04414-5_15"},{"key":"12_CR3","unstructured":"Angelini, P., Bekos, M.A., Kindermann, P., Mchedlidze, T.: On mixed linear layouts of series-parallel graphs. CoRR abs\/2008.10475v2 (2020). http:\/\/arxiv.org\/abs\/2008.10475v2"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Bannister, M.J., Devanny, W.E., Dujmovi\u0107, V., Eppstein, D., Wood, D.R.: Track layouts, layered path decompositions, and leveled planarity. Algorithmica (2018). https:\/\/doi.org\/10.1007\/s00453-018-0487-5","DOI":"10.1007\/s00453-018-0487-5"},{"issue":"1","key":"12_CR5","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/s00453-015-0016-8","volume":"75","author":"MA Bekos","year":"2016","unstructured":"Bekos, M.A., Gronemann, M., Raftopoulou, C.N.: Two-page book embeddings of 4-planar graphs. Algorithmica 75(1), 158\u2013185 (2016). https:\/\/doi.org\/10.1007\/s00453-015-0016-8","journal-title":"Algorithmica"},{"key":"12_CR6","unstructured":"Bekos, M.A., Kaufmann, M., Klute, F., Pupyrev, S., Raftopoulou, C.N., Ueckerdt, T.: Four pages are indeed necessary for planar graphs. J. Comput. Geom. 11(1), 332\u2013353 (2020). https:\/\/journals.carleton.ca\/jocg\/index.php\/jocg\/article\/view\/504"},{"key":"12_CR7","doi-asserted-by":"publisher","unstructured":"Bernhart, F., Kainen, P.C.: The book thickness of a graph. J. Comb. Theory Ser. B 27(3), 320\u2013331 (1979). https:\/\/doi.org\/10.1016\/0095-8956(79)90021-2","DOI":"10.1016\/0095-8956(79)90021-2"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.ejc.2017.07.009","volume":"68","author":"C Binucci","year":"2018","unstructured":"Binucci, C., Di Giacomo, E., Hossain, M.I., Liotta, G.: 1-page and 2-page drawings with bounded number of crossings per edge. Eur. J. Comb. 68, 24\u201337 (2018). https:\/\/doi.org\/10.1016\/j.ejc.2017.07.009","journal-title":"Eur. J. Comb."},{"issue":"3","key":"12_CR9","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/BF02591867","volume":"26","author":"G Cornu\u00e9jols","year":"1983","unstructured":"Cornu\u00e9jols, G., Naddef, D., Pulleyblank, W.R.: Halin graphs and the travelling salesman problem. Math. Program. 26(3), 287\u2013294 (1983). https:\/\/doi.org\/10.1007\/BF02591867","journal-title":"Math. Program."},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/978-3-030-35802-0_35","volume-title":"Graph Drawing and Network Visualization","author":"P de Col","year":"2019","unstructured":"de Col, P., Klute, F., N\u00f6llenburg, M.: Mixed linear layouts: complexity, heuristics, and experiments. In: Archambault, D., T\u00f3th, C.D. (eds.) GD 2019. LNCS, vol. 11904, pp. 460\u2013467. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35802-0_35"},{"issue":"6","key":"12_CR11","doi-asserted-by":"publisher","first-page":"2243","DOI":"10.1137\/130908051","volume":"42","author":"G Di Battista","year":"2013","unstructured":"Di Battista, G., Frati, F., Pach, J.: On the queue number of planar graphs. SIAM J. Comput. 42(6), 2243\u20132285 (2013). https:\/\/doi.org\/10.1137\/130908051","journal-title":"SIAM J. Comput."},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.jctb.2014.07.005","volume":"110","author":"V Dujmovi\u0107","year":"2015","unstructured":"Dujmovi\u0107, V.: Graph layouts via layered separators. J. Comb. Theory Ser. B 110, 79\u201389 (2015). https:\/\/doi.org\/10.1016\/j.jctb.2014.07.005","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"12_CR13","doi-asserted-by":"publisher","first-page":"89","DOI":"10.7155\/jgaa.00454","volume":"22","author":"V Dujmovi\u0107","year":"2018","unstructured":"Dujmovi\u0107, V., Frati, F.: Stack and queue layouts via layered separators. J. Graph Algorithms Appl. 22(1), 89\u201399 (2018). https:\/\/doi.org\/10.7155\/jgaa.00454","journal-title":"J. Graph Algorithms Appl."},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Dujmovi\u0107, V., Joret, G., Micek, P., Morin, P., Ueckerdt, T., Wood, D.R.: Planar graphs have bounded queue-number. In: Zuckerman, D. (ed.) FOCS. pp. 862\u2013875. IEEE Computer Society (2019). https:\/\/doi.org\/10.1109\/FOCS.2019.00056","DOI":"10.1109\/FOCS.2019.00056"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Dujmovi\u0107, V., Wood, D.R.: On linear layouts of graphs. Discrete Math. Theoret. Comput. Sci. 6(2), 339\u2013358 (2004). http:\/\/dmtcs.episciences.org\/317","DOI":"10.46298\/dmtcs.317"},{"issue":"1","key":"12_CR16","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BF00149287","volume":"2","author":"G Ewald","year":"1973","unstructured":"Ewald, G.: Hamiltonian circuits in simplicial complexes. Geometriae Dedicata 2(1), 115\u2013125 (1973). https:\/\/doi.org\/10.1007\/BF00149287","journal-title":"Geometriae Dedicata"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/BF02574056","volume":"13","author":"H de Fraysseix","year":"1995","unstructured":"de Fraysseix, H., de Mendez, P.O., Pach, J.: A left-first search algorithm for planar graphs. Discrete Comput. Geometry 13, 459\u2013468 (1995). https:\/\/doi.org\/10.1007\/BF02574056","journal-title":"Discrete Comput. Geometry"},{"key":"12_CR18","doi-asserted-by":"publisher","unstructured":"Guan, X., Yang, W.: Embedding planar 5-graphs in three pages. Discret. Appl. Math. (2019). https:\/\/doi.org\/10.1016\/j.dam.2019.11.020","DOI":"10.1016\/j.dam.2019.11.020"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Heath, L.S.: Embedding planar graphs in seven pages. In: FOCS, pp. 74\u201383. IEEE Computer Society (1984). https:\/\/doi.org\/10.1109\/SFCS.1984.715903","DOI":"10.1109\/SFCS.1984.715903"},{"issue":"3","key":"12_CR20","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1137\/0405031","volume":"5","author":"LS Heath","year":"1992","unstructured":"Heath, L.S., Leighton, F.T., Rosenberg, A.L.: Comparing queues and stacks as mechanisms for laying out graphs. SIAM J. Discrete Math. 5(3), 398\u2013412 (1992). https:\/\/doi.org\/10.1137\/0405031","journal-title":"SIAM J. Discrete Math."},{"issue":"5","key":"12_CR21","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). https:\/\/doi.org\/10.1137\/0221055","journal-title":"SIAM J. Comput."},{"key":"12_CR22","unstructured":"Hoffmann, M., Klemz, B.: Triconnected planar graphs of maximum degree five are subhamiltonian. In: Bender, M.A., Svensson, O., Herman, G. (eds.) ESA. LIPIcs, vol. 144, pp. 58:1\u201358:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2019.58"},{"issue":"7","key":"12_CR23","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1016\/j.aml.2006.08.019","volume":"20","author":"PC Kainen","year":"2007","unstructured":"Kainen, P.C., Overbay, S.: Extension of a theorem of Whitney. Appl. Math. Lett. 20(7), 835\u2013837 (2007). https:\/\/doi.org\/10.1016\/j.aml.2006.08.019","journal-title":"Appl. Math. Lett."},{"key":"12_CR24","unstructured":"Nishizeki, T., Chiba, N.: Hamiltonian cycles. In: Planar Graphs: Theory and Algorithms, chap. 10, pp. 171\u2013184. Dover Books on Mathematics, Courier Dover Publications (2008)"},{"key":"12_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-319-73915-1_17","volume-title":"Graph Drawing and Network Visualization","author":"S Pupyrev","year":"2018","unstructured":"Pupyrev, S.: Mixed linear layouts of planar graphs. In: Frati, F., Ma, K.-L. (eds.) GD 2017. LNCS, vol. 10692, pp. 197\u2013209. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73915-1_17"},{"key":"12_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/BFb0030834","volume-title":"Computing and Combinatorics","author":"S Rengarajan","year":"1995","unstructured":"Rengarajan, S., Veni Madhavan, C.E.: Stack and queue number of 2-trees. In: Du, D.-Z., Li, M. (eds.) COCOON 1995. LNCS, vol. 959, pp. 203\u2013212. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/BFb0030834"},{"key":"12_CR27","doi-asserted-by":"crossref","unstructured":"Wiechert, V.: On the queue-number of graphs with bounded tree-width. Electr. J. Comb. 24(1), P1.65 (2017). http:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v24i1p65","DOI":"10.37236\/6429"},{"key":"12_CR28","doi-asserted-by":"publisher","unstructured":"Yannakakis, M.: Four pages are necessary and sufficient for planar graphs (extended abstract). In: Hartmanis, J. (ed.) ACM Symposium on Theory of Computing, pp. 104\u2013108. ACM (1986). https:\/\/doi.org\/10.1145\/12130.12141","DOI":"10.1145\/12130.12141"},{"issue":"1","key":"12_CR29","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/0022-0000(89)90032-9d","volume":"38","author":"M Yannakakis","year":"1989","unstructured":"Yannakakis, M.: Embedding planar graphs in four pages. J. Comput. Syst. Sci. 38(1), 36\u201367 (1989). https:\/\/doi.org\/10.1016\/0022-0000(89)90032-9d","journal-title":"J. Comput. Syst. Sci."},{"key":"12_CR30","unstructured":"Yannakakis, M.: Planar graphs that need four pages. CoRR abs\/2005.14111 (2020). https:\/\/arxiv.org\/abs\/2005.14111"}],"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-68766-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T23:03:53Z","timestamp":1739401433000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-68766-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030687656","9783030687663"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-68766-3_12","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":"14 February 2021","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":"Vancouver, BC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","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":"16 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/gd2020.cs.ubc.ca\/","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":"82","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":"9","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":"35% - 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,02","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":"3","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)"}}]}}