Check out the full article (in German).
Optimal Online Algorithms for Dynamic Balanced Graph PartitioningMaciej Pacut, Mahmoud Parham, and Stefan Schmid.39th IEEE Conference on Computer Communications (INFOCOM),…
We’ll present our recent algorithmic results on online graph clustering, demand-aware network designs and local fast failover at SIAM SODA…
This site provides an overview of our ongoing research on the foundations of self-adjusting networks.
