10 citations · 26 across the 13 of their papers we have counts for
5 papers · 1 filter
A Gap in the 42-Queue Layout Algorithm for Planar Graphs
Sergey Pupyrev
A queue layout of a graph consists of a linear order of the vertices and a partition of the edges into queues so that no two edges in a single queue are nested. The minimum number…
Forbidden Patterns in Mixed Linear Layouts
Deborah Haun, Laura Merker, Sergey Pupyrev
An ordered graph is a graph with a total order over its vertices. A linear layout of an ordered graph is a partition of the edges into sets of either non-crossing edges, called sta…
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…
Improved Bounds for Track Numbers of Planar Graphs
Sergey Pupyrev
A track layout of a graph consists of a vertex coloring and a total order of each color class, such that no two edges cross between any two color classes. The track number of a gra…
On Dispersable Book Embeddings
Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann +2
In a dispersable book embedding, the vertices of a given graph must be ordered along a line l, called spine, and the edges of G must be drawn at different half-planes bounded b…