1. Alam, J.M., Bekos, M.A., Gronemann, M., Kaufmann, M., Pupyrev, S.: Queue layouts of planar 3-trees. Algorithmica (2020), https://doi.org/10.1007/s00453-020-00697-4
2. Bekos, M.A., Gronemann, M., Kaufmann, M., Pupyrev, S.: Lazy queue layouts of posets. CoRR abs/2008.10336v2 (2020). http://arxiv.org/abs/2008.10336v2
3. Bekos, M.A., Kaufmann, M., Klute, F., Pupyrev, S., Raftopoulou, C.N., Ueckerdt, T.: Four pages are indeed necessary for planar graphs. J. of Comp. Geom. 11(1), 332–353 (2020). https://jocg.org/index.php/jocg/article/view/504
4. Di Battista, G., Frati, F., Pach, J.: On the queue number of planar graphs. SIAM J. Comput. 42(6), 2243–2285 (2013). https://doi.org/10.1137/130908051
5. Dilworth, R.P.: A decomposition theorem for partially ordered sets. Ann. Math. 51(1), 161–166 (1950)