research
∙
06/15/2022
A Unifying Approach to Efficient (Near)-Gathering of Disoriented Robots with Limited Visibility
We consider a swarm of n robots in a d-dimensional Euclidean space. The ...
share
research
∙
05/23/2022
The k-Server with Preferences Problem
The famous k-Server Problem covers plenty of resource allocation scenari...
research
∙
09/24/2021
The Max-Line-Formation Problem
We consider n robots with limited visibility: each robot can observe oth...
research
∙
08/04/2021
Full Version – Server Cloud Scheduling
Consider a set of jobs connected to a directed acyclic task graph with a...
research
∙
10/09/2020
Gathering in Linear Time: A Closed Chain of Disoriented Luminous Robots with Limited Visibility
This work focuses on the following question related to the Gathering pro...
research
∙
10/05/2020
A Discrete and Continuous Study of the Max-Chain-Formation Problem
Most existing robot formation problems seek a target formation of a cert...
research
∙
05/17/2020
The Online Multi-Commodity Facility Location Problem
We consider a natural extension to the metric uncapacitated Facility Loc...
research
∙
05/13/2020
Local Gathering of Mobile Robots in Three Dimensions
In this work, we initiate the research about the Gathering problem for r...
research
∙
10/18/2019
Approximating Weighted Completion Time for Order Scheduling with Setup Times
Consider a scheduling problem in which jobs need to be processed on a si...
research
∙
07/23/2019
Managing Multiple Mobile Resources
We extend the Mobile Server Problem, introduced in SPAA'17, to a model w...
research
∙
04/17/2019
Rendering of Complex Heterogenous Scenes using Progressive Blue Surfels
We present a technique for rendering highly complex 3D scenes in real-ti...
research
∙
04/10/2019
The Mobile Server Problem
We introduce the mobile server problem, inspired by current trends to mo...
research
∙
02/11/2017
