Name
Papers
Collaborators
FRIEDHELM MEYER AUF DER HEIDE
178
221
Citations 
PageRank 
Referers 
1744
238.01
2033
Referees 
References 
1627
1675
Search Limit
1001000
Title
Citations
PageRank
Year
A discrete and continuous study of the Max-Chain-Formation problem00.342022
The Impact Of The Gabriel Subgraph Of The Visibility Graph On The Gathering Of Mobile Autonomous Robots00.342021
Gathering a Euclidean Closed Chain of Robots in Linear Time.00.342021
A Discrete and Continuous Study of the Max-Chain-Formation Problem - Slow down to Speed Up.00.342020
Gathering Anonymous, Oblivious Robots on a Grid00.342020
Managing Multiple Mobile Resources00.342019
Visibility‐Aware Progressive Farthest Point Sampling on the GPU00.342019
Scheduling with Interjob Communication on Parallel Processors.10.372018
Brief Announcement: Communication in Systems of Home Based Mobile Agents.00.342018
Online Facility Location with Mobile Facilities.00.342018
Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets.00.342018
The Mobile Server Problem.00.342017
A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries.00.342017
A Continuous Strategy For Collisionless Gathering00.342017
Towards the price of leasing online40.482016
Cost-efficient Scheduling on Machines from the Cloud.10.352016
Asymptotically Optimal Gathering on a Grid.40.442016
The Impact of the Gabriel Subgraph of the Visibility Graph on the Gathering of Mobile Autonomous Robots.00.342016
Online Resource Leasing00.342015
Non-Preemptive Scheduling on Machines with Setup Times.30.442015
Towards Gathering Robots with Limited View in Linear Time: The Closed Chain Case.00.342015
Gathering a Closed Chain of Robots on a Grid30.412015
Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks10.352015
Scheduling shared continuous resources on many-cores60.492014
Quality Of Service In Network Creation Games20.432014
Continuous Aggregation in Dynamic Ad-Hoc Networks.00.342014
Hierarchies.00.342013
Token Dissemination in Geometric Dynamic Networks.20.372013
Energy-efficient strategies for building short chains of mobile robots locally.20.362013
On Two-Party Communication through Dynamic Networks.30.392013
Real-Time 3D Rendering of Heterogeneous Scenes.00.342013
The EATCS Award 2013. Call for nominations.00.342012
Optimal and competitive runtime bounds for continuous, local gathering of mobile robots90.562012
Continuous local strategies for robotic formation problems00.342012
An experimental comparison of load balancing strategies in a web computing environment00.342011
A new approach for analyzing convergence algorithms for mobile robots220.912011
Convergence of local communication chain strategies via linear transformations: or how to trade locality for speed50.422011
Collisionless gathering of robots with an extent160.862011
A survey on relay placement with runtime and approximation guarantees10.362011
Algorithmische Grundlagen verteilter Speichersysteme00.342010
A local O(n2) gathering algorithm140.772010
Optimal strategies for maintaining a chain of relays between an explorer and a base camp201.112009
Power-aware online file allocation in mobile ad hoc networks: [extended abstract]00.342009
Local Strategies for Connecting Stations by Small Robotic Networks.70.532008
Planar Visibility Counting30.412008
Local strategies for maintaining a chain of relay stations between an explorer and a base station60.552007
Algorithmic Aspects of Large and Complex Networks, 4.-9. September 200561.232006
Maintaining Communication Between an Explorer and a Base Station171.122006
A Web Computing Environment for Parallel Algorithms in Java130.872006
05361 Abstracts Collection - Algorithmic Aspects of Large and Complex Networks00.342005
  • 1
  • 2