{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T15:24:26Z","timestamp":1787498666121,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,23]],"date-time":"2019-06-23T00:00:00Z","timestamp":1561248000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"DFG","award":["Ka812\/17-1"],"award-info":[{"award-number":["Ka812\/17-1"]}]},{"name":"DAAD","award":["57419183"],"award-info":[{"award-number":["57419183"]}]},{"name":"MIUR","award":["20174LF3T8"],"award-info":[{"award-number":["20174LF3T8"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,23]]},"DOI":"10.1145\/3313276.3316324","type":"proceedings-article","created":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T08:19:08Z","timestamp":1561018748000},"page":"176-184","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Planar graphs of bounded degree have bounded queue number"],"prefix":"10.1145","author":[{"given":"Michael","family":"Bekos","sequence":"first","affiliation":[{"name":"University of T\u00fcbingen, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Henry","family":"F\u00f6rster","sequence":"additional","affiliation":[{"name":"University of T\u00fcbingen, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin","family":"Gronemann","sequence":"additional","affiliation":[{"name":"University of Cologne, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tamara","family":"Mchedlidze","sequence":"additional","affiliation":[{"name":"KIT, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fabrizio","family":"Montecchiani","sequence":"additional","affiliation":[{"name":"University of Perugia, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chrysanthi","family":"Raftopoulou","sequence":"additional","affiliation":[{"name":"National Technical University of Athens, Greece"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Torsten","family":"Ueckerdt","sequence":"additional","affiliation":[{"name":"KIT, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2019,6,23]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Graph Drawing and Network Visualization (LNCS), Therese C","author":"Alam Jawaherul Md.","unstructured":"Jawaherul Md. Alam , Michael A. Bekos , Martin Gronemann , Michael Kaufmann , and Sergey Pupyrev . 2018. Queue Layouts of Planar 3-Trees . In Graph Drawing and Network Visualization (LNCS), Therese C . Biedl and Andreas Kerren (Eds.), Vol. 11282 . Springer , Cham , 213\u2013226. 3- 030- 04414- 5_ 15 Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, and Sergey Pupyrev. 2018. Queue Layouts of Planar 3-Trees. In Graph Drawing and Network Visualization (LNCS), Therese C. Biedl and Andreas Kerren (Eds.), Vol. 11282. Springer, Cham, 213\u2013226. 3- 030- 04414- 5_ 15"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-018-0487-5"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1996.0024"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(79)90077-3"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.62"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/130908051"},{"key":"e_1_3_2_1_7_1","unstructured":"1137\/130908051 Planar Graphs of Bounded Degree have Bounded Queue Number STOC \u201919 June 23\u201326 2019 Phoenix AZ USA  1137\/130908051 Planar Graphs of Bounded Degree have Bounded Queue Number STOC \u201919 June 23\u201326 2019 Phoenix AZ USA"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1108566.1646559"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2014.07.005"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00454"},{"key":"e_1_3_2_1_11_1","volume-title":"Wood","author":"Dujmovi\u0107 Vida","year":"2005","unstructured":"Vida Dujmovi\u0107 , Pat Morin , and David R . Wood . 2005 . Vida Dujmovi\u0107, Pat Morin, and David R. Wood. 2005."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702416141"},{"key":"e_1_3_2_1_13_1","volume-title":"Wood","author":"Dujmovic Vida","year":"2017","unstructured":"Vida Dujmovic , Pat Morin , and David R . Wood . 2017 . Vida Dujmovic, Pat Morin, and David R. Wood. 2017."},{"key":"e_1_3_2_1_14_1","volume-title":"Ser. B 127","author":"Comb Layered","year":"2017","unstructured":"Layered separators in minor-closed graph classes with applications. J. Comb . Theory , Ser. B 127 ( 2017 ), 111\u2013147. Layered separators in minor-closed graph classes with applications. J. Comb. Theory, Ser. B 127 (2017), 111\u2013147."},{"key":"e_1_3_2_1_15_1","first-page":"497","article-title":"Track Layouts of Graphs","volume":"6","author":"Dujmovi\u0107 Vida","year":"2004","unstructured":"Vida Dujmovi\u0107 , Attila P\u00f3r , and David R. Wood . 2004 . Track Layouts of Graphs . Discrete Math. Theor. Comput. Sci. 6 , 2 (2004), 497 \u2013 522 . Vida Dujmovi\u0107, Attila P\u00f3r, and David R. Wood. 2004. Track Layouts of Graphs. Discrete Math. Theor. Comput. Sci. 6, 2 (2004), 497\u2013522.","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"e_1_3_2_1_16_1","volume-title":"Wood","author":"Dujmovi\u0107 Vida","year":"2004","unstructured":"Vida Dujmovi\u0107 and David R . Wood . 2004 . Three-dimensional grid drawings with sub-quadratic volume. In Towards a theory of geometric graphs. Contemp. Math., Vol. 342 . Amer. Math. Soc., Providence, RI , 55\u201366. 342\/06130 Vida Dujmovi\u0107 and David R. Wood. 2004. Three-dimensional grid drawings with sub-quadratic volume. In Towards a theory of geometric graphs. Contemp. Math., Vol. 342. Amer. Math. Soc., Providence, RI, 55\u201366. 342\/06130"},{"key":"e_1_3_2_1_17_1","first-page":"155","article-title":"Stacks, Queues and Tracks: Layouts of Graph Subdivisions","volume":"7","author":"Dujmovi\u0107 Vida","year":"2005","unstructured":"Vida Dujmovi\u0107 and David R. Wood . 2005 . Stacks, Queues and Tracks: Layouts of Graph Subdivisions . Discrete Math. Theor. Comput. Sci. 7 , 1 (2005), 155 \u2013 202 . Vida Dujmovi\u0107 and David R. Wood. 2005. Stacks, Queues and Tracks: Layouts of Graph Subdivisions. Discrete Math. Theor. Comput. Sci. 7, 1 (2005), 155\u2013202.","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00075"},{"key":"e_1_3_2_1_19_1","volume-title":"Willard","author":"Fredman Michael L.","year":"1993","unstructured":"Michael L. Fredman and Dan E . Willard . 1993 . Michael L. Fredman and Dan E. Willard. 1993."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(93)90040-4"},{"key":"e_1_3_2_1_21_1","unstructured":"Joseph L. Ganley. 1995. Stack and Queue Layouts of Halin Graphs. Manuscript.  Joseph L. Ganley. 1995. Stack and Queue Layouts of Halin Graphs. Manuscript."},{"key":"e_1_3_2_1_22_1","volume-title":"Frank Thomson Leighton, and Arnold L. Rosenberg","author":"Heath Lenwood S.","year":"1992","unstructured":"Lenwood S. Heath , Frank Thomson Leighton, and Arnold L. Rosenberg . 1992 . Lenwood S. Heath, Frank Thomson Leighton, and Arnold L. Rosenberg. 1992."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/0405031"},{"key":"e_1_3_2_1_24_1","volume-title":"Rosenberg","author":"Heath Lenwood S.","year":"1992","unstructured":"Lenwood S. Heath and Arnold L . Rosenberg . 1992 . Lenwood S. Heath and Arnold L. Rosenberg. 1992."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/0221055"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215057"},{"key":"e_1_3_2_1_27_1","volume-title":"Southeastern Conference on Combinatorics, Graph Theory and Computing (Congressus Numerantium)","author":"Ollmann T.","year":"1973","unstructured":"T. Ollmann . 1973 . On the book thicknesses of various graphs . In Southeastern Conference on Combinatorics, Graph Theory and Computing (Congressus Numerantium) , Vol. VIII . 459. T. Ollmann. 1973. On the book thicknesses of various graphs. In Southeastern Conference on Combinatorics, Graph Theory and Computing (Congressus Numerantium), Vol. VIII. 459."},{"key":"e_1_3_2_1_28_1","volume-title":"Graph Drawing (LNCS)","author":"Pupyrev Sergey","unstructured":"Sergey Pupyrev . 2017. Mixed Linear Layouts of Planar Graphs . In Graph Drawing (LNCS) , Vol. 10692 . Springer , Cham , 197\u2013209. Sergey Pupyrev. 2017. Mixed Linear Layouts of Planar Graphs. In Graph Drawing (LNCS), Vol. 10692. Springer, Cham, 197\u2013209."},{"key":"e_1_3_2_1_29_1","unstructured":"S. Rengarajan and C. E. Veni Madhavan. 1995.  S. Rengarajan and C. E. Veni Madhavan. 1995."},{"key":"e_1_3_2_1_30_1","volume-title":"COCOON (LNCS)","author":"Queue Stack","unstructured":"Stack and Queue Number of 2- Trees . In COCOON (LNCS) , Vol. 959 . Springer , Berlin, Heidelberg , 203\u2013212. Stack and Queue Number of 2-Trees. In COCOON (LNCS), Vol. 959. Springer, Berlin, Heidelberg, 203\u2013212."},{"key":"e_1_3_2_1_31_1","unstructured":"Robert Endre Tarjan. 1972.  Robert Endre Tarjan. 1972."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/321694.321704"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.37236\/6429"},{"key":"e_1_3_2_1_34_1","volume-title":"Bounded-Degree Graphs have Arbitrarily Large Queue-Number. Discrete Math. Theor. Comput. Sci. 10, 1","author":"Wood David R.","year":"2008","unstructured":"David R. Wood . 2008. Bounded-Degree Graphs have Arbitrarily Large Queue-Number. Discrete Math. Theor. Comput. Sci. 10, 1 ( 2008 ). David R. Wood. 2008. Bounded-Degree Graphs have Arbitrarily Large Queue-Number. Discrete Math. Theor. Comput. Sci. 10, 1 (2008)."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(89)90032-9"}],"event":{"name":"STOC '19: 51st Annual ACM SIGACT Symposium on the Theory of Computing","location":"Phoenix AZ USA","acronym":"STOC '19","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3313276.3316324","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3313276.3316324","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:54:01Z","timestamp":1750190041000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3313276.3316324"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,23]]},"references-count":35,"alternative-id":["10.1145\/3313276.3316324","10.1145\/3313276"],"URL":"https:\/\/doi.org\/10.1145\/3313276.3316324","relation":{},"subject":[],"published":{"date-parts":[[2019,6,23]]},"assertion":[{"value":"2019-06-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}