Your search returned the following 3 documents:

3. Randomized graph data-structures for approximate shortest path problem
   Surender Baswana and Sandeep Sen
   In: Handbook of Data Structures and Applications, 2004, 38.1-38.19
   
2. The Cover Time of Deterministic Random Walks
   Tobias Friedrich and Thomas Sauerwald
   In: Computing and Combinatorics : 16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, 2010, 130-139
   
1. The Curse of Connectivity: $t$-Total Vertex (Edge) Cover
   Henning Fernau, Fedor V. Fomin, Geevarghese Philip, and Saket Saurabh
   In: Computing and Combinatorics, 16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010. Proceedings, Nha Trang, Vietnam, 2010, 34-43
   [PDF: Download: cocoon088a.pdf]