List of papers:

Liam Roditty, Uri Zwick: Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs.

Lecturer:

Date:

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

Lecturer:

Date:

Aaron Bernstein: Maintaining shortest paths under deletions in weighted directed graphs: [extended abstract].

Lecturer:

Date:

Monika Henzinger, Sebastian Krinninger, and Danupon Nanongkai: Dynamic Approximate All-Pairs Shortest Paths: Breaking the \tilde O(mn) Barrier and Derandomization

Lecturer:

Date:

Bruce Kapron, Valerie King and Ben Mountjoy: Dynamic graph connectivity in polylogarithmic worst case time.

Lecturer:

Date:

Surender Baswana, Sumeet Khurana, Soumojit Sarkar: Fully dynamic randomized algorithms for graph spanners.

Lecturer:

Date:

Ofer Neiman, Shay Solomon: Simple deterministic algorithms for fully dynamic maximal matching.

Lecturer:

Date:

Manoj Gupta and Richard Peng: Fully Dynamic (1+e) Approximate Matchings.

Lecturer:

Date: