1 citations · 1 across the 12 of their papers we have counts for
5 papers · 1 filter
Sliding Squares in Parallel
Hugo A. Akitaya, Sándor P. Fekete, Peter Kramer +4
We consider algorithmic problems motivated by modular robotic reconfiguration in the sliding square model, in which we are given square-shaped modules in a (labeled or unlabele…
Coordinated Motion Planning: Multi-Agent Path Finding in a Densely Packed, Bounded Domain
Sándor P. Fekete, Ramin Kosfeld, Peter Kramer +3
We study Multi-Agent Path Finding for arrangements of labeled agents in the interior of a simply connected domain: Given a unique start and target position for each agent, the goal…
Targeted Drug Delivery: Algorithmic Methods for Collecting a Swarm of Particles with Uniform External Forces
Aaron T. Becker, Sándor P. Fekete, Li Huang +5
We investigate algorithmic approaches for targeted drug delivery in a complex, maze-like environment, such as a vascular system. The basic scenario is given by a large swarm of mic…
On the Connectivity of the Flip Graph of Plane Spanning Paths
Linda Kleist, Peter Kramer, Christian Rieck
Flip graphs of non-crossing configurations in the plane are widely studied objects, e.g., flip graph of triangulations, spanning trees, Hamiltonian cycles, and perfect matchings. T…
Dispersive Vertex Guarding for Simple and Non-Simple Polygons
Sándor P. Fekete, Joseph S. B. Mitchell, Christian Rieck +2
We study the Dispersive Art Gallery Problem with vertex guards: Given a polygon , with pairwise geodesic Euclidean vertex distance of at least , and a rational numb…