| 2026 | ICALP | Parallel Reachability and Shortest Paths on Non-Sparse Digraphs: Near-Linear Work and Sub-Square-Root Depth. | Vikrant Ashvinkumar, Aaron Bernstein, Maximilian Probst Gutenberg, Thatchaphol Saranurak |
| 2026 | SODA | From Unweighted to Weighted Dynamic Matching in Non-Bipartite Graphs: A Low-Loss Reduction. | Aaron Bernstein, Jiale Chen |
| 2026 | SODA | Separations between Oblivious and Adaptive Adversaries for Natural Dynamic Graph Problems. | Aaron Bernstein, Sayan Bhattacharya, Nick Fischer, Peter Kiss, Thatchaphol Saranurak |
| 2026 | STOC | Reviving Thorup's Shortcut Conjecture. | Aaron Bernstein, Henry L. Fleischmann, Maximilian Probst Gutenberg, Bernhard Haeupler, Gary Hoppenworth, Yonggang Jiang, George Z. Li, Seth Pettie, Thatchaphol Saranurak, Leon Schiller |
| 2025 | FOCS | Combinatorial Maximum Flow via Weighted Push-Relabel on Shortcut Graphs. | Aaron Bernstein, Joakim Blikstad, Jason Li, Thatchaphol Saranurak, Ta-Wei Tu |
| 2025 | SODA | Faster Approximation Algorithms for Restricted Shortest Paths in Directed Graphs. | Vikrant Ashvinkumar, Aaron Bernstein, Adam Karczmarz |
| 2025 | SODA | Streaming and Communication Complexity of Load-Balancing via Matching Contractors. | Sepehr Assadi, Aaron Bernstein, Zachary Langley, Lap Chi Lau, Robert Wang |
| 2025 | SODA | Matching Composition and Efficient Weight Reduction in Dynamic Matching. | Aaron Bernstein, Jiale Chen, Aditi Dudeja, Zachary Langley, Aaron Sidford, Ta-Wei Tu |
| 2025 | STOC | Deterministic Dynamic Maximal Matching in Sublinear Update Time. | Aaron Bernstein, Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak |
| 2024 | ESA | 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 |
| 2024 | FOCS | Maximum Flow by Augmenting Paths in n | Aaron Bernstein, Joakim Blikstad, Thatchaphol Saranurak, Ta-Wei Tu |
| 2023 | SODA | Closing the Gap Between Directed Hopsets and Shortcut Sets. | Aaron Bernstein, Nicole Wein |
| 2022 | FOCS | Negative-Weight Single-Source Shortest Paths in Near-linear Time. | Aaron Bernstein, Danupon Nanongkai, Christian Wulff-Nilsen |
| 2022 | ICALP | Decremental Matching in General Graphs. | Sepehr Assadi, Aaron Bernstein, Aditi Dudeja |
| 2022 | ICALP | 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 |
| 2021 | ESA | Incremental SCC Maintenance in Sparse Graphs. | Aaron Bernstein, Aditi Dudeja, Seth Pettie |
| 2021 | FOCS | Deterministic Decremental SSSP and Approximate Min-Cost Flow in Almost-Linear Time. | Aaron Bernstein, Maximilian Probst Gutenberg, Thatchaphol Saranurak |
| 2021 | STOC | A framework for dynamic matching in weighted graphs. | Aaron Bernstein, Aditi Dudeja, Zachary Langley |
| 2020 | FOCS | Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion Balancing. | Aaron Bernstein, Maximilian Probst Gutenberg, Thatchaphol Saranurak |
| 2020 | FOCS | Near-Optimal Decremental SSSP in Dense Weighted Digraphs. | Aaron Bernstein, Maximilian Probst Gutenberg, Christian Wulff-Nilsen |
| 2020 | ICALP | Improved Bounds for Matching in Random-Order Streams. | Aaron Bernstein |
| 2019 | SODA | Towards a Unified Theory of Sparsification for Matching Problems. | Sepehr Assadi, Aaron Bernstein |
| 2019 | SODA | Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs. | Sepehr Assadi, MohammadHossein Bateni, Aaron Bernstein, Vahab S. Mirrokni, Cliff Stein |
| 2019 | SODA | A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching. | Aaron Bernstein, Sebastian Forster, Monika Henzinger |
| 2019 | STOC | Distributed exact weighted all-pairs shortest paths in near-linear time. | Aaron Bernstein, Danupon Nanongkai |
| 2019 | STOC | Decremental strongly-connected components and single-source reachability in near-linear time. | Aaron Bernstein, Maximilian Probst, Christian Wulff-Nilsen |
| 2018 | SODA | Incremental Topological Sort and Cycle Detection in Expected Total Time. | Aaron Bernstein, Shiri Chechik |
| 2018 | SODA | Online Bipartite Matching with Amortized Replacements. | Aaron Bernstein, Jacob Holm, Eva Rotenberg |
| 2017 | ICALP | Deterministic Partially Dynamic Single Source Shortest Paths in Weighted Graphs. | Aaron Bernstein |
| 2017 | ICALP | General Bounds for Incremental Maximization. | Aaron Bernstein, Yann Disser, Martin Gro |
| 2017 | SODA | Deterministic Partially Dynamic Single Source Shortest Paths for Sparse Graphs. | Aaron Bernstein, Shiri Chechik |
| 2016 | SODA | Faster Fully Dynamic Matchings with Small Approximation Ratios. | Aaron Bernstein, Cliff Stein |
| 2016 | STOC | Deterministic decremental single source shortest paths: beyond the o(mn) bound. | Aaron Bernstein, Shiri Chechik |
| 2015 | ICALP | Fully Dynamic Matching in Bipartite Graphs. | Aaron Bernstein, Cliff Stein |
| 2013 | STOC | Maintaining shortest paths under deletions in weighted directed graphs: [extended abstract]. | Aaron Bernstein |
| 2012 | SODA | Near linear time (1 + ε)-approximation for restricted shortest paths in undirected graphs. | Aaron Bernstein |
| 2011 | SODA | Improved Dynamic Algorithms for Maintaining Approximate Shortest Paths Under Deletions. | Aaron Bernstein, Liam Roditty |
| 2010 | SODA | A Nearly Optimal Algorithm for Approximating Replacement Paths and k Shortest Simple Paths in General Graphs. | Aaron Bernstein |
| 2009 | FOCS | Fully Dynamic (2 + epsilon) Approximate All-Pairs Shortest Paths with Fast Query and Close to Linear Update Time. | Aaron Bernstein |
| 2009 | STOC | A nearly optimal oracle for avoiding failed vertices and edges. | Aaron Bernstein, David R. Karger |
| 2008 | SODA | Improved distance sensitivity oracles via random sampling. | Aaron Bernstein, David R. Karger |