37 citations · 112 across the 33 of their papers we have counts for
4 papers · 1 filter
Testing Upward Planarity of Partial -Trees
Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati +3
We present an -time algorithm to test whether an -vertex directed partial -tree is upward planar. This result improves upon the previously best known algorithm, which…
Bounding and computing obstacle numbers of graphs
Martin Balko, Steven Chaplick, Robert Ganian +4
An obstacle representation of a graph consists of a set of pairwise disjoint simply-connected closed regions and a one-to-one mapping of the vertices of to points such that…
On Upward-Planar L-Drawings of Graphs
Patrizio Angelini, Steven Chaplick, Sabine Cornelsen +1
In an upward-planar L-drawing of a directed acyclic graph (DAG) each edge is represented as a polyline composed of a vertical segment with its lowest endpoint at the tail of $e…
Parameterized Algorithms for Upward Planarity
Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati +3
We obtain new parameterized algorithms for the classical problem of determining whether a directed acyclic graph admits an upward planar drawing. Our results include a new fixed-pa…