Pyrga, E., F. Schulz, D. Wagner and C. Zaroliagis: Efficient models for timetable information in public transportation systems. In: ACM Journal of Experimental Algorithmics 12, 2.4.1-2.4.39 (2007).
doi: 10.1145/1227161.1227166
localid: C12573CC004A8E26-11C670EE17289C83C1257355004DAEDB-Pyrga2007
Träff, J.L. and C. Zaroliagis: A simple parallel algorithm for the single-source shortest path problem on planar digraphs. In: Journal of Parallel and Distributed Computing 60, 9, 1103-1124 (2000).
localid: C1256428004B93B8-9AFD9FF59A7D8E77C1256A15004F6FC1-TraeffZaroliagis2000
Chaudhuri, S., K.V. Subrahmanyam, F. Wagner and C. Zaroliagis: Computing mimicking networks. In: Algorithmica 26, 1, 31-49 (2000).
localid: C1256428004B93B8-5EE8B1BB2C1A5F68C1256A0F004D1844-ChaudhuriSubrahmanyamWagnerZaroliagis2000
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
Chaudhuri, S. and C. Zaroliagis: Shortest paths in digraphs of small treewidth. Part I, {Sequential} algorithms. In: Algorithmica 27, 3/4, 212-226 (2000).
localid: C1256428004B93B8-08065B16CD009B6AC1256A0F004E2366-ChaudhuriZaroliagis2000
Kagaris, D., G.E. Pantziou, S. Tragoudas and C. Zaroliagis: Transmissions in a network with capacities and delays. In: Networks 33, 3, 167-174 (1999).
localid: C1256428004B93B8-9F3590EEDA68F986C125648400520B35-Zaro-et-al-1-97
Arikati, S.R., S. Chaudhuri and C. Zaroliagis: All-Pairs Min-Cut in Sparse Networks. In: Journal of Algorithms 29, 82-110 (1998).
localid: C1256428004B93B8-4F5288722A23EA07C125672300615D50-Arikati-Chaudhuri-Zaroliagis-98
Frigioni, D., T. Miller, U. Nanni, G. Pasqualone, G. Schäfer and C. Zaroliagis: An experimental study of dynamic algorithms for directed graphs. In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), (Eds.) Bilardi, Gianfranco; Italiano, Giuseppe F.; Pietracaprina, Andrea; Pucci, Geppino. Lecture Notes in Computer Science. Springer, Berlin, Germany (1998) 368-380.
localid: C1256428004B93B8-CEB3C30EAC9372F8C12567230063B0EF-Frigioni-et-al-98
Brodal, G.S., J.L. Träff and C. Zaroliagis: A Parallel Priority Queue with Constant Time Operations. In: Journal of Parallel and Distributed Computing, Special Issue on Parallel Data Structures 49, 1, 4-21 (1998).
localid: C1256428004B93B8-B361FCC97C8B40D1C125670200693C69-Brodal1998d
Alberts, D., G. Cattaneo, G. Italiano, U. Nanni and C. Zaroliagis: A Software Library of Dynamic Graph Algorithms. In: Proceedings of Workshop on Algorithms and Experiments (ALEX-98), (Eds.) Battiti, R; Bertosi, A. University of Trento, Trento, Italy (1998) 129-136.
localid: C1256428004B93B8-83B5D1E4D946B021C12567230062808C-Alberts-et-al-98
http://edoc.mpg.de
The Max Planck Society does not take any responsibility for the content of this export.