We prove that planar graphs have polylogarithmic queue number, thus improving upon the previous polynomial upper bound. Consequently, planar graphs admit 3D straight-line crossing-free grid drawings in small volume
We introduce a new method to optimize the required area, minimum angle and number of bends of planar...
Given a planar graph G, what is the maximum number of collinear vertices in a planar straight-line d...
In John Tantalo’s on-line game Planarity the player is given a non-plane straight-line drawing of a ...
We prove that planar graphs have polylogarithmic queue number, thus improving upon the previous poly...
We prove that planar graphs have O(log(2) n) queue number, thus improving upon the previous O(root n...
A queue layout of a graph consists of a linear order of its vertices and a partition of its edges in...
A famous result due to de Fraysseix, Pach, and Pollack [Combinatorica, 1990] and Schnyder [Order, 19...
We prove that planar graphs have O(log2 n) queue number, thus improving upon the previous O(Formula ...
Abstract. A k-queue layout of a graph consists of a total order of the vertices, and a partition of ...
AbstractThis paper investigates the basic problem of computing crossing-free straight-line 3D grid d...
14 pages, 10 figures, Appears in the Proceedings of the 26th International Symposium on Graph Drawin...
A queue layout of a graph consists of a total order of the vertices, and a partition of the edges in...
A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel li...
A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel li...
Graph separators are a ubiquitous tool in graph theory and computer science. However, in some applic...
We introduce a new method to optimize the required area, minimum angle and number of bends of planar...
Given a planar graph G, what is the maximum number of collinear vertices in a planar straight-line d...
In John Tantalo’s on-line game Planarity the player is given a non-plane straight-line drawing of a ...
We prove that planar graphs have polylogarithmic queue number, thus improving upon the previous poly...
We prove that planar graphs have O(log(2) n) queue number, thus improving upon the previous O(root n...
A queue layout of a graph consists of a linear order of its vertices and a partition of its edges in...
A famous result due to de Fraysseix, Pach, and Pollack [Combinatorica, 1990] and Schnyder [Order, 19...
We prove that planar graphs have O(log2 n) queue number, thus improving upon the previous O(Formula ...
Abstract. A k-queue layout of a graph consists of a total order of the vertices, and a partition of ...
AbstractThis paper investigates the basic problem of computing crossing-free straight-line 3D grid d...
14 pages, 10 figures, Appears in the Proceedings of the 26th International Symposium on Graph Drawin...
A queue layout of a graph consists of a total order of the vertices, and a partition of the edges in...
A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel li...
A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel li...
Graph separators are a ubiquitous tool in graph theory and computer science. However, in some applic...
We introduce a new method to optimize the required area, minimum angle and number of bends of planar...
Given a planar graph G, what is the maximum number of collinear vertices in a planar straight-line d...
In John Tantalo’s on-line game Planarity the player is given a non-plane straight-line drawing of a ...
DOI
Add to ORKG