@article{Megiddo1981, 
     author = "Megiddo, N. and Tamir, A. and Zemel, E. and Chandrasekaran, R.", 
     doi = "10.1137/0210023", 
     issn = "0097-5397", 
     journal = "SIAM Journal on Computing", 
     keyword = "1,by several authors that,fact,found in linear time,in some structured sets,in the cardinality of,introduction,it has been observed,it is now well,known that the kth,largest element of an,location theory,ordered,p-center,polynomial algorithm,s,selection,set s can be,since the discovery of,that,the kth largest,tree", 
     link = "http://epubs.siam.org/doi/abs/10.1137/0210023", 
     number = "2", 
     pages = "328--337", 
     title = "An $O(n\log^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems", 
     uri = "http://epubs.siam.org/doi/abs/10.1137/0210023", 
     volume = "10", 
     year = "1981", 
}

Problems: 89