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

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