A discrete and continuous study of the Max-Chain-Formation problem | 0 | 0.34 | 2022 |
The Impact Of The Gabriel Subgraph Of The Visibility Graph On The Gathering Of Mobile Autonomous Robots | 0 | 0.34 | 2021 |
Gathering a Euclidean Closed Chain of Robots in Linear Time. | 0 | 0.34 | 2021 |
A Discrete and Continuous Study of the Max-Chain-Formation Problem - Slow down to Speed Up. | 0 | 0.34 | 2020 |
Gathering Anonymous, Oblivious Robots on a Grid | 0 | 0.34 | 2020 |
Managing Multiple Mobile Resources | 0 | 0.34 | 2019 |
Visibility‐Aware Progressive Farthest Point Sampling on the GPU | 0 | 0.34 | 2019 |
Scheduling with Interjob Communication on Parallel Processors. | 1 | 0.37 | 2018 |
Brief Announcement: Communication in Systems of Home Based Mobile Agents. | 0 | 0.34 | 2018 |
Online Facility Location with Mobile Facilities. | 0 | 0.34 | 2018 |
Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets. | 0 | 0.34 | 2018 |
The Mobile Server Problem. | 0 | 0.34 | 2017 |
A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries. | 0 | 0.34 | 2017 |
A Continuous Strategy For Collisionless Gathering | 0 | 0.34 | 2017 |
Towards the price of leasing online | 4 | 0.48 | 2016 |
Cost-efficient Scheduling on Machines from the Cloud. | 1 | 0.35 | 2016 |
Asymptotically Optimal Gathering on a Grid. | 4 | 0.44 | 2016 |
The Impact of the Gabriel Subgraph of the Visibility Graph on the Gathering of Mobile Autonomous Robots. | 0 | 0.34 | 2016 |
Online Resource Leasing | 0 | 0.34 | 2015 |
Non-Preemptive Scheduling on Machines with Setup Times. | 3 | 0.44 | 2015 |
Towards Gathering Robots with Limited View in Linear Time: The Closed Chain Case. | 0 | 0.34 | 2015 |
Gathering a Closed Chain of Robots on a Grid | 3 | 0.41 | 2015 |
Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks | 1 | 0.35 | 2015 |
Scheduling shared continuous resources on many-cores | 6 | 0.49 | 2014 |
Quality Of Service In Network Creation Games | 2 | 0.43 | 2014 |
Continuous Aggregation in Dynamic Ad-Hoc Networks. | 0 | 0.34 | 2014 |
Hierarchies. | 0 | 0.34 | 2013 |
Token Dissemination in Geometric Dynamic Networks. | 2 | 0.37 | 2013 |
Energy-efficient strategies for building short chains of mobile robots locally. | 2 | 0.36 | 2013 |
On Two-Party Communication through Dynamic Networks. | 3 | 0.39 | 2013 |
Real-Time 3D Rendering of Heterogeneous Scenes. | 0 | 0.34 | 2013 |
The EATCS Award 2013. Call for nominations. | 0 | 0.34 | 2012 |
Optimal and competitive runtime bounds for continuous, local gathering of mobile robots | 9 | 0.56 | 2012 |
Continuous local strategies for robotic formation problems | 0 | 0.34 | 2012 |
An experimental comparison of load balancing strategies in a web computing environment | 0 | 0.34 | 2011 |
A new approach for analyzing convergence algorithms for mobile robots | 22 | 0.91 | 2011 |
Convergence of local communication chain strategies via linear transformations: or how to trade locality for speed | 5 | 0.42 | 2011 |
Collisionless gathering of robots with an extent | 16 | 0.86 | 2011 |
A survey on relay placement with runtime and approximation guarantees | 1 | 0.36 | 2011 |
Algorithmische Grundlagen verteilter Speichersysteme | 0 | 0.34 | 2010 |
A local O(n2) gathering algorithm | 14 | 0.77 | 2010 |
Optimal strategies for maintaining a chain of relays between an explorer and a base camp | 20 | 1.11 | 2009 |
Power-aware online file allocation in mobile ad hoc networks: [extended abstract] | 0 | 0.34 | 2009 |
Local Strategies for Connecting Stations by Small Robotic Networks. | 7 | 0.53 | 2008 |
Planar Visibility Counting | 3 | 0.41 | 2008 |
Local strategies for maintaining a chain of relay stations between an explorer and a base station | 6 | 0.55 | 2007 |
Algorithmic Aspects of Large and Complex Networks, 4.-9. September 2005 | 6 | 1.23 | 2006 |
Maintaining Communication Between an Explorer and a Base Station | 17 | 1.12 | 2006 |
A Web Computing Environment for Parallel Algorithms in Java | 13 | 0.87 | 2006 |
05361 Abstracts Collection - Algorithmic Aspects of Large and Complex Networks | 0 | 0.34 | 2005 |