Your search returned the following 2 documents:

2. Fast Algorithms for Maintaining Shortest Paths
   Hristo N. Djidjev, Grammati E. Pantziou, and Christos Zaroliagis
   In: Fundamentals of Computation Theory: 10th International Conference (FCT95), Dresden, Germany, August, 22nd - 25th, 1995, 191-200
   
1. Approximation Algorithms for Minimum Size 2-connectivity Problems
   Piotr Krysta and V. S. Anil Kumar
   In: Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS-01), Dresden, Germany, February 15-17, 2001, 431-442