12 citations · 22 across the 11 of their papers we have counts for
18 papers
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…
On the Exponential Growth of Geometric Shapes
Nada Almalki, Siddharth Gupta, Othon Michail
In this paper, we explore how geometric structures can be grown exponentially fast. The studied processes start from an initial shape and apply a sequence of centralized growth ope…
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…
1st Workshop on Maritime Computer Vision (MaCVi) 2023: Challenge Results
Benjamin Kiefer, Matej Kristan, Janez Perš +70
The 1 Workshop on Maritime Computer Vision (MaCVi) 2023 focused on maritime computer vision for Unmanned Aerial Vehicles (UAV) and Unmanned Surface Vehicle (USV), and…
Distributed Reconfiguration of Spanning Trees
Siddharth Gupta, Manish Kumar, Shreyas Pai
In a reconfiguration problem, given a problem and two feasible solutions of the problem, the task is to find a sequence of transformations to reach from one solution to the other s…
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…