{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:57:09Z","timestamp":1743105429502,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031492716"},{"type":"electronic","value":"9783031492723"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-49272-3_10","type":"book-chapter","created":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T09:04:34Z","timestamp":1704963874000},"page":"135-151","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Families of Planar DAGs with Constant Stack Number"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0454-3937","authenticated-orcid":false,"given":"Martin","family":"N\u00f6llenburg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4089-673X","authenticated-orcid":false,"given":"Sergey","family":"Pupyrev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,1,1]]},"reference":[{"issue":"1\u20133","key":"10_CR1","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0012-365X(95)00349-2","volume":"152","author":"AA Ageev","year":"1996","unstructured":"Ageev, A.A.: A triangle-free circle graph with chromatic number 5. Discret. Math. 152(1\u20133), 295\u2013298 (1996). https:\/\/doi.org\/10.1016\/0012-365X(95)00349-2","journal-title":"Discret. Math."},{"issue":"9","key":"10_CR2","doi-asserted-by":"publisher","first-page":"2564","DOI":"10.1007\/s00453-020-00697-4","volume":"82","author":"JM Alam","year":"2020","unstructured":"Alam, J.M., Bekos, M.A., Gronemann, M., Kaufmann, M., Pupyrev, S.: Queue layouts of planar 3-trees. Algorithmica 82(9), 2564\u20132585 (2020). https:\/\/doi.org\/10.1007\/s00453-020-00697-4","journal-title":"Algorithmica"},{"issue":"5","key":"10_CR3","doi-asserted-by":"publisher","first-page":"1176","DOI":"10.1007\/s00453-022-01067-y","volume":"85","author":"JM Alam","year":"2023","unstructured":"Alam, J.M., Bekos, M.A., Gronemann, M., Kaufmann, M., Pupyrev, S.: Lazy queue layouts of posets. Algorithmica 85(5), 1176\u20131201 (2023). https:\/\/doi.org\/10.1007\/s00453-022-01067-y","journal-title":"Algorithmica"},{"key":"10_CR4","first-page":"47","volume":"119","author":"M Alhashem","year":"2015","unstructured":"Alhashem, M., Jourdan, G., Zaguia, N.: On the book embedding of ordered sets. Ars Comb. 119, 47\u201364 (2015)","journal-title":"Ars Comb."},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/3-540-62495-3_34","volume-title":"Graph Drawing","author":"M Alzohairi","year":"1997","unstructured":"Alzohairi, M., Rival, I.: Series-parallel planar ordered sets have pagenumber two. In: North, S. (ed.) GD 1996. LNCS, vol. 1190, pp. 11\u201324. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-62495-3_34"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.tcs.2022.09.019","volume":"936","author":"P Angelini","year":"2022","unstructured":"Angelini, P., Bekos, M.A., Kindermann, P., Mchedlidze, T.: On mixed linear layouts of series-parallel graphs. Theor. Comput. Sci. 936, 129\u2013138 (2022). https:\/\/doi.org\/10.1016\/j.tcs.2022.09.019","journal-title":"Theor. Comput. Sci."},{"key":"10_CR7","unstructured":"Bekos, M.A., et al.: On linear layouts of planar and k-planar graphs. In: Hong, S.H., Kaufmann, M., Pach, J., T\u00f3th, C.D. (eds.) Beyond-Planar Graphs: Combinatorics, Models and Algorithms, vol. 167, p. 144. Dagstuhl Reports (2019)"},{"key":"10_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.113689","volume":"946","author":"MA Bekos","year":"2023","unstructured":"Bekos, M.A., Da Lozzo, G., Frati, F., Gronemann, M., Mchedlidze, T., Raftopoulou, C.N.: Recognizing DAGs with page-number 2 is NP-complete. Theor. Comput. Sci. 946, 113689 (2023). https:\/\/doi.org\/10.1016\/j.tcs.2023.113689","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"10_CR9","doi-asserted-by":"publisher","first-page":"332","DOI":"10.20382\/jocg.v11i1a12","volume":"11","author":"MA Bekos","year":"2020","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:\/\/doi.org\/10.20382\/jocg.v11i1a12","journal-title":"J. Comput. Geom."},{"key":"10_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2022.103662","volume":"110","author":"S Bhore","year":"2023","unstructured":"Bhore, S., Da Lozzo, G., Montecchiani, F., N\u00f6llenburg, M.: On the upward book thickness problem: combinatorial and complexity results. Eur. J. Comb. 110, 103662 (2023). https:\/\/doi.org\/10.1016\/j.ejc.2022.103662","journal-title":"Eur. J. Comb."},{"key":"10_CR11","doi-asserted-by":"publisher","unstructured":"Binucci, C., Da Lozzo, G., Di Giacomo, E., Didimo, W., Mchedlidze, T., Patrignani, M.: Upward book embeddings of st-graphs. In: Barequet, G., Wang, Y. (eds.) International Symposium on Computational Geometry. LIPIcs, vol. 129, pp. 13:1\u201313:22. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2019.13","DOI":"10.4230\/LIPIcs.SoCG.2019.13"},{"key":"10_CR12","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":"12","key":"10_CR13","doi-asserted-by":"publisher","first-page":"5121","DOI":"10.1090\/proc\/16044","volume":"150","author":"J Davies","year":"2022","unstructured":"Davies, J.: Improved bounds for colouring circle graphs. Proc. Am. Math. Soc. 150(12), 5121\u20135135 (2022). https:\/\/doi.org\/10.1090\/proc\/16044","journal-title":"Proc. Am. Math. Soc."},{"issue":"4","key":"10_CR14","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/s00453-005-1185-7","volume":"45","author":"E Di Giacomo","year":"2006","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Wismath, S.K.: Book embeddability of series-parallel digraphs. Algorithmica 45(4), 531\u2013547 (2006). https:\/\/doi.org\/10.1007\/s00453-005-1185-7","journal-title":"Algorithmica"},{"issue":"4","key":"10_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3385731","volume":"67","author":"V Dujmovi\u0107","year":"2020","unstructured":"Dujmovi\u0107, V., Joret, G., Micek, P., Morin, P., Ueckerdt, T., Wood, D.R.: Planar graphs have bounded queue-number. J. ACM 67(4), 1\u201338 (2020). https:\/\/doi.org\/10.1145\/3385731","journal-title":"J. ACM"},{"issue":"3","key":"10_CR16","doi-asserted-by":"publisher","first-page":"221","DOI":"10.7155\/jgaa.00292","volume":"17","author":"F Frati","year":"2013","unstructured":"Frati, F., Fulek, R., Ruiz-Vargas, A.J.: On the page number of upward planar directed acyclic graphs. J. Graph Algorithms Appl. 17(3), 221\u2013244 (2013). https:\/\/doi.org\/10.7155\/jgaa.00292","journal-title":"J. Graph Algorithms Appl."},{"issue":"4","key":"10_CR17","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1137\/S0895480193252380","volume":"10","author":"LS Heath","year":"1997","unstructured":"Heath, L.S., Pemmaraju, S.V.: Stack and queue layouts of posets. SIAM J. Discrete Math. 10(4), 599\u2013625 (1997). https:\/\/doi.org\/10.1137\/S0895480193252380","journal-title":"SIAM J. Discrete Math."},{"issue":"5","key":"10_CR18","doi-asserted-by":"publisher","first-page":"1588","DOI":"10.1137\/S0097539795291550","volume":"28","author":"LS Heath","year":"1999","unstructured":"Heath, L.S., Pemmaraju, S.V.: Stack and queue layouts of directed acyclic graphs: Part II. SIAM J. Comput. 28(5), 1588\u20131626 (1999). https:\/\/doi.org\/10.1137\/S0097539795291550","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10_CR19","doi-asserted-by":"publisher","first-page":"1510","DOI":"10.1137\/S0097539795280287","volume":"28","author":"LS Heath","year":"1999","unstructured":"Heath, L.S., Pemmaraju, S.V., Trenk, A.N.: Stack and queue layouts of directed acyclic graphs: Part I. SIAM J. Comput. 28(4), 1510\u20131539 (1999). https:\/\/doi.org\/10.1137\/S0097539795280287","journal-title":"SIAM J. Comput."},{"key":"10_CR20","first-page":"291","volume":"35","author":"L Hung","year":"1993","unstructured":"Hung, L.: A planar poset which requires 4 pages. Ars Comb. 35, 291\u2013302 (1993)","journal-title":"Ars Comb."},{"key":"10_CR21","doi-asserted-by":"publisher","unstructured":"Jungeblut, P., Merker, L., Ueckerdt, T.: A sublinear bound on the page number of upward planar graphs. In: Symposium on Discrete Algorithms, pp. 963\u2013978. SIAM (2022). https:\/\/doi.org\/10.1137\/1.9781611977073.42","DOI":"10.1137\/1.9781611977073.42"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Jungeblut, P., Merker, L., Ueckerdt, T.: Directed acyclic outerplanar graphs have constant stack number. In: Foundations of Computer Science (2023). https:\/\/arxiv.org\/abs\/2211.04732, to appear","DOI":"10.1109\/FOCS57990.2023.00118"},{"key":"10_CR23","unstructured":"Kostochka, A.: Upper bounds on the chromatic number of graphs. Trudy Inst. Mat. (Novosibirsk) 10(Modeli i Metody Optim.), 204\u2013226 (1988)"},{"issue":"1\u20133","key":"10_CR24","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/S0012-365X(96)00344-5","volume":"163","author":"A Kostochka","year":"1997","unstructured":"Kostochka, A., Kratochv\u00edl, J.: Covering and coloring polygon-circle graphs. Discret. Math. 163(1\u20133), 299\u2013305 (1997). https:\/\/doi.org\/10.1016\/S0012-365X(96)00344-5","journal-title":"Discret. Math."},{"key":"10_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"882","DOI":"10.1007\/978-3-642-10631-6_89","volume-title":"Algorithms and Computation","author":"T Mchedlidze","year":"2009","unstructured":"Mchedlidze, T., Symvonis, A.: Crossing-free acyclic hamiltonian path completion for planar st-digraphs. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 882\u2013891. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10631-6_89"},{"key":"10_CR26","unstructured":"Merker, L.: Ordered covering numbers. Masters thesis, Karlsruhe Institute of Technology (2020)"},{"issue":"3","key":"10_CR27","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF00563521","volume":"6","author":"R Nowakowski","year":"1989","unstructured":"Nowakowski, R., Parker, A.: Ordered sets, pagenumbers and planarity. Order 6(3), 209\u2013218 (1989). https:\/\/doi.org\/10.1007\/BF00563521","journal-title":"Order"},{"key":"10_CR28","unstructured":"N\u00f6llenburg, M., Pupyrev, S.: On families of planar DAGs with constant stack number. CoRR abs\/2107.13658 (2023). http:\/\/arxiv.org\/abs\/2107.13658"},{"key":"10_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/3-540-58950-3_385","volume-title":"Graph Drawing","author":"A Papakostas","year":"1995","unstructured":"Papakostas, A.: Upward planarity testing of outerplanar DAGs (extended abstract). In: Tamassia, R., Tollis, I.G. (eds.) GD 1994. LNCS, vol. 894, pp. 298\u2013306. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-58950-3_385"},{"key":"10_CR30","unstructured":"Pupyrev, S.: A SAT-based solver for constructing optimal linear layouts of graphs. Source code available at: https:\/\/github.com\/spupyrev\/bob"},{"key":"10_CR31","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"},{"issue":"3","key":"10_CR32","doi-asserted-by":"publisher","first-page":"323","DOI":"10.7155\/jgaa.00536","volume":"24","author":"S Pupyrev","year":"2020","unstructured":"Pupyrev, S.: Improved bounds for track numbers of planar graphs. J. Graph Algorithms Appl. 24(3), 323\u2013341 (2020). https:\/\/doi.org\/10.7155\/jgaa.00536","journal-title":"J. Graph Algorithms Appl."},{"key":"10_CR33","doi-asserted-by":"publisher","unstructured":"Pupyrev, S.: Queue layouts of two-dimensional posets. In: Angelini, P., von Hanxleden, R. (eds.) International Symposium on Graph Drawing and Network Visualization. LNCS, vol. 13764, pp. 353\u2013360. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22203-0_25","DOI":"10.1007\/978-3-031-22203-0_25"},{"key":"10_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/3-540-52292-1_13","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"MM Sys\u0142o","year":"1990","unstructured":"Sys\u0142o, M.M.: Bounds to the page number of partially ordered sets. In: Nagl, M. (ed.) WG 1989. LNCS, vol. 411, pp. 181\u2013195. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/3-540-52292-1_13"},{"issue":"1","key":"10_CR35","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/0022-0000(89)90032-9","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-9","journal-title":"J. Comput. Syst. Sci."}],"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-031-49272-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T09:05:56Z","timestamp":1704963956000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49272-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031492716","9783031492723"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49272-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"1 January 2024","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":"Isola delle Femmine, Palermo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/gd2023.ing.unipg.it\/\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"100","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":"31","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":"7","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":"31% - 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","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":"13","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":"11 posters, 2 abstracts of invited talks, and 1 contest report are also included in the GD 2023 proceedings","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)"}}]}}