Djidjev, H. N., G. E. Pantziou and C. Zaroliagis: Improved algorithms for dynamic shortest paths. In: Algorithmica 28, 4, 367-389 (2000).
localid: C1256428004B93B8-41458CF44A59B62BC1256A1000321DEA-DjidjevPantziouZaroliagis2000
Djidjev, H.N., G.E. Pantziou and C. Zaroliagis: Fast Algorithms for Maintaining Shortest Paths. In: Fundamentals of Computation Theory: 10th International Conference (FCT95), (Eds.) Reichel, Horst. Lecture Notes in Computer Science. Springer, Berlin (1995) 191-200.
localid: C1256428004B93B8-269967F5E042AA20C125645A0039918A-Djidjev-Pantziou-Zaro-2-95
Djidjev, H.N., G.E. Pantziou and C. Zaroliagis: On-line and Dynamic Algorithms for Shortest Path Problems. In: STACS95: 12th Annual Symposium on Theoretical Aspects of Computer Science, (Eds.) Mayr, Ernst W.; Puech, Claude. Lecture Notes in Computer Science. Springer, Berlin (1995) 193-204.
localid: C1256428004B93B8-539D9D1B41530B02C125645A00393E75-Djidjev-Pantziou-Zaro-1-95
http://edoc.mpg.de
The Max Planck Society does not take any responsibility for the content of this export.