 | 2012 |
|---|
| 6 |       | Aaron Bernstein:
Near linear time (1 + ε)-approximation for restricted shortest paths in undirected graphs.
SODA 2012: 189-201 |
| 2011 |
|---|
| 5 | | Aaron Bernstein,
Liam Roditty:
Improved Dynamic Algorithms for Maintaining Approximate Shortest Paths Under Deletions.
SODA 2011: 1355-1365 |
| 2010 |
|---|
| 4 | | Aaron Bernstein:
A Nearly Optimal Algorithm for Approximating Replacement Paths and k Shortest Simple Paths in General Graphs.
SODA 2010: 742-755 |
| 2009 |
|---|
| 3 | | Aaron Bernstein:
Fully Dynamic (2 + epsilon) Approximate All-Pairs Shortest Paths with Fast Query and Close to Linear Update Time.
FOCS 2009: 693-702 |
| 2 | | Aaron Bernstein,
David R. Karger:
A nearly optimal oracle for avoiding failed vertices and edges.
STOC 2009: 101-110 |
| 2008 |
|---|
| 1 | | Aaron Bernstein,
David R. Karger:
Improved distance sensitivity oracles via random sampling.
SODA 2008: 34-43 |
Data released under the ODC-BY 1.0 license — See also our legal information page