Improved distance sensitivity oracles via random sampling. - Aaron Bernstein; David R. Karger (SODA, 2008)

Fully Dynamic (2 + epsilon) Approximate All-Pairs Shortest Paths with Fast Query and Close to Linear Update Time. - Aaron Bernstein (FOCS, 2009)

A nearly optimal oracle for avoiding failed vertices and edges. - Aaron Bernstein; David R. Karger (STOC, 2009)

A Nearly Optimal Algorithm for Approximating Replacement Paths and k Shortest Simple Paths in General Graphs. - Aaron Bernstein (SODA, 2010)

Improved Dynamic Algorithms for Maintaining Approximate Shortest Paths Under Deletions. - Aaron Bernstein; Liam Roditty (SODA, 2011)

Near linear time (1 + ε)-approximation for restricted shortest paths in undirected graphs. - Aaron Bernstein (SODA, 2012)

Maintaining shortest paths under deletions in weighted directed graphs: [extended abstract]. - Aaron Bernstein (STOC, 2013)

Fully Dynamic Matching in Bipartite Graphs. - Aaron Bernstein; Cliff Stein 001 (ICALP (1), 2015)

Faster Fully Dynamic Matchings with Small Approximation Ratios. - Aaron Bernstein; Cliff Stein 001 (SODA, 2016)

Deterministic decremental single source shortest paths: beyond the o(mn) bound. - Aaron Bernstein; Shiri Chechik (STOC, 2016)

Maintaining Shortest Paths Under Deletions in Weighted Directed Graphs. - Aaron Bernstein (SIAM J. Comput., 2016)

Dynamic Algorithms for Shortest Paths and Matching. - Aaron Bernstein (2016)

Decremental Approximate-APSP in Directed Graphs. - Aaron Bernstein (Encyclopedia of Algorithms, 2016)

Dynamic Approximate-APSP. - Aaron Bernstein (Encyclopedia of Algorithms, 2016)

Deterministic Partially Dynamic Single Source Shortest Paths in Weighted Graphs. - Aaron Bernstein (ICALP, 2017)

General Bounds for Incremental Maximization. - Aaron Bernstein; Yann Disser; Martin Groß 001 (ICALP, 2017)

Simultaneously Load Balancing for Every p-norm, With Reassignments. - Aaron Bernstein; Tsvi Kopelowitz; Seth Pettie; Ely Porat; Clifford Stein 001 (ITCS, 2017)

Deterministic Partially Dynamic Single Source Shortest Paths for Sparse Graphs. - Aaron Bernstein; Shiri Chechik (SODA, 2017)

Online bipartite matching with amortized $O( log^2 n)$ replacements. - Aaron Bernstein; Jacob Holm; Eva Rotenberg (CoRR, 2017)

Incremental Topological Sort and Cycle Detection in Expected Total Time. - Aaron Bernstein; Shiri Chechik (SODA, 2018)

Online Bipartite Matching with Amortized Replacements. - Aaron Bernstein; Jacob Holm; Eva Rotenberg (SODA, 2018)

Towards a Unified Theory of Sparsification for Matching Problems. - Sepehr Assadi; Aaron Bernstein (SOSA, 2019)

Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs. - Sepehr Assadi; MohammadHossein Bateni; Aaron Bernstein; Vahab S. Mirrokni; Cliff Stein 001 (SODA, 2019)

Distributed exact weighted all-pairs shortest paths in near-linear time. - Aaron Bernstein; Danupon Nanongkai (STOC, 2019)

Online Bipartite Matching with Amortized O(log 2 n) Replacements. - Aaron Bernstein; Jacob Holm; Eva Rotenberg (J. ACM, 2019)

Decremental Strongly Connected Components and Single-Source Reachability in Near-Linear Time. - Aaron Bernstein; Maximilian Probst Gutenberg; Christian Wulff-Nilsen (SIAM J. Comput., 2019)

Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time. - Aaron Bernstein; Danupon Nanongkai (SIAM J. Comput., 2019)

Distance-Preserving Graph Contractions. - Aaron Bernstein; Karl Däubel; Yann Disser; Max Klimm; Torsten Mütze; Frieder Smolny (SIAM J. Discret. Math., 2019)

Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion Balancing. - Aaron Bernstein; Maximilian Probst Gutenberg; Thatchaphol Saranurak (FOCS, 2020)

Near-Optimal Decremental SSSP in Dense Weighted Digraphs. - Aaron Bernstein; Maximilian Probst Gutenberg; Christian Wulff-Nilsen (FOCS, 2020)

