112 citations · 667 across the 96 of their papers we have counts for
9 papers · 1 filter
Evacuating Two Robots from Two Unknown Exits on the Perimeter of a Disk
Debasish Pattanayak, H. Ramesh, Partha Sarathi Mandal +1
Distributed evacuation of mobile robots is a recent development. We consider the evacuation problem of two robots which are initially located at the center of a unit disk. Both the…
Walking Through Waypoints
Saeed Akhoondian Amiri, Klaus-Tycho Foerster, Stefan Schmid
We initiate the study of a fundamental combinatorial problem: Given a capacitated graph , find a shortest walk ("route") from a source to a destination t…
Approximate and Incremental Network Function Placement
Tamas Lukovszki, Matthias Rost, Stefan Schmid
The virtualization and softwarization of modern computer networks introduces interesting new opportunities for a more flexible placement of network functions and middleboxes (firew…
Towards Communication-Aware Robust Topologies
Chen Avin, Alexandr Hercules, Andreas Loukas +1
We currently witness the emergence of interesting new network topologies optimized towards the traffic matrices they serve, such as demand-aware datacenter interconnects (e.g., Pro…
Demand-Aware Network Designs of Bounded Degree
Chen Avin, Kaushik Mondal, Stefan Schmid
Traditionally, networks such as datacenter interconnects are designed to optimize worst-case performance under arbitrary traffic patterns. Such network designs can however be far f…
Distributed Dominating Set Approximations beyond Planar Graphs
Saeed Akhoondian Amiri, Stefan Schmid, Sebastian Siebertz
The Minimum Dominating Set (MDS) problem is one of the most fundamental and challenging problems in distributed computing. While it is well-known that minimum dominating sets canno…