No. Title Author Year
1 All-Norm Load Balancing in Graph Streams via the Multiplicative Weights Update Method Assadi, Sepehr et al. 2023
2 Dynamic Graph Algorithms (Dagstuhl Seminar 22461) Bernstein, Aaron et al. 2023
3 Decremental Matching in General Graphs Assadi, Sepehr et al. 2022
4 Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary Bernstein, Aaron et al. 2022
5 Incremental SCC Maintenance in Sparse Graphs Bernstein, Aaron et al. 2021
6 Improved Bounds for Distributed Load Balancing Assadi, Sepehr et al. 2020
7 Improved Bounds for Matching in Random-Order Streams Bernstein, Aaron 2020
8 Online Matching with Recourse: Random Edge Arrivals Bernstein, Aaron et al. 2020
9 Distance-Preserving Graph Contractions Bernstein, Aaron et al. 2018
10 Towards a Unified Theory of Sparsification for Matching Problems Assadi, Sepehr et al. 2018
11 Deterministic Partially Dynamic Single Source Shortest Paths in Weighted Graphs Bernstein, Aaron 2017
12 General Bounds for Incremental Maximization Bernstein, Aaron et al. 2017
13 Simultaneously Load Balancing for Every p-norm, With Reassignments Bernstein, Aaron et al. 2017
Current Page :
Number of result pages: 1
Number of documents: 13

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI