7 citations · 9 across the 6 of their papers we have counts for
8 papers
Recognition of Triangulation Duals of Simple Polygons With and Without Holes
Martin Derka, Alejandro López-Ortiz, Daniela Maftuleac
We investigate the problem of determining if a given graph corresponds to the dual of a triangulation of a simple polygon. This is a graph recognition problem, where in our particu…
Lower Bounds for Graph Exploration Using Local Policies
Aditya Kumar Akash, Sandor P. Fekete, Seoung Kyou Lee +3
We give lower bounds for various natural node- and edge-based local strategies for exploring a graph. We consider this problem both in the setting of an arbitrary graph as well as…
Shortest Paths and Convex Hulls in 2D Complexes with Non-Positive Curvature
Anna Lubiw, Daniela Maftuleac, Megan Owen
Globally non-positively curved, or CAT(0), polyhedral complexes arise in a number of applications, including evolutionary biology and robotics. These spaces have unique shortest pa…
List Colouring Big Graphs On-Line
Martin Derka, Alejandro López-Ortiz, Daniela Maftuleac
In this paper, we investigate the problem of graph list colouring in the on-line setting. We provide several results on paintability of graphs in the model introduced by Schauz [13…
Local Policies for Efficiently Patrolling a Triangulated Region by a Robot Swarm
Daniela Maftuleac, Seoung Kyou Lee, Sandor P. Fekete +3
We present and analyze methods for patrolling an environment with a distributed swarm of robots. Our approach uses a physical data structure - a distributed triangulation of the wo…
Optimal Distributed Searching in the Plane with and without Uncertainty
Alejandro Lopez-Ortiz, Daniela Maftuleac
We consider the problem of multiple agents or robots searching for a target in the plane. This is motivated by Search and Rescue operations (SAR) in the high seas which in the past…