{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:42:15Z","timestamp":1740109335070,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,11,28]],"date-time":"2022-11-28T00:00:00Z","timestamp":1669593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,11,28]],"date-time":"2022-11-28T00:00:00Z","timestamp":1669593600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100021855","name":"University of Ioannina","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100021855","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2023,5]]},"abstract":"Abstract<\/jats:title>We investigate the queue number of posets in terms of their width, that is, the maximum number of pairwise incomparable elements. A long-standing conjecture of Heath and Pemmaraju asserts that every poset of width w<\/jats:italic> has queue number at most w<\/jats:italic>. The conjecture has been confirmed for posets of width $$w=2$$<\/jats:tex-math>\n \n w<\/mml:mi>\n =<\/mml:mo>\n 2<\/mml:mn>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> via so-called lazy<\/jats:italic> linear extension. We extend and thoroughly analyze lazy linear extensions for posets\u00a0of\u00a0width $$w > 2$$<\/jats:tex-math>\n \n w<\/mml:mi>\n ><\/mml:mo>\n 2<\/mml:mn>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. Our analysis implies an upper bound of $$(w-1)^2 +1$$<\/jats:tex-math>\n \n \n \n (<\/mml:mo>\n w<\/mml:mi>\n -<\/mml:mo>\n 1<\/mml:mn>\n )<\/mml:mo>\n <\/mml:mrow>\n 2<\/mml:mn>\n <\/mml:msup>\n +<\/mml:mo>\n 1<\/mml:mn>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> on\u00a0the queue number of width-w<\/jats:italic> posets, which is tight for the strategy and yields an improvement over the previously best-known bound. Further,\u00a0we\u00a0provide an example of a poset that requires at least $$w+1$$<\/jats:tex-math>\n \n w<\/mml:mi>\n +<\/mml:mo>\n 1<\/mml:mn>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> queues in every linear extension, thereby disproving the conjecture for posets of width $$w > 2$$<\/jats:tex-math>\n \n w<\/mml:mi>\n ><\/mml:mo>\n 2<\/mml:mn>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>.<\/jats:p>","DOI":"10.1007\/s00453-022-01067-y","type":"journal-article","created":{"date-parts":[[2022,11,28]],"date-time":"2022-11-28T04:27:24Z","timestamp":1669609644000},"page":"1176-1201","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Lazy Queue Layouts of Posets"],"prefix":"10.1007","volume":"85","author":[{"given":"Jawaherul Md.","family":"Alam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3414-7444","authenticated-orcid":false,"given":"Michael A.","family":"Bekos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Gronemann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergey","family":"Pupyrev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,28]]},"reference":[{"issue":"9","key":"1067_CR1","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":"1","key":"1067_CR2","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":"6","key":"1067_CR3","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."},{"issue":"1","key":"1067_CR4","doi-asserted-by":"publisher","first-page":"161","DOI":"10.2307\/1969503","volume":"51","author":"RP Dilworth","year":"1950","unstructured":"Dilworth, R.P.: A decomposition theorem for partially ordered sets. Ann. Math. 51(1), 161\u2013166 (1950). https:\/\/doi.org\/10.2307\/1969503","journal-title":"Ann. Math."},{"key":"1067_CR5","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.jctb.2014.07.005","volume":"110","author":"V Dujmovic","year":"2015","unstructured":"Dujmovic, 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":"1067_CR6","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. Gr. Algorithms Appl. 22(1), 89\u201399 (2018). https:\/\/doi.org\/10.7155\/jgaa.00454","journal-title":"J. Gr. Algorithms Appl."},{"key":"1067_CR7","doi-asserted-by":"publisher","first-page":"862","DOI":"10.1109\/FOCS.2019.00056","volume-title":"FOCS","author":"V Dujmovi\u0107","year":"2019","unstructured":"Dujmovi\u0107, V., Joret, G., Micek, P., Morin, P., Ueckerdt, T., Wood, D.R.: Planar graphs have bounded queue-number. In: Zuckerman, D. (ed.) FOCS, pp. 862\u2013875. IEEE Computer Society (2019). https:\/\/doi.org\/10.1109\/FOCS.2019.00056"},{"issue":"2","key":"1067_CR8","first-page":"339","volume":"6","author":"V Dujmovi\u0107","year":"2004","unstructured":"Dujmovi\u0107, V., Wood, D.R.: On linear layouts of graphs. Discrete Math. Theor. Comput. Sci. 6(2), 339\u2013358 (2004)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"1067_CR9","doi-asserted-by":"publisher","unstructured":"Felsner, S., Ueckerdt, T., Wille, K.: On the queue-number of partial orders. In: Purchase, H.C., Rutter, I. (eds.) Graph Drawing and Network Visualization, LNCS, vol. 12868, pp. 231\u2013241. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-92931-2_17","DOI":"10.1007\/978-3-030-92931-2_17"},{"issue":"3","key":"1067_CR10","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. Gr. Algorithms Appl. 17(3), 221\u2013244 (2013). https:\/\/doi.org\/10.7155\/jgaa.00292","journal-title":"J. Gr. Algorithms Appl."},{"issue":"3","key":"1067_CR11","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":"4","key":"1067_CR12","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":"1067_CR13","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":"1067_CR14","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."},{"issue":"5","key":"1067_CR15","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":"1067_CR16","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-030-04414-5_14","volume-title":"Graph Drawing and Network Visualization","author":"K Knauer","year":"2018","unstructured":"Knauer, K., Micek, P., Ueckerdt, T.: The queue-number of posets of bounded width or height. In: Biedl, T.C., Kerren, A. (eds.) Graph Drawing and Network Visualization. LNCS, vol. 11282, pp. 200\u2013212. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-030-04414-5_14"},{"key":"1067_CR17","series-title":"LNCS","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":"2017","unstructured":"Pupyrev, S.: Mixed linear layouts of planar graphs. In: Frati, F., Ma, K. (eds.) Graph Drawing and Network Visualization. LNCS, vol. 10692, pp. 197\u2013209. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-73915-1_17"},{"key":"1067_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/BFb0030834","volume-title":"Computing and Combinatorics COCOON","author":"S Rengarajan","year":"1995","unstructured":"Rengarajan, S., Madhavan, C.E.V.: Stack and queue number of 2-trees. In: Du, D., Li, M. (eds.) Computing and Combinatorics COCOON. Lecture Notes in Computer Science, vol. 959, pp. 203\u2013212. Springer (1995). https:\/\/doi.org\/10.1007\/BFb0030834"},{"issue":"1","key":"1067_CR19","first-page":"65","volume":"24","author":"V Wiechert","year":"2017","unstructured":"Wiechert, V.: On the queue-number of graphs with bounded tree-width. Electr. J. Comb. 24(1), 65 (2017)","journal-title":"Electr. J. Comb."},{"key":"1067_CR20","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). https:\/\/doi.org\/10.1016\/j.jctb.2020.05.008","journal-title":"J. Comb. Theory Ser. B"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-022-01067-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-022-01067-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-022-01067-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,25]],"date-time":"2023-04-25T00:02:45Z","timestamp":1682380965000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-022-01067-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,28]]},"references-count":20,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["1067"],"URL":"https:\/\/doi.org\/10.1007\/s00453-022-01067-y","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2022,11,28]]},"assertion":[{"value":"23 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 November 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 November 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}