Christos Zaroliagis
Christos Zaroliagis
Professor of Algorithm Design, Analysis and Engineering, University of Patras
Verified email at ceid.upatras.gr - Homepage
TitleCited byYear
Depth from defocus: a real aperture imaging approach
S Chaudhuri, AN Rajagopalan
Springer Science & Business Media, 2012
3022012
Efficient models for timetable information in public transportation systems
E Pyrga, F Schulz, D Wagner, C Zaroliagis
Journal of Experimental Algorithmics (JEA) 12, 2.4, 2008
2482008
Using multi-level graphs for timetable information in railway systems
F Schulz, D Wagner, C Zaroliagis
Workshop on Algorithm Engineering and Experimentation, 43-59, 2002
1772002
Timetable information: Models and algorithms
M Müller-Hannemann, F Schulz, D Wagner, C Zaroliagis
Algorithmic Methods for Railway Optimization, 67-90, 2007
1412007
Planar spanners and approximate shortest path queries among obstacles in the plane
S Arikati, DZ Chen, LP Chew, G Das, M Smid, CD Zaroliagis
European Symposium on Algorithms, 514-528, 1996
1281996
Geometric containers for efficient shortest-path computation
D Wagner, T Willhalm, C Zaroliagis
Journal of Experimental Algorithmics (JEA) 10, 1.3, 2005
1212005
Shortest paths in digraphs of small treewidth. Part I: Sequential algorithms
S Chaudhuri, CD Zaroliagis
Algorithmica 27 (3-4), 212-226, 2000
842000
Robust and online large-scale optimization: models and techniques for transportation systems
RK Ahuja, RH Möhring, CD Zaroliagis
Springer, 2009
802009
Multiobjective optimization: Improved FPTAS for shortest paths and non-linear objectives with applications
G Tsaggouris, C Zaroliagis
Theory of Computing Systems 45 (1), 162-186, 2009
712009
A parallel priority queue with constant time operations
GS Brodal, JL Träff, CD Zaroliagis
Journal of Parallel and Distributed Computing 49 (1), 4-21, 1998
661998
An experimental study of basic communication protocols in ad-hoc mobile networks
I Chatzigiannakis, S Nikoletseas, N Paspallis, P Spirakis, C Zaroliagis
International Workshop on Algorithm Engineering, 159-171, 2001
552001
Computing shortest paths and distances in planar graphs
HN Djidjev, GE Pantziou, CD Zaroliagis
International Colloquium on Automata, Languages, and Programming, 327-338, 1991
531991
The eCOMPASS multimodal tourist tour planner
D Gavalas, V Kasapakis, C Konstantopoulos, G Pantziou, N Vathis, ...
Expert systems with Applications 42 (21), 7303-7316, 2015
512015
Experimental Comparison of Shortest Path Approaches for Timetable Information.
E Pyrga, F Schulz, D Wagner, CD Zaroliagis
ALENEX/ANALC, 88-99, 2004
502004
On-line and dynamic algorithms for shortest path problems
HN Djidjev, GE Pantziou, CD Zaroliagis
Annual Symposium on Theoretical Aspects of Computer Science, 193-204, 1995
501995
A simple parallel algorithm for the single-source shortest path problem on planar digraphs
JL Träff, CD Zaroliagis
International Workshop on Parallel Algorithms for Irregularly Structured …, 1996
49*1996
Towards realistic modeling of time-table information through the time-dependent approach
E Pyrga, F Schulz, D Wagner, C Zaroliagis
Electronic Notes in Theoretical Computer Science 92, 85-103, 2004
462004
Non-additive shortest paths
G Tsaggouris, C Zaroliagis
European Symposium on Algorithms, 822-834, 2004
452004
Shortest path queries in digraphs of small treewidth
S Chaudhuri, CD Zaroliagis
International Colloquium on Automata, Languages, and Programming, 244-255, 1995
451995
Improved bounds for finger search on a RAM
A Kaporis, C Makris, S Sioutas, A Tsakalidis, K Tsichlas, C Zaroliagis
European Symposium on Algorithms, 325-336, 2003
442003
The system can't perform the operation now. Try again later.
Articles 1–20