37 citations · 112 across the 33 of their papers we have counts for
6 papers · 1 filter
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…
Obstructing Visibilities with One Obstacle
Steven Chaplick, Fabian Lipp, Ji-won Park +1
Obstacle representations of graphs have been investigated quite intensely over the last few years. We focus on graphs that can be represented by a single obstacle. Given a (topolog…
Simultaneous Orthogonal Planarity
Patrizio Angelini, Steven Chaplick, Sabine Cornelsen +7
We introduce and study the problem: Given planar graphs each with maximum degree 4 and the same vertex set, do they admit an OrthoSEFE, that is, is there…
On -Topological Intersection Graphs
Steven Chaplick, Martin Töpfer, Jan Voborník +1
Biró et al. (1992) introduced -graphs, intersection graphs of connected subgraphs of a subdivision of a graph . They are related to many classes of geometric intersection gra…
Approximation Schemes for Geometric Coverage Problems
Steven Chaplick, Minati De, Alexander Ravsky +1
In their seminal work, Mustafa and Ray (2009) showed that a wide class of geometric set cover (SC) problems admit a PTAS via local search -- this is one of the most general approac…
The Complexity of Drawing Graphs on Few Lines and Few Planes
Steven Chaplick, Krzysztof Fleszar, Fabian Lipp +3
It is well known that any graph admits a crossing-free straight-line drawing in and that any planar graph admits the same even in . For a graph and…