Di Battista, GiuseppeFrati, FabrizioPach, Janos2014-02-172014-02-172014-02-17201310.1137/130908051https://infoscience.epfl.ch/handle/20.500.14299/100854WOS:000328889400009We prove that planar graphs have O(log(2) n) queue number, thus improving upon the previous O(root n) upper bound. Consequently, planar graphs admit three-dimensional straight-line crossing-free grid drawings in O(n log(8) n) volume, thus improving upon the previous O(n(3/2)) upper bound.graph layoutqueue numberplanar graphtext::journal::journal article::research article