Your search returned the following 28 documents:

28. Efficient models for timetable information in public transportation systems
    Evangelia Pyrga, Frank Schulz, Dorothea Wagner, and Christos Zaroliagis
    ACM Journal of Experimental Algorithmics 12: 1-39, 2007
    
27. A simple parallel algorithm for the single-source shortest path problem on planar digraphs
    Jesper Larsson Träff and Christos Zaroliagis
    Journal of Parallel and Distributed Computing 60 (9): 1103-1124, 2000
    
26. Computing mimicking networks
    Shiva Chaudhuri, K. V. Subrahmanyam, Frank Wagner, and Christos Zaroliagis
    Algorithmica 26 (1): 31-49, 2000
    
25. Improved algorithms for dynamic shortest paths
    Hristo N. Djidjev, G. E. Pantziou, and Christos Zaroliagis
    Algorithmica 28 (4): 367-389, 2000
    
24. Shortest paths in digraphs of small treewidth. Part I, Sequential algorithms
    Shiva Chaudhuri and Christos Zaroliagis
    Algorithmica 27 (3/4): 212-226, 2000
    
23. Transmissions in a network with capacities and delays
    Dimitrios Kagaris, Grammati E. Pantziou, Spyros Tragoudas, and Christos Zaroliagis
    Networks 33 (3): 167-174, 1999
    
22. A Parallel Priority Queue with Constant Time Operations
    Gerth Stølting Brodal, Jesper Larsson Träff, and Christos Zaroliagis
    Journal of Parallel and Distributed Computing, Special Issue on Parallel Data Structures 49 (1): 4-21, 1998
    
21. A Software Library of Dynamic Graph Algorithms
    David Alberts, G Cattaneo, Giuseppe Italiano, Umberto Nanni, and Christos Zaroliagis
    In: Proceedings of Workshop on Algorithms and Experiments (ALEX-98), Trento, Italy, February, 9-11, 1998, 129-136
    
20. All-Pairs Min-Cut in Sparse Networks
    Srinivasa Rao Arikati, Shiva Chaudhuri, and Christos Zaroliagis
    Journal of Algorithms 29: 82-110, 1998
    
19. An experimental study of dynamic algorithms for directed graphs
    Daniele Frigioni, Tobias Miller, Umberto Nanni, Giulio Pasqualone, Guido Schäfer, and Christos Zaroliagis
    In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), Venice, Italy, August, 24-26, 1998, 368-380
    
18. Computing Mimicking Networks
    Shiva Chaudhuri, K. V. Subrahmanyam, Frank Wagner, and Christos Zaroliagis
    In: Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP-98), Aalborg, Denmark, July, 11-15, 1998, 556-567
    
17. Shortest paths in digraphs of small treewidth. Part II: Optimal parallel algorithms
    Shiva Chaudhuri and Christos Zaroliagis
    Theoretical Computer Science 203 (2): 205-223, 1998. Note: Special issue on ESA'95
    
16. A First Experimental Study of a Dynamic Transitive Closure Algorithm
    Tobias Miller and Christos Zaroliagis
    In: Proceedings of the Workshop on Algorithm Engineering (WAE-97), Venice, Italy, September, 1997, 64-73
    
15. A parallel priority data structure with applications
    Gerth Stølting Brodal, Jesper Larsson Träff, and Christos Zaroliagis
    In: 11th Internatinal Parallel Processing Symposium (IPPS-97), Geneva, Switzerland, 1997, 689-693
    
14. Efficient Computation of implicit representations of sparse graphs
    Srinivasa Rao Arikati, Anil Maheshwari, and Christos Zaroliagis
    Discrete Applied Mathematics 78 (1-3): 1-16, 1997
    
13. Simple and Work-Efficient Parallel Algorithms for the Minimum Spanning Tree Problem
    Christos Zaroliagis
    Parallel Processing Letters 7 (1): 25-37, 1997
    
12. A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs
    Jesper Larsson Träff and Christos Zaroliagis
    In: Parallel Algorithms for Irregularly Structured Problems: 3rd International Workshop (IRREGULAR'96), Santa Barbara, August, 19th-21st, 1996, 183-194
    
11. Hammock-on-ears decomposition : a technique for the efficient parallel solution of shortest paths and other problems
    Dimitris J. Kavvadias, Grammati E. Pantziou, Paul G. Spirakis, and Christos Zaroliagis
    Theoretical Computer Science 168 (1): 121-154, 1996
    
10. On the Parallel Complexity of Acyclic Logic Programs
    Shiva Chaudhuri, Yannis Dimopoulos, and Christos Zaroliagis
    Parallel Processing Letters 6 (2): 223-230, 1996
    
9. Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane
   Srinivasa Rao Arikati, Danny Z. Chen, L. Paul Chew, Gautam Das, Michiel Smid, and Christos Zaroliagis
   In: Algorithms - ESA '96: 4th Annual European Symposium, Barcelona, September, 25th-27th, 1996, 514-528
   
8. All-Pairs Min-Cut in Sparse Networks
   Srinivasa Rao Arikati, Shiva Chaudhuri, and Christos Zaroliagis
   In: Foundations of software technology and theoretical computer science (FSTTCS-95) : 15th conference, Bangalore, India, December, 18th - 20th, 1995, 363-376
   
7. 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
   
6. On-line and Dynamic Algorithms for Shortest Path Problems
   Hristo N. Djidjev, Grammati E. Pantziou, and Christos Zaroliagis
   In: STACS95: 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March, 2nd - 4th, 1995, 193-204
   
5. On the Computation of Fast Data Transmissions in Networks
   Dimitrios Kagaris, Grammati E. Pantziou, Spyros Tragoudas, and Christos Zaroliagis
   In: Algorithms and Data Structures: 4th International Workshop (WADS95), Kingston, Canada, August, 16th - 18th, 1995, 291-302
   
4. Optimal Parallel Shortest Paths in Small Treewidth Digraphs
   Shiva Chaudhuri and Christos Zaroliagis
   In: Algorithms - ESA'95: 3rd Annual European Symposium, Corfu, Greece, September, 25th - 27th, 1995, 31-45
   
3. Quickest Paths: Parallelization and Dynamization
   Dimitrios Kagaris, Grammati E. Pantziou, Spyros Tragoudas, and Christos Zaroliagis
   In: 28th Annual Hawaii International Conference on System Sciences (HICSS-28), Wailea, Hawaii, USA, January, 3rd - 6th, 1995, 39-44
   
2. Shortest Path Queries in Digraphs of Small Treewidth
   Shiva Chaudhuri and Christos Zaroliagis
   In: Automata, Languages, and Programming: 22nd International Colloquium (ICALP95), Szeged, Hungary, July, 10th - 14th, 1995, 244-255
   
1. The Fourth Moment in Luby's Distribution
   Devdatt Dubhashi, Grammati E. Pantziou, Paul G. Spirakis, and Christos Zaroliagis
   Theoretical Computer Science 148 (1): 133-140, 1995