@article{Frederickson1985, 
     author = "Frederickson, Greg N.", 
     doi = "10.1137/0214055", 
     isbn = "0897910990", 
     issn = "0097-5397", 
     journal = "SIAM Journal on Computing", 
     keyword = "1,a minimum,be maintained for an,connected components,consider the following on-line,data structures,edge insertion and deletion,introduction,k smallest spanning,minimum spanning tree,on-line computation,planar graphs,spanning tree is to,trees,underlying graph,update problem,which is modified repeatedly", 
     link = "http://epubs.siam.org/doi/abs/10.1137/0214055", 
     number = "4", 
     pages = "781--798", 
     title = "Data Structures for On-Line Updating of Minimum Spanning Trees, With Applications", 
     uri = "http://epubs.siam.org/doi/abs/10.1137/0214055", 
     volume = "14", 
     year = "1985", 
}

Problems: 53 54