| 2008 |
|---|
| 80 | EE | Spyros C. Kontogiannis,
Christos D. Zaroliagis:
Robust Line Planning under Unknown Incentives and Elasticity of Frequencies.
ATMOS 2008 |
| 79 | EE | Ioannis Chatzigiannakis,
Athanasios Kinalis,
Georgios Mylonas,
Sotiris E. Nikoletseas,
Grigorios Prasinos,
Christos D. Zaroliagis:
TRAILS, a Toolkit for Efficient, Realistic and Evolving Models of Mobility, Faults and Obstacles in Wireless Networks.
Annual Simulation Symposium 2008: 23-32 |
| 78 | EE | Athanasios Papagelis,
Manos Papagelis,
Christos D. Zaroliagis:
Iclone: towards online social navigation.
Hypertext 2008: 237-238 |
| 77 | EE | Athanasios Papagelis,
Manos Papagelis,
Christos D. Zaroliagis:
Enabling Social Navigation on the Web.
Web Intelligence 2008: 162-168 |
| 76 | EE | Christos D. Zaroliagis:
Engineering Algorithms for Large Network Applications.
Encyclopedia of Algorithms 2008 |
| 75 | EE | Christos D. Zaroliagis:
LEDA: a Library of Efficient Algorithms.
Encyclopedia of Algorithms 2008 |
| 74 | EE | Christos D. Zaroliagis:
Negative Cycles in Weighted Digraphs.
Encyclopedia of Algorithms 2008 |
| 73 | EE | Ioannis Krommidas,
Christos D. Zaroliagis:
An experimental study of algorithms for fully dynamic transitive closure.
ACM Journal of Experimental Algorithmics 12: (2008) |
| 2007 |
|---|
| 72 | | Frank Geraets,
Leo G. Kroon,
Anita Schöbel,
Dorothea Wagner,
Christos D. Zaroliagis:
Algorithmic Methods for Railway Optimization, International Dagstuhl Workshop, Dagstuhl Castle, Germany, June 20-25, 2004, 4th International Workshop, ATMOS 2004, Bergen, Norway, September 16-17, 2004, Revised Selected Papers
Springer 2007 |
| 71 | EE | Athanasios Papagelis,
Christos D. Zaroliagis:
Searchius: A Collaborative Search Engine.
ENC 2007: 88-98 |
| 70 | EE | Evangelia Pyrga,
Frank Schulz,
Dorothea Wagner,
Christos D. Zaroliagis:
Efficient models for timetable information in public transportation systems.
ACM Journal of Experimental Algorithmics 12: (2007) |
| 69 | EE | Elisavet Konstantinou,
Yannis C. Stamatiou,
Christos D. Zaroliagis:
Efficient generation of secure elliptic curves.
Int. J. Inf. Sec. 6(1): 47-63 (2007) |
| 2006 |
|---|
| 68 | EE | George Tsaggouris,
Christos D. Zaroliagis:
QoS-aware Multicommodity Flows and Transportation Planning.
ATMOS 2006 |
| 67 | EE | Danny Krizanc,
Michael Kaufmann,
Pierre Fraigniaud,
Christos D. Zaroliagis:
Topic 12: Theory and Algorithms for Parallel Computation.
Euro-Par 2006: 799 |
| 66 | EE | Alexis C. Kaporis,
Christos Makris,
Spyros Sioutas,
Athanasios K. Tsakalidis,
Kostas Tsichlas,
Christos D. Zaroliagis:
Dynamic Interpolation Search Revisited.
ICALP (1) 2006: 382-394 |
| 65 | EE | George Tsaggouris,
Christos D. Zaroliagis:
Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications.
ISAAC 2006: 389-398 |
| 64 | EE | Gabriele Di Stefano,
Alberto Petricola,
Christos D. Zaroliagis:
On the Implementation of Parallel Shortest Path Algorithms on a Supercomputer.
ISPA 2006: 406-417 |
| 63 | EE | Ioannis Chatzigiannakis,
Panagiotis C. Kokkinos,
Christos D. Zaroliagis:
Routing protocols for efficient communication in wireless ad-hoc networks.
PE-WASUN 2006: 90-97 |
| 2005 |
|---|
| 62 | EE | Ioannis Krommidas,
Christos D. Zaroliagis:
An Experimental Study of Algorithms for Fully Dynamic Transitive Closure.
ESA 2005: 544-555 |
| 61 | EE | Martin Holzer,
Grigorios Prasinos,
Frank Schulz,
Dorothea Wagner,
Christos D. Zaroliagis:
Engineering Planar Separator Algorithms.
ESA 2005: 628-639 |
| 60 | EE | Andrea Pietracaprina,
Kieran T. Herley,
Christos D. Zaroliagis,
Casiano Rodriguez-Leon:
Topic 12 Theory and Algorithms for Parallel Computation.
Euro-Par 2005: 929 |
| 59 | EE | Alexis C. Kaporis,
Christos Makris,
George Mavritsakis,
Spyros Sioutas,
Athanasios K. Tsakalidis,
Kostas Tsichlas,
Christos D. Zaroliagis:
ISB-Tree: A New Indexing Scheme with Efficient Expected Behaviour.
ISAAC 2005: 318-327 |
| 58 | EE | Christos D. Zaroliagis:
Recent Advances in Multiobjective Optimization.
SAGA 2005: 45-47 |
| 57 | EE | Athanasios Papagelis,
Christos D. Zaroliagis:
Searching the Web Through User Information Spaces.
WISE 2005: 611-612 |
| 56 | EE | Dorothea Wagner,
Thomas Willhalm,
Christos D. Zaroliagis:
Geometric containers for efficient shortest-path computation.
ACM Journal of Experimental Algorithmics 10: (2005) |
| 2004 |
|---|
| 55 | | Evangelia Pyrga,
Frank Schulz,
Dorothea Wagner,
Christos D. Zaroliagis:
Experimental Comparison of Shortest Path Approaches for Timetable Information.
ALENEX/ANALC 2004: 88-99 |
| 54 | EE | Georgia Hadjicharalambous,
Petrica C. Pop,
Evangelia Pyrga,
George Tsaggouris,
Christos D. Zaroliagis:
The Railway Traveling Salesman Problem.
ATMOS 2004: 264-275 |
| 53 | EE | Matthias Müller-Hannemann,
Frank Schulz,
Dorothea Wagner,
Christos D. Zaroliagis:
Timetable Information: Models and Algorithms.
ATMOS 2004: 67-90 |
| 52 | EE | Ioannis Chatzigiannakis,
Athanasios Kinalis,
Athanassios S. Poulakidas,
Grigorios Prasinos,
Christos D. Zaroliagis:
DAP: A Generic Platform for the Simulation of Distributed Algorithms.
Annual Simulation Symposium 2004: 167-177 |
| 51 | EE | George Tsaggouris,
Christos D. Zaroliagis:
Non-additive Shortest Paths.
ESA 2004: 822-834 |
| 50 | EE | Elisavet Konstantinou,
Yannis C. Stamatiou,
Christos D. Zaroliagis:
On the Use of Weber Polynomials in Elliptic Curve Cryptography.
EuroPKI 2004: 335-349 |
| 49 | EE | Elisavet Konstantinou,
Aristides Kontogeorgis,
Yannis C. Stamatiou,
Christos D. Zaroliagis:
Generating Prime Order Elliptic Curves: Difficulties and Efficiency Considerations.
ICISC 2004: 261-278 |
| 48 | EE | Dorothea Wagner,
Thomas Willhalm,
Christos D. Zaroliagis:
Dynamic Shortest Paths Containers.
Electr. Notes Theor. Comput. Sci. 92: 65-84 (2004) |
| 47 | EE | Evangelia Pyrga,
Frank Schulz,
Dorothea Wagner,
Christos D. Zaroliagis:
Towards Realistic Modeling of Time-Table Information through the Time-Dependent Approach.
Electr. Notes Theor. Comput. Sci. 92: 85-103 (2004) |
| 2003 |
|---|
| 46 | EE | Alexis C. Kaporis,
Christos Makris,
Spyros Sioutas,
Athanasios K. Tsakalidis,
Kostas Tsichlas,
Christos D. Zaroliagis:
Improved Bounds for Finger Search on a RAM.
ESA 2003: 325-336 |
| 45 | EE | Elisavet Konstantinou,
Yannis C. Stamatiou,
Christos D. Zaroliagis:
On the Construction of Prime Order Elliptic Curves.
INDOCRYPT 2003: 309-322 |
| 44 | EE | Sotiris E. Nikoletseas,
Grigorios Prasinos,
Paul G. Spirakis,
Christos D. Zaroliagis:
Attack Propagation in Networks.
Theory Comput. Syst. 36(5): 553-574 (2003) |
| 2002 |
|---|
| 43 | EE | Frank Schulz,
Dorothea Wagner,
Christos D. Zaroliagis:
Using Multi-level Graphs for Timetable Information in Railway Systems.
ALENEX 2002: 43-59 |
| 42 | EE | Elisavet Konstantinou,
Yannis C. Stamatiou,
Christos D. Zaroliagis:
On the Efficient Generation of Elliptic Curves over Prime Fields.
CHES 2002: 333-348 |
| 41 | EE | Elisavet Konstantinou,
Yannis C. Stamatiou,
Christos D. Zaroliagis:
A Software Library for Elliptic Curve Cryptography.
ESA 2002: 625-636 |
| 2001 |
|---|
| 40 | EE | Ioannis Chatzigiannakis,
Sotiris E. Nikoletseas,
Nearchos Paspallis,
Paul G. Spirakis,
Christos D. Zaroliagis:
An Experimental Study of Basic Communication Protocols in Ad-hoc Mobile Networks.
Algorithm Engineering 2001: 159-171 |
| 39 | EE | Sotiris E. Nikoletseas,
Grigorios Prasinos,
Paul G. Spirakis,
Christos D. Zaroliagis:
Attack propagation in networks.
SPAA 2001: 67-76 |
| 38 | | Daniele Frigioni,
Tobias Miller,
Umberto Nanni,
Christos D. Zaroliagis:
An Experimental Study of Dynamic Algorithms for Transitive Closure.
ACM Journal of Experimental Algorithmics 6: 9 (2001) |
| 37 | EE | Christos D. Zaroliagis:
Introduction - Algorithmic MeThods and Models for Optimization of RailwayS - ATMOS 2001.
Electr. Notes Theor. Comput. Sci. 50(1): (2001) |
| 2000 |
|---|
| 36 | EE | Paul G. Spirakis,
Christos D. Zaroliagis:
Distributed Algorithm Engineering.
Experimental Algorithmics 2000: 197-228 |
| 35 | EE | Christos D. Zaroliagis:
Implementations and Experimental Studies of Dynamic Graph Algorithms.
Experimental Algorithmics 2000: 229-278 |
| 34 | EE | Shiva Chaudhuri,
K. V. Subrahmanyam,
Frank Wagner,
Christos D. Zaroliagis:
Computing Mimicking Networks.
Algorithmica 26(1): 31-49 (2000) |
| 33 | EE | Shiva Chaudhuri,
Christos D. Zaroliagis:
Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms.
Algorithmica 27(3): 212-226 (2000) |
| 32 | EE | Hristo Djidjev,
Grammati E. Pantziou,
Christos D. Zaroliagis:
Improved Algorithms for Dynamic Shortest Paths.
Algorithmica 28(4): 367-389 (2000) |
| 31 | EE | Jesper Larsson Träff,
Christos D. Zaroliagis:
A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs.
J. Parallel Distrib. Comput. 60(9): 1103-1124 (2000) |
| 1999 |
|---|
| 30 | | Jeffrey Scott Vitter,
Christos D. Zaroliagis:
Algorithm Engineering, 3rd International Workshop, WAE '99, London, UK, July 19-21, 1999, Proceedings
Springer 1999 |
| 29 | EE | Dimitrios Kagaris,
Grammati E. Pantziou,
Spyros Tragoudas,
Christos D. Zaroliagis:
Transmissions in a network with capacities and delays.
Networks 33(3): 167-174 (1999) |
| 1998 |
|---|
| 28 | EE | Daniele Frigioni,
Tobias Miller,
Umberto Nanni,
Giulio Pasqualone,
Guido Schäfer,
Christos D. Zaroliagis:
An Experimental Study of Dynamic Algorithms for Directed Graphs.
ESA 1998: 368-380 |
| 27 | EE | Shiva Chaudhuri,
K. V. Subrahmanyam,
Frank Wagner,
Christos D. Zaroliagis:
Computing Mimicking Networks.
ICALP 1998: 556-567 |
| 26 | | Srinivasa Rao Arikati,
Shiva Chaudhuri,
Christos D. Zaroliagis:
All-Pairs Min-Cut in Sparse Networks.
J. Algorithms 29(1): 82-110 (1998) |
| 25 | | Gerth Stølting Brodal,
Jesper Larsson Träff,
Christos D. Zaroliagis:
A Parallel Priority Queue with Constant Time Operations.
J. Parallel Distrib. Comput. 49(1): 4-21 (1998) |
| 24 | EE | Shiva Chaudhuri,
Christos D. Zaroliagis:
Shortest Paths in Digraphs of Small Treewdith. Part II: Optimal Parallel Algorithms.
Theor. Comput. Sci. 203(2): 205-223 (1998) |
| 1997 |
|---|
| 23 | EE | Gerth Stølting Brodal,
Jesper Larsson Träff,
Christos D. Zaroliagis:
A Parallel Priority Data Structure with Applications.
IPPS 1997: 689-693 |
| 22 | EE | Srinivasa Rao Arikati,
Anil Maheshwari,
Christos D. Zaroliagis:
Efficient Computation of Implicit Representations of Sparse Graphs.
Discrete Applied Mathematics 78(1-3): 1-16 (1997) |
| 21 | | Christos D. Zaroliagis:
Simple and Work-Efficient Parallel Algorithms for the Minimum Spanning Tree Problem.
Parallel Processing Letters 7(1): 25-37 (1997) |
| 1996 |
|---|
| 20 | | Srinivasa Rao Arikati,
Danny Z. Chen,
L. Paul Chew,
Gautam Das,
Michiel H. M. Smid,
Christos D. Zaroliagis:
Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane.
ESA 1996: 514-528 |
| 19 | | Jesper Larsson Träff,
Christos D. Zaroliagis:
A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs.
IRREGULAR 1996: 183-194 |
| 18 | EE | Dimitris J. Kavvadias,
Grammati E. Pantziou,
Paul G. Spirakis,
Christos D. Zaroliagis:
Hammock-on-Ears Decomposition: A Technique for the Efficient Parallel Solution of Shortest Paths and Other Problems.
Theor. Comput. Sci. 168(1): 121-154 (1996) |
| 1995 |
|---|
| 17 | | Shiva Chaudhuri,
Christos D. Zaroliagis:
Optimal Parallel Shortest Paths in Small Treewidth Digraphs.
ESA 1995: 31-45 |
| 16 | | Hristo Djidjev,
Grammati E. Pantziou,
Christos D. Zaroliagis:
Fast Algorithms for Maintaining Shortest Paths in Outerplanar and Planar Digraphs.
FCT 1995: 191-200 |
| 15 | | Srinivasa Rao Arikati,
Shiva Chaudhuri,
Christos D. Zaroliagis:
All-Pairs Min-Cut in Sparse Networks.
FSTTCS 1995: 363-376 |
| 14 | EE | Dimitrios Kagaris,
Spyros Tragoudas,
Grammati E. Pantziou,
Christos D. Zaroliagis:
Quickest paths: parallelization and dynamization .
HICSS (2) 1995: 39-40 |
| 13 | | Shiva Chaudhuri,
Christos D. Zaroliagis:
Shortest Path Queries in Digraphs of Small Treewidth.
ICALP 1995: 244-255 |
| 12 | | Hristo Djidjev,
Grammati E. Pantziou,
Christos D. Zaroliagis:
On-line and Dynamic Algorithms for Shorted Path Problems.
STACS 1995: 193-204 |
| 11 | | Dimitrios Kagaris,
Spyros Tragoudas,
Grammati E. Pantziou,
Christos D. Zaroliagis:
On the Computation of Fast Data Transmissions in Networks with Capacities and Delays.
WADS 1995: 291-302 |
| 10 | EE | Devdatt P. Dubhashi,
Grammati E. Pantziou,
Paul G. Spirakis,
Christos D. Zaroliagis:
The Fourth Moment in Luby's Distribution.
Theor. Comput. Sci. 148(1): 133-140 (1995) |
| 1994 |
|---|
| 9 | | Srinivasa Rao Arikati,
Anil Maheshwari,
Christos D. Zaroliagis:
Saving Bits Made Easy.
CCCG 1994: 140-146 |
| 8 | | Dimitris J. Kavvadias,
Grammati E. Pantziou,
Paul G. Spirakis,
Christos D. Zaroliagis:
Efficient Sequential and Parallel Algorithms for the Negative Cycle Problem.
ISAAC 1994: 270-278 |
| 7 | | Dimitris J. Kavvadias,
Grammati E. Pantziou,
Paul G. Spirakis,
Christos D. Zaroliagis:
Hammock-on-Ears Decomposition: A Technique for the Efficient Parallel Solution of Shortest Paths and Other Problems.
MFCS 1994: 462-472 |
| 1992 |
|---|
| 6 | | Grammati E. Pantziou,
Paul G. Spirakis,
Christos D. Zaroliagis:
Efficient Parallel Algorithms for Shortest Paths in Planar Digraphs.
BIT 32(2): 215-236 (1992) |
| 1991 |
|---|
| 5 | | Hristo Djidjev,
Grammati E. Pantziou,
Christos D. Zaroliagis:
Computing Shortest Paths and Distances in Planar Graphs.
ICALP 1991: 327-338 |
| 4 | | Zvi M. Kedem,
Krishna V. Palem,
Grammati E. Pantziou,
Paul G. Spirakis,
Christos D. Zaroliagis:
Fast Parallel Algorithms for Coloring Random Graphs.
WG 1991: 135-147 |
| 1990 |
|---|
| 3 | | Grammati E. Pantziou,
Paul G. Spirakis,
Christos D. Zaroliagis:
Efficient Parallel Algorithms for Shortest Paths in Planar Graphs.
SWAT 1990: 288-300 |
| 2 | | Grammati E. Pantziou,
Paul G. Spirakis,
Christos D. Zaroliagis:
Optimal Parallel Algorithms for Sparse Graphs.
WG 1990: 1-17 |
| 1989 |
|---|
| 1 | | Grammati E. Pantziou,
Paul G. Spirakis,
Christos D. Zaroliagis:
Fast Parallel Approximations of hte Maximum Weighted Cut Problem through Derandomization.
FSTTCS 1989: 20-29 |
