| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Maintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs | Anand, Abhash et al. | 2012 |
| 2 | Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs | Khanna, Neelesh et al. | 2010 |
| Number of result pages: | 1 |
| Number of documents: | 2 |
