112 citations · 298 across the 40 of their papers we have counts for
11 papers · 1 filter
How to Draw a Planar Graph: An Experimental Evaluation
Sergey Pupyrev
Planar graphs are central to graph drawing, with extensive results on planar layouts and related structures. Every planar graph admits a planar straight-line drawing, and algorithm…
The Price of Upwardness
Patrizio Angelini, Therese Biedl, Markus Chimani +8
Not every directed acyclic graph (DAG) whose underlying undirected graph is planar admits an upward planar drawing. We are interested in pushing the notion of upward drawings beyon…
Mixed Linear Layouts of Planar Graphs
Sergey Pupyrev
A -stack (respectively, -queue) layout of a graph consists of a total order of the vertices, and a partition of the edges into sets of non-crossing (non-nested) edges wit…
The Bundled Crossing Number
Md. Jawaherul Alam, Martin Fink, Sergey Pupyrev
We study the algorithmic aspect of edge bundling. A bundled crossing in a drawing of a graph is a group of crossings between two sets of parallel edges. The bundled crossing number…
Colored Non-Crossing Euclidean Steiner Forest
Sergey Bereg, Krzysztof Fleszar, Philipp Kindermann +3
Given a set of -colored points in the plane, we consider the problem of finding trees such that each tree connects all points of one color class, no two trees cross, and the…
On Embeddability of Buses in Point Sets
Till Bruckdorfer, Michael Kaufmann, Stephen Kobourov +1
Set membership of points in the plane can be visualized by connecting corresponding points via graphical features, like paths, trees, polygons, ellipses. In this paper we study the…
Contact Representations of Sparse Planar Graphs
Md. Jawaherul Alam, David Eppstein, Michael Kaufmann +4
We study representations of graphs by contacts of circular arcs, CCA-representations for short, where the vertices are interior-disjoint circular arcs in the plane and each edge is…
Balanced Circle Packings for Planar Graphs
Md. Jawaherul Alam, David Eppstein, Michael T. Goodrich +2
We study balanced circle packings and circle-contact representations for planar graphs, where the ratio of the largest circle's diameter to the smallest circle's diameter is polyno…
Semantic Word Cloud Representations: Hardness and Approximation Algorithms
Lukas Barth, Sara Irina Fabrikant, Stephen Kobourov +7
We study a geometric representation problem, where we are given a set of axis-aligned rectangles with fixed dimensions and a graph with vertex set . The task is to…
Computing Consensus Curves
Livio De La Cruz, Stephen Kobourov, Sergey Pupyrev +2
We consider the problem of extracting accurate average ant trajectories from many (possibly inaccurate) input trajectories contributed by citizen scientists. Although there are man…
Edge Routing with Ordered Bundles
Sergey Bereg, Alexander E. Holroyd, Lev Nachmanson +1
Edge bundling reduces the visual clutter in a drawing of a graph by uniting the edges into bundles. We propose a method of edge bundling drawing each edge of a bundle separately as…