{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:39:14Z","timestamp":1767314354295,"version":"3.48.0"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032118349","type":"print"},{"value":"9783032118356","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-11835-6_13","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:34:19Z","timestamp":1767314059000},"page":"177-191","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Peculiarities of\u00a0Extending Queue Layouts"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-7498-6271","authenticated-orcid":false,"given":"Thomas","family":"Depian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2754-1195","authenticated-orcid":false,"given":"Simon D.","family":"Fink","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7762-8045","authenticated-orcid":false,"given":"Robert","family":"Ganian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0454-3937","authenticated-orcid":false,"given":"Martin","family":"N\u00f6llenburg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","unstructured":"Angelini, P., et al.: Testing planarity of partially embedded graphs. ACM Trans. Algorithms 11(4), 32:1\u201332:42 (2015). https:\/\/doi.org\/10.1145\/2629341","DOI":"10.1145\/2629341"},{"issue":"3","key":"13_CR2","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","volume":"8","author":"B Aspvall","year":"1979","unstructured":"Aspvall, B., Plass, M.F., Tarjan, R.E.: A linear-time algorithm for testing the truth of certain quantified Boolean formulas. Inf. Process. Lett. 8(3), 121\u2013123 (1979). https:\/\/doi.org\/10.1016\/0020-0190(79)90002-4","journal-title":"Inf. Process. Lett."},{"issue":"5","key":"13_CR3","doi-asserted-by":"publisher","first-page":"1487","DOI":"10.1137\/19M125340X","volume":"48","author":"MA Bekos","year":"2019","unstructured":"Bekos, M.A.: Planar graphs of bounded degree have bounded queue number. SIAM J. Comput. 48(5), 1487\u20131502 (2019). https:\/\/doi.org\/10.1137\/19M125340X","journal-title":"SIAM J. Comput."},{"key":"13_CR4","doi-asserted-by":"publisher","unstructured":"Bhore, S., Da\u00a0Lozzo, G., Montecchiani, F., N\u00f6llenburg, M.: On the upward book thickness problem: combinatorial and complexity results. In: Purchase, H.C., Rutter, I. (eds.) Proceedings of the 29th International Symposium on Graph Drawing and Network Visualization (GD\u201921). Lecture Notes in Computer Science, vol. 12868, pp. 242\u2013256. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-92931-2_18","DOI":"10.1007\/978-3-030-92931-2_18"},{"key":"13_CR5","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":"13_CR6","doi-asserted-by":"publisher","unstructured":"Bhore, S., Ganian, R., Khazaliya, L., Montecchiani, F., N\u00f6llenburg, M.: Extending orthogonal planar graph drawings is fixed-parameter tractable. In: Chambers, E.W., Gudmundsson, J. (eds.) Proceedings of the 39th International Symposium on Computational Geometry (SoCG\u201923). LIPIcs, vol.\u00a0258, pp. 18:1\u201318:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023). https:\/\/doi.org\/10.4230\/LIPICS.SOCG.2023.18","DOI":"10.4230\/LIPICS.SOCG.2023.18"},{"issue":"3","key":"13_CR7","doi-asserted-by":"publisher","first-page":"335","DOI":"10.7155\/JGAA.00597","volume":"26","author":"S Bhore","year":"2022","unstructured":"Bhore, S., Ganian, R., Montecchiani, F., N\u00f6llenburg, M.: Parameterized algorithms for queue layouts. J. Graph Algorithms Appl. 26(3), 335\u2013352 (2022). https:\/\/doi.org\/10.7155\/JGAA.00597","journal-title":"J. Graph Algorithms Appl."},{"key":"13_CR8","doi-asserted-by":"publisher","unstructured":"Bhore, S., Ganian, R., Montecchiani, F., N\u00f6llenburg, M.: Parameterized Algorithms for Queue Layouts. In: Auber, D., Valtr, P. (eds.) Proceedings of the 28th International Symposium on Graph Drawing and Network Visualization (GD\u201920). Lecture Notes in Computer Science, vol. 12590, pp. 40\u201354. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-68766-3_4","DOI":"10.1007\/978-3-030-68766-3_4"},{"issue":"2","key":"13_CR9","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1049\/ip-e.1992.0021","volume":"139","author":"T Bilski","year":"1992","unstructured":"Bilski, T.: Embedding graphs in books: a survey. IEE Proc. E (Comput. Digital Techniques) 139(2), 134 (1992). https:\/\/doi.org\/10.1049\/ip-e.1992.0021","journal-title":"IEE Proc. E (Comput. Digital Techniques)"},{"issue":"1","key":"13_CR10","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/0608002","volume":"8","author":"FRK Chung","year":"1987","unstructured":"Chung, F.R.K., Leighton, F.T., Rosenberg, A.L.: Embedding graphs in books: a layout problem with applications to VLSI design. SIAM J. Algebraic Discret. Methods 8(1), 33\u201358 (1987). https:\/\/doi.org\/10.1137\/0608002","journal-title":"SIAM J. Algebraic Discret. Methods"},{"key":"13_CR11","doi-asserted-by":"publisher","unstructured":"Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3","DOI":"10.1007\/978-3-319-21275-3"},{"key":"13_CR12","doi-asserted-by":"publisher","unstructured":"Depian, T., Fink, S.D., Ganian, R., N\u00f6llenburg, M.: The Parameterized Complexity Of Extending Stack Layouts. In: Felsner, S., Klein, K. (eds.) Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization (GD\u201924). LIPIcs, vol.\u00a0320, pp. 12:1\u201312:17. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2024). https:\/\/doi.org\/10.4230\/LIPICS.GD.2024.12","DOI":"10.4230\/LIPICS.GD.2024.12"},{"key":"13_CR13","doi-asserted-by":"publisher","unstructured":"Depian, T., Fink, S.D., Ganian, R., N\u00f6llenburg, M.: The Peculiarities of extending queue layouts. https:\/\/doi.org\/10.48550\/ARXIV.2506.05156","DOI":"10.48550\/ARXIV.2506.05156"},{"key":"13_CR14","doi-asserted-by":"publisher","unstructured":"Depian, T., Fink, S.D., Firbas, A., Ganian, R., N\u00f6llenburg, M.: Pathways to tractability for geometric thickness. In: Kralovic, R., K\u00e5rkov\u00e1, V. (eds.) Proceedings of the 50th Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM\u201925). Lecture Notes in Computer Science, vol. 15538, pp. 209\u2013224. Springer (2025). https:\/\/doi.org\/10.1007\/978-3-031-82670-2_16","DOI":"10.1007\/978-3-031-82670-2_16"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory, 4th Edition, Graduate Texts in Mathematics, vol.\u00a0173. Springer (2012)","DOI":"10.1007\/978-3-662-53622-3_7"},{"issue":"2","key":"13_CR16","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/S00493-021-4585-7","volume":"42","author":"V Dujmovic","year":"2022","unstructured":"Dujmovic, V., Eppstein, D., Hickingbotham, R., Morin, P., Wood, D.R.: Stack-Number is not bounded by queue-number. Combinatorica 42(2), 151\u2013164 (2022). https:\/\/doi.org\/10.1007\/S00493-021-4585-7","journal-title":"Combinatorica"},{"key":"13_CR17","doi-asserted-by":"publisher","unstructured":"Dujmovic, V., et al.: Planar graphs have bounded queue-number. J. ACM 67(4), 22:1\u201322:38 (2020). https:\/\/doi.org\/10.1145\/3385731","DOI":"10.1145\/3385731"},{"key":"13_CR18","doi-asserted-by":"publisher","unstructured":"Dujmovi\u0107, V., Wood, D.R.: On Linear layouts of graphs. Discrete Math. Theoretical Comput. Sci. 6(2) (2004). https:\/\/doi.org\/10.46298\/dmtcs.317","DOI":"10.46298\/dmtcs.317"},{"issue":"3","key":"13_CR19","doi-asserted-by":"publisher","first-page":"600","DOI":"10.2307\/2371374","volume":"63","author":"B Dushnik","year":"1941","unstructured":"Dushnik, B., Miller, E.W.: Partially ordered sets. Am. J. Math. 63(3), 600 (1941). https:\/\/doi.org\/10.2307\/2371374","journal-title":"Am. J. Math."},{"key":"13_CR20","doi-asserted-by":"publisher","unstructured":"Eiben, E., Ganian, R., Hamm, T., Klute, F., N\u00f6llenburg, M.: Extending partial 1-planar drawings. In: Czumaj, A., Dawar, A., Merelli, E. (eds.) Proceedings of the 47th International Colloquium on Automata, Languages and Programming (ICALP\u201920). LIPIcs, vol.\u00a0168, pp. 43:1\u201343:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPICS.ICALP.2020.43","DOI":"10.4230\/LIPICS.ICALP.2020.43"},{"key":"13_CR21","doi-asserted-by":"publisher","unstructured":"Eiben, E., Ganian, R., Hamm, T., Klute, F., N\u00f6llenburg, M.: Extending Nearly Complete 1-Planar Drawings in Polynomial Time. In: Esparza, J., Kr\u00e1l\u2019, D. (eds.) Proceedings of the 45th Mathematical Foundations of Computer Science (MFCS\u201920). LIPIcs, vol.\u00a0170, pp. 31:1\u201331:16. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPICS.MFCS.2020.31","DOI":"10.4230\/LIPICS.MFCS.2020.31"},{"issue":"4","key":"13_CR22","doi-asserted-by":"publisher","first-page":"1675","DOI":"10.1137\/13090465x","volume":"28","author":"J Enright","year":"2014","unstructured":"Enright, J., Stewart, L., Tardos, G.: On list coloring and list homomorphism of permutation and interval graphs. SIAM J. Discret. Math. 28(4), 1675\u20131685 (2014). https:\/\/doi.org\/10.1137\/13090465x","journal-title":"SIAM J. Discret. Math."},{"key":"13_CR23","doi-asserted-by":"publisher","unstructured":"Ganian, R., Hamm, T., Klute, F., Parada, I., Vogtenhuber, B.: Crossing-Optimal extension of simple drawings. In: Bansal, N., Merelli, E., Worrell, J. (eds.) Proceedings of the 48th International Colloquium on Automata, Languages and Programming (ICALP\u201921). LIPIcs, vol.\u00a0198, pp. 72:1\u201372:17. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPICS.ICALP.2021.72","DOI":"10.4230\/LIPICS.ICALP.2021.72"},{"issue":"5","key":"13_CR24","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":"13_CR25","doi-asserted-by":"publisher","unstructured":"Jansen, K.: The optimum cost chromatic partition problem. In: Bongiovanni, G.C., Bovet, D.P., Battista, G.D. (eds.) Proceedings of the 3rd International Conference on Algorithms and Complexity (CIAC\u201997). Lecture Notes in Computer Science, vol.\u00a01203, pp. 25\u201336. Springer (1997). https:\/\/doi.org\/10.1007\/3-540-62592-5_58","DOI":"10.1007\/3-540-62592-5_58"},{"key":"13_CR26","doi-asserted-by":"publisher","unstructured":"Unger, W.: On the k-Colouring of circle-graphs. In: Cori, R., Wirsing, M. (eds.) Proceedings of the 5th Symposium on Theoretical Aspects of Computer Science (STACS\u201988). Lecture Notes in Computer Science, vol.\u00a0294, pp. 61\u201372. Springer (1988). https:\/\/doi.org\/10.1007\/BFB0035832","DOI":"10.1007\/BFB0035832"},{"key":"13_CR27","doi-asserted-by":"publisher","unstructured":"Wiechert, V.: On the queue-number of graphs with bounded tree-width. Electron. J. Comb. 24(1), 1 (2017). https:\/\/doi.org\/10.37236\/6429","DOI":"10.37236\/6429"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-11835-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:34:21Z","timestamp":1767314061000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-11835-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032118349","9783032118356"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-11835-6_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Otzenhausen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"51","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo.uni-trier.de\/wg2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}