List of papers:

 

Dynamic connectivity:

 

Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications

Greg N. Frederickson
Link

 

Sparsification�A Technique for Speeding Up Dynamic Graph Algorithms

David Eppstein, Zvi Galil, Giuseppe F. Italiano,Amnon Nissenzweig

Link

 

Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity

Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup

Link

 

Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs.

Liam Roditty, Uri Zwick

Link

 

 

Previous Exams:

 

Exam 1

 

Exam 2