{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,18]],"date-time":"2025-04-18T07:07:50Z","timestamp":1744960070153,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"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_27","type":"book-chapter","created":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T08:04:02Z","timestamp":1674029042000},"page":"371-386","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Rique-Number of\u00a0Graphs"],"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-0002-6150-1998","authenticated-orcid":false,"given":"Stefan","family":"Felsner","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-0477-2724","authenticated-orcid":false,"given":"Stephen","family":"Kobourov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2620-6133","authenticated-orcid":false,"given":"Jan","family":"Kratochv\u00edl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3794-4406","authenticated-orcid":false,"given":"Ignaz","family":"Rutter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,19]]},"reference":[{"issue":"3","key":"27_CR1","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1137\/0125042","volume":"25","author":"D Adolphson","year":"1973","unstructured":"Adolphson, D., Hu, T.C.: Optimal linear ordering. SIAM J. Appl. Math. 25(3), 403\u2013423 (1973). https:\/\/doi.org\/10.1137\/0125042","journal-title":"SIAM J. Appl. Math."},{"issue":"9","key":"27_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"},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.tcs.2022.07.036","volume":"931","author":"JM Alam","year":"2022","unstructured":"Alam, J.M., Bekos, M.A., Gronemann, M., Kaufmann, M., Pupyrev, S.: The mixed page number of graphs. Theor. Comput. Sci. 931, 131\u2013141 (2022). https:\/\/doi.org\/10.1016\/j.tcs.2022.07.036","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"27_CR4","doi-asserted-by":"publisher","first-page":"207","DOI":"10.7155\/jgaa.00465","volume":"22","author":"C Auer","year":"2018","unstructured":"Auer, C., Bachmaier, C., Brandenburg, F.J., Brunner, W., Glei\u00dfner, A.: Data structures and their planar graph layouts. J. Graph Algorithms Appl. 22(2), 207\u2013237 (2018). https:\/\/doi.org\/10.7155\/jgaa.00465","journal-title":"J. Graph Algorithms Appl."},{"issue":"4","key":"27_CR5","doi-asserted-by":"publisher","first-page":"1561","DOI":"10.1007\/s00453-018-0487-5","volume":"81","author":"MJ Bannister","year":"2018","unstructured":"Bannister, M.J., Devanny, W.E., Dujmovi\u0107, V., Eppstein, D., Wood, D.R.: Track layouts, layered path decompositions, and leveled planarity. Algorithmica 81(4), 1561\u20131583 (2018). https:\/\/doi.org\/10.1007\/s00453-018-0487-5","journal-title":"Algorithmica"},{"key":"27_CR6","doi-asserted-by":"publisher","unstructured":"Battista, G.D., Tamassia, R.: Incremental planarity testing (extended abstract). In: Symposium on Foundations of Computer Science, pp. 436\u2013441. IEEE Computer Society (1989). https:\/\/doi.org\/10.1109\/SFCS.1989.63515","DOI":"10.1109\/SFCS.1989.63515"},{"key":"27_CR7","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"},{"key":"27_CR8","doi-asserted-by":"publisher","unstructured":"Bekos, M.A., Felsner, S., Kindermann, P., Kobourov, S., Kratov\u00edl, J., Rutter, I.: The Rique-number of graphs (2022). https:\/\/doi.org\/10.48550\/ARXIV.2209.00424","DOI":"10.48550\/ARXIV.2209.00424"},{"issue":"1","key":"27_CR9","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/s00453-015-0016-8","volume":"75","author":"MA Bekos","year":"2015","unstructured":"Bekos, M.A., Gronemann, M., Raftopoulou, C.N.: Two-page book embeddings of 4-planar graphs. Algorithmica 75(1), 158\u2013185 (2015). https:\/\/doi.org\/10.1007\/s00453-015-0016-8","journal-title":"Algorithmica"},{"key":"27_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-030-92931-2_20","volume-title":"Graph Drawing and Network Visualization","author":"MA Bekos","year":"2021","unstructured":"Bekos, M.A., Gronemann, M., Raftopoulou, C.N.: On the\u00a0Queue Number of\u00a0Planar Graphs. In: Purchase, H.C., Rutter, I. (eds.) GD 2021. LNCS, vol. 12868, pp. 271\u2013284. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92931-2_20"},{"issue":"1","key":"27_CR11","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."},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-319-27261-0_11","volume-title":"Graph Drawing and Network Visualization","author":"MA Bekos","year":"2015","unstructured":"Bekos, M.A., Kaufmann, M., Zielke, C.: The book embedding problem from a SAT-solving perspective. In: Di Giacomo, E., Lubiw, A. (eds.) GD 2015. LNCS, vol. 9411, pp. 125\u2013138. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-27261-0_11"},{"issue":"3","key":"27_CR13","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/0095-8956(79)90021-2","volume":"27","author":"F Bernhart","year":"1979","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","journal-title":"J. Comb. Theory Ser. B"},{"issue":"3","key":"27_CR14","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1002\/jgt.3190060302","volume":"6","author":"PZ Chinn","year":"1982","unstructured":"Chinn, P.Z., Chvatalova, J., Dewdney, A.K., Gibbs, N.E.: The bandwidth problem for graphs and matrices - a survey. J. Graph Theory 6(3), 223\u2013254 (1982). https:\/\/doi.org\/10.1002\/jgt.3190060302","journal-title":"J. Graph Theory"},{"issue":"3","key":"27_CR15","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."},{"issue":"6","key":"27_CR16","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":"27_CR17","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":"27_CR18","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."},{"issue":"4","key":"27_CR19","doi-asserted-by":"publisher","first-page":"22:1","DOI":"10.1145\/3385731","volume":"67","author":"V Dujmovic","year":"2020","unstructured":"Dujmovic, V., Joret, G., Micek, P., Morin, P., Ueckerdt, T., Wood, D.R.: Planar graphs have bounded queue-number. J. ACM 67(4), 22:1-22:38 (2020). https:\/\/doi.org\/10.1145\/3385731","journal-title":"J. ACM"},{"issue":"1","key":"27_CR20","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). https:\/\/doi.org\/10.1007\/BF00149287","journal-title":"Geom. Dedicata."},{"key":"27_CR21","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). https:\/\/doi.org\/10.1007\/BF02574056","journal-title":"Discrete Comput. Geom."},{"key":"27_CR22","unstructured":"Ganley, J.L.: Stack and queue layouts of Halin graphs (1995)"},{"issue":"6","key":"27_CR23","first-page":"41","volume":"1","author":"A Goldner","year":"1975","unstructured":"Goldner, A., Harary, F.: Note on a smallest nonhamiltonian maximal planar graph. Bull. Malays. Math. Sci. Soc. 1(6), 41\u201342 (1975)","journal-title":"Bull. Malays. Math. Sci. Soc."},{"key":"27_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2019.11.020","author":"X Guan","year":"2019","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","journal-title":"Discret. Appl. Math."},{"key":"27_CR25","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"},{"key":"27_CR26","doi-asserted-by":"publisher","unstructured":"Heath, L.S.: Embedding planar graphs in seven pages. In: Foundations of Computer Science, pp. 74\u201383. IEEE Computer Society (1984). https:\/\/doi.org\/10.1109\/SFCS.1984.715903","DOI":"10.1109\/SFCS.1984.715903"},{"issue":"3","key":"27_CR27","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":"27_CR28","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":"27_CR29","doi-asserted-by":"publisher","unstructured":"Hoffmann, M., Klemz, B.: Triconnected planar graphs of maximum degree five are subhamiltonian. In: Bender, M.A., Svensson, O., Herman, G. (eds.) European Symposium on Algorithms. 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","DOI":"10.4230\/LIPIcs.ESA.2019.58"},{"issue":"7","key":"27_CR30","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":"27_CR31","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)"},{"key":"27_CR32","doi-asserted-by":"publisher","unstructured":"Pratt, V.R.: Computing permutations with double-ended queues, parallel stacks and parallel queues. In: Aho, A.V., Borodin, A., Constable, R.L., Floyd, R.W., Harrison, M.A., Karp, R.M., Strong, H.R. (eds.) ACM Symposium on Theory of Computing, pp. 268\u2013277. ACM (1973). https:\/\/doi.org\/10.1145\/800125.804058","DOI":"10.1145\/800125.804058"},{"key":"27_CR33","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"},{"issue":"1","key":"27_CR34","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0095-8956(83)90079-5","volume":"35","author":"N Robertson","year":"1983","unstructured":"Robertson, N., Seymour, P.: Graph minors I excluding a forest. J. Comb. Theory Ser. B 35(1), 39\u201361 (1983). https:\/\/doi.org\/10.1016\/0095-8956(83)90079-5","journal-title":"J. Comb. Theory Ser. B"},{"key":"27_CR35","first-page":"41","volume":"86","author":"M Serna","year":"2005","unstructured":"Serna, M., Thilikos, D.: Parameterized complexity for graph layout problems. B. EATCS 86, 41\u201365 (2005)","journal-title":"B. EATCS"},{"issue":"1","key":"27_CR36","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-22203-0_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,4]],"date-time":"2024-01-04T07:05:40Z","timestamp":1704351940000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22203-0_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031222023","9783031222030"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22203-0_27","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)"}}]}}