112 citations · 298 across the 40 of their papers we have counts for
4 papers · 1 filter
Lazy Queue Layouts of Posets
Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann +2
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…
The Turing Test for Graph Drawing Algorithms
Helen C. Purchase, Daniel Archambault, Stephen Kobourov +3
Do algorithms for drawing graphs pass the Turing Test? That is, are their outputs indistinguishable from graphs drawn by humans? We address this question through a human-centred ex…
Book Embeddings of Graph Products
Sergey Pupyrev
A -stack layout (also called a -page book embedding) of a graph consists of a total order of the vertices, and a partition of the edges into sets of non-crossing edges wi…
Four Pages Are Indeed Necessary for Planar Graphs
Michael A. Bekos, Michael Kaufmann, Fabian Klute +3
An embedding of a graph in a book consists of a linear order of its vertices along the spine of the book and of an assignment of its edges to the pages of the book, so that no two…