{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:46:33Z","timestamp":1743151593053,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031222023"},{"type":"electronic","value":"9783031222030"}],"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-22203-0_26","type":"book-chapter","created":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T08:04:02Z","timestamp":1674029042000},"page":"361-370","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Recognizing DAGs with\u00a0Page-Number 2 Is NP-complete"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3414-7444","authenticated-orcid":false,"given":"Michael A.","family":"Bekos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2396-5174","authenticated-orcid":false,"given":"Giordano","family":"Da Lozzo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5987-8713","authenticated-orcid":false,"given":"Fabrizio","family":"Frati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2565-090X","authenticated-orcid":false,"given":"Martin","family":"Gronemann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6249-3419","authenticated-orcid":false,"given":"Tamara","family":"Mchedlidze","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6457-516X","authenticated-orcid":false,"given":"Chrysanthi N.","family":"Raftopoulou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,19]]},"reference":[{"key":"26_CR1","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":"26_CR2","doi-asserted-by":"crossref","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. CoRR abs\/2208.13615 (2022). https:\/\/arxiv.org\/abs\/2208.13615","DOI":"10.1016\/j.tcs.2023.113689"},{"issue":"1","key":"26_CR3","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)","journal-title":"Algorithmica"},{"issue":"1","key":"26_CR4","first-page":"332","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)","journal-title":"J. Comput. Geom."},{"issue":"3","key":"26_CR5","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1142\/S0218195912500045","volume":"22","author":"M de Berg","year":"2012","unstructured":"de Berg, M., Khosravi, A.: Optimal binary space partitions for segments in the plane. Int. J. Comput. Geom. Appl. 22(3), 187\u2013206 (2012)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"26_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-030-92931-2_18","volume-title":"Graph Drawing and Network Visualization","author":"S Bhore","year":"2021","unstructured":"Bhore, S., Da Lozzo, G., Montecchiani, F., N\u00f6llenburg, M.: On the upward book thickness problem: combinatorial and\u00a0complexity results. In: Purchase, H.C., Rutter, I. (eds.) GD 2021. LNCS, vol. 12868, pp. 242\u2013256. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92931-2_18"},{"key":"26_CR7","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.) SoCG. LIPIcs, vol. 129, pp. 13:1\u201313:22. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2019)"},{"issue":"3","key":"26_CR8","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)","journal-title":"Math. Program."},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0304-3975(88)90123-5","volume":"61","author":"G Di Battista","year":"1988","unstructured":"Di Battista, G., Tamassia, R.: Algorithms for plane representations of acyclic digraphs. Theor. Comput. Sci. 61, 175\u2013198 (1988)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"26_CR10","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)","journal-title":"Algorithmica"},{"issue":"1","key":"26_CR11","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. Geom. Dedicata. 2(1), 115\u2013125 (1973)","journal-title":"Geom. Dedicata."},{"issue":"3","key":"26_CR12","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)","journal-title":"J. Graph Algorithms Appl."},{"key":"26_CR13","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. Geom. 13, 459\u2013468 (1995)","journal-title":"Discrete Comput. Geom."},{"key":"26_CR14","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.dam.2019.11.020","volume":"282","author":"X Guan","year":"2020","unstructured":"Guan, X., Yang, W.: Embedding planar 5-graphs in three pages. Dis. Appl. Math. 282, 108\u2013121 (2020)","journal-title":"Dis. Appl. Math."},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Heath, L.: Embedding planar graphs in seven pages. In: FOCS, pp. 74\u201383. IEEE Comp. Soc. (1984)","DOI":"10.1109\/SFCS.1984.715903"},{"issue":"5","key":"26_CR16","doi-asserted-by":"publisher","first-page":"1588","DOI":"10.1137\/S0097539795291550","volume":"28","author":"L Heath","year":"1999","unstructured":"Heath, L., Pemmaraju, S.V.: Stack and queue layouts of directed acyclic graphs: part II. SIAM J. Comput. 28(5), 1588\u20131626 (1999)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"26_CR17","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1137\/0608018","volume":"8","author":"LS Heath","year":"1987","unstructured":"Heath, L.S.: Embedding outerplanar graphs in small books. SIAM J. Algebraic Discrete Methods 8(2), 198\u2013218 (1987)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"4","key":"26_CR18","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)","journal-title":"SIAM J. Comput."},{"key":"26_CR19","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 (2019)"},{"key":"26_CR20","doi-asserted-by":"crossref","unstructured":"Jungeblut, P., Merker, L., Ueckerdt, T.: A sublinear bound on the page number of upward planar graphs. In: Naor, J.S., Buchbinder, N. (eds.) SODA, pp. 963\u2013978. SIAM (2022)","DOI":"10.1137\/1.9781611977073.42"},{"issue":"7","key":"26_CR21","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)","journal-title":"Appl. Math. Lett."},{"issue":"2\u20133","key":"26_CR22","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0012-365X(87)90008-2","volume":"63","author":"D Kelly","year":"1987","unstructured":"Kelly, D.: Fundamentals of planar ordered sets. Discret. Math. 63(2\u20133), 197\u2013216 (1987)","journal-title":"Discret. Math."},{"key":"26_CR23","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"},{"issue":"3","key":"26_CR24","doi-asserted-by":"publisher","first-page":"373","DOI":"10.7155\/jgaa.00231","volume":"15","author":"T Mchedlidze","year":"2011","unstructured":"Mchedlidze, T., Symvonis, A.: Crossing-optimal acyclic HP-completion for outerplanar ST-digraphs. J. Graph Algorithms Appl. 15(3), 373\u2013415 (2011)","journal-title":"J. Graph Algorithms Appl."},{"key":"26_CR25","unstructured":"Nishizeki, T., Chiba, N.: Planar Graphs: theory and algorithms, chap. 10. Hamiltonian Cycles, pp. 171\u2013184. Dover Books on Mathematics, Courier Dover Publications (2008)"},{"issue":"3","key":"26_CR26","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":"26_CR27","unstructured":"Ollmann, T.: On the book thicknesses of various graphs. In: Hoffman, F., Levow, R., Thomas, R. (eds.) Southeastern Conference on Combinatorics, Graph Theory and Computing. Cong. Num., vol. 8, p. 459 (1973)"},{"key":"26_CR28","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":"26_CR29","unstructured":"Wigderson, A.: The complexity of the Hamiltonian circuit problem for maximal planar graphs. Tech. Rep. TR-298, Princeton University (1982)"},{"issue":"1","key":"26_CR30","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)","journal-title":"J. Comput. Syst. Sci."},{"key":"26_CR31","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.jctb.2020.05.008","volume":"145","author":"M Yannakakis","year":"2020","unstructured":"Yannakakis, M.: Planar graphs that need four pages. J. Comb. Theory Ser. B 145, 241\u2013263 (2020)","journal-title":"J. Comb. Theory Ser. B"}],"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-22203-0_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,12]],"date-time":"2024-10-12T11:41:02Z","timestamp":1728733262000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22203-0_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031222023","9783031222030"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22203-0_26","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":"19 January 2023","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":"Tokyo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/graphdrawing.github.io\/gd2022\/","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":"70","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":"25","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":"36% - 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.01","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":"7.03","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)"}}]}}