12 citations · 22 across the 11 of their papers we have counts for
4 papers · 1 filter
The Parametrized Complexity of the Segment Number
Sabine Cornelsen, Giordano Da Lozzo, Luca Grilli +3
Given a straight-line drawing of a graph, a segment is a maximal set of edges that form a line segment. Given a planar graph , the segment number of is the minimum number of…
Collision Detection for Modular Robots -- it is easy to cause collisions and hard to avoid them
Siddharth Gupta, Marc van Kreveld, Othon Michail +1
We consider geometric collision-detection problems for modular reconfigurable robots. Assuming the nodes (modules) are connected squares on a grid, we investigate the complexity of…
Parameterized Approaches to Orthogonal Compaction
Walter Didimo, Siddharth Gupta, Philipp Kindermann +3
Orthogonal graph drawings are used in applications such as UML diagrams, VLSI layout, cable plans, and metro maps. We focus on drawing planar graphs and assume that we are given an…
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…