@article{Eppstein1997, 
     author = "Eppstein, David and Galil, Zvi and Italiano, Giuseppe F. and Nissenzweig, Amnon", 
     doi = "10.1145/265910.265914", 
     issn = "00045411", 
     journal = "Journal of the ACM", 
     keyword = "dynamic graph algorithms,edge and vertex connectivity,minimum spanning trees", 
     link = "http://dl.acm.org/citation.cfm?id=265910.265914", 
     month = "sep", 
     number = "5", 
     pages = "669--696", 
     publisher = "ACM", 
     title = "Sparsification---A Technique for Speeding Up Dynamic Graph Algorithms", 
     uri = "http://dl.acm.org/citation.cfm?id=265910.265914", 
     volume = "44", 
     year = "1997", 
}

Problems: 59 60