Online Matching with Recourse: Random Edge Arrivals. - Aaron Bernstein; Aditi Dudeja (FSTTCS, 2020)

Improved Bounds for Distributed Load Balancing. - Sepehr Assadi; Aaron Bernstein; Zachary Langley (DISC, 2020)

Improved Bound for Matching in Random-Order Streams. - Aaron Bernstein (CoRR, 2020)

Incremental SCC Maintenance in Sparse Graphs. - Aaron Bernstein; Aditi Dudeja; Seth Pettie (ESA, 2021)

Deterministic Decremental SSSP and Approximate Min-Cost Flow in Almost-Linear Time. - Aaron Bernstein; Maximilian Probst Gutenberg; Thatchaphol Saranurak (FOCS, 2021)

A framework for dynamic matching in weighted graphs. - Aaron Bernstein; Aditi Dudeja; Zachary Langley (STOC, 2021)

A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching. - Aaron Bernstein; Sebastian Forster; Monika Henzinger (ACM Trans. Algorithms, 2021)

Decremental Matching in General Graphs. - Sepehr Assadi; Aaron Bernstein; Aditi Dudeja (ICALP, 2022)

Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary. - Aaron Bernstein; Jan van den Brand; Maximilian Probst Gutenberg; Danupon Nanongkai; Thatchaphol Saranurak; Aaron Sidford; He Sun 001 (ICALP, 2022)

Negative-Weight Single-Source Shortest Paths in Almost-linear Time. - Aaron Bernstein; Danupon Nanongkai; Christian Wulff-Nilsen (CoRR, 2022)

General bounds for incremental maximization. - Aaron Bernstein; Yann Disser; Martin Groß 001; Sandra Himburg (Math. Program., 2022)

Dynamic Graph Algorithms (Dagstuhl Seminar 22461). - Aaron Bernstein; Shiri Chechik; Sebastian Forster; Tsvi Kopelowitz; Yasamin Nazari; Nicole Wein (Dagstuhl Reports, 2022)

All-Norm Load Balancing in Graph Streams via the Multiplicative Weights Update Method. - Sepehr Assadi; Aaron Bernstein; Zachary Langley (ITCS, 2023)

Closing the Gap Between Directed Hopsets and Shortcut Sets. - Aaron Bernstein; Nicole Wein (SODA, 2023)

Parallel and Distributed Exact Single-Source Shortest Paths with Negative Edge Weights. - Vikrant Ashvinkumar; Aaron Bernstein; Nairen Cao; Christoph Grunau; Bernhard Haeupler; Yonggang Jiang; Danupon Nanongkai; Hsin-Hao Su (CoRR, 2023)

Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge Weights. - Vikrant Ashvinkumar; Aaron Bernstein; Nairen Cao; Christoph Grunau; Bernhard Haeupler; Yonggang Jiang; Danupon Nanongkai; Hsin-Hao Su (ESA, 2024)

Maximum Flow by Augmenting Paths in n2+o(1) Time. - Aaron Bernstein; Joakim Blikstad; Thatchaphol Saranurak; Ta-Wei Tu (FOCS, 2024)

Are There Graphs Whose Shortest Path Structure Requires Large Edge Weights? - Aaron Bernstein; Greg Bodwin; Nicole Wein (ITCS, 2024)

Improved Bounds for Matching in Random-Order Streams. - Aaron Bernstein (Theory Comput. Syst., 2024)

Low Sensitivity Hopsets. - Vikrant Ashvinkumar; Aaron Bernstein; Chengyuan Deng; Jie Gao 001; Nicole Wein (ITCS, 2025)

Faster Approximation Algorithms for Restricted Shortest Paths in Directed Graphs. - Vikrant Ashvinkumar; Aaron Bernstein; Adam Karczmarz (SODA, 2025)

Streaming and Communication Complexity of Load-Balancing via Matching Contractors. - Sepehr Assadi; Aaron Bernstein; Zachary Langley; Lap Chi Lau; Robert Wang 004 (SODA, 2025)

Matching Composition and Efficient Weight Reduction in Dynamic Matching. - Aaron Bernstein; Jiale Chen 003; Aditi Dudeja; Zachary Langley; Aaron Sidford; Ta-Wei Tu (SODA, 2025)

Deterministic Dynamic Maximal Matching in Sublinear Update Time. - Aaron Bernstein; Sayan Bhattacharya; Peter Kiss; Thatchaphol Saranurak (STOC, 2025)

Negative-Weight Single-Source Shortest Paths in Near-Linear Time. - Aaron Bernstein; Danupon Nanongkai; Christian Wulff-Nilsen (Commun. ACM, 2025)