Publications (49)
Drawing Graphs on Few Lines and Few Planes
Steven Chaplick, Krzysztof Fleszar, Fabian Lipp +3
We investigate the problem of drawing graphs in 2D and 3D such that their edges (or only their vertices) can be covered by few lines or planes. We insist on straight-line edges and…
Relaxed Agreement Forests
Virginia Aardevol Martinez, Steven Chaplick, Steven Kelk +3
There are multiple factors which can cause the phylogenetic inference process to produce two or more conflicting hypotheses of the evolutionary history of a set X of biological ent…
Query Minimization under Stochastic Uncertainty
Steven Chaplick, Magnús M. Halldórsson, Murilo S. de Lima +1
We study problems with stochastic uncertainty information on intervals for which the precise value can be queried by paying a cost. The goal is to devise an adaptive decision tree…
Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees
Steven Chaplick, Giordano Da Lozzo, Emilio Di Giacomo +2
The of a planar graph is the minimum number of edge slopes in a planar straight-line drawing of . It is known that $psn(G) \in O(c^Î…
Bundled Crossings Revisited
Steven Chaplick, Thomas C. van Dijk, Myroslav Kryven +3
An effective way to reduce clutter in a graph drawing that has (many) crossings is to group edges that travel in parallel into \emph{bundles}. Each edge can participate in many suc…
Equilateral L-Contact Graphs
Steven Chaplick, Stephen Kobourov, Torsten Ueckerdt
We consider {\em L-graphs}, that is contact graphs of axis-aligned L-shapes in the plane, all with the same rotation. We provide several characterizations of L-graphs, drawing conn…