Travelled to:1 × Japan
2 × USA
Collaborated with:C.Stein ∅ D.R.Karger
Talks about:graph (2) shortest (1) maintain (1) bipartit (1) abstract (1) weight (1) vertic (1) extend (1) direct (1) under (1)
Person: Aaron Bernstein
DBLP: Bernstein:Aaron
Contributed to:
2015
20132009Wrote 3 papers:
- ICALP-v1-2015-BernsteinS #graph
- Fully Dynamic Matching in Bipartite Graphs (AB, CS), pp. 167–179.
- STOC-2013-Bernstein #graph #maintenance
- Maintaining shortest paths under deletions in weighted directed graphs: [extended abstract] (AB), pp. 725–734.
- STOC-2009-BernsteinK
- A nearly optimal oracle for avoiding failed vertices and edges (AB, DRK), pp. 101–110.