Christos D. Zaroliagis

According to our database1, Christos D. Zaroliagis authored at least 115 papers between 1986 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Efficient Distributed Range Query Processing in Apache Spark.
Proceedings of the 19th IEEE/ACM International Symposium on Cluster, 2019

2018
ICALP 2019 - First Call for Papers.
Bulletin of the EATCS, 2018

Multimodal Dynamic Journey Planning.
Proceedings of the 2018 IEEE Symposium on Computers and Communications, 2018

Renewable Mobility in Smart Cities: Cloud-Based Services.
Proceedings of the 2018 IEEE Symposium on Computers and Communications, 2018

2017
Dynamic timetable information in smart cities.
Proceedings of the 2017 IEEE Symposium on Computers and Communications, 2017

Multimodal route and tour planning in urban environments.
Proceedings of the 2017 IEEE Symposium on Computers and Communications, 2017

Eco-aware vehicle routing in urban environments.
Proceedings of the 2017 IEEE Symposium on Computers and Communications, 2017

Improved Oracles for Time-Dependent Road Networks.
Proceedings of the 17th Workshop on Algorithmic Approaches for Transportation Modelling, 2017

2016
Negative Cycles in Weighted Digraphs.
Encyclopedia of Algorithms, 2016

LEDA: a Library of Efficient Algorithms.
Encyclopedia of Algorithms, 2016

Engineering Algorithms for Large Network Applications.
Encyclopedia of Algorithms, 2016

Mobile Augmented Reality Guides in Cultural Heritage.
Proceedings of the 8th EAI International Conference on Mobile Computing, 2016

Scenic Athens: A personalized scenic route planner for tourists.
Proceedings of the IEEE Symposium on Computers and Communication, 2016

Hierarchical Time-Dependent Oracles.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

Mobile User Experience in Augmented Reality vs. Maps Interfaces: A Case Study in Public Transportation.
Proceedings of the Augmented Reality, Virtual Reality, and Computer Graphics, 2016

A Cloud-Based Time-Dependent Routing Service.
Proceedings of the Algorithmic Aspects of Cloud Computing - Second International Workshop, 2016

Engineering Oracles for Time-Dependent Road Networks.
Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, 2016

2015
The eCOMPASS multimodal tourist tour planner.
Expert Syst. Appl., 2015

D3-Tree: A Dynamic Deterministic Decentralized Structure.
Proceedings of the Algorithms - ESA 2015, 2015

Simple Parallel Algorithms for Dynamic Range Products.
Proceedings of the Algorithms, Probability, Networks, and Games, 2015

An Optimal Parallel Algorithm for Minimum Spanning Trees in Planar Graphs.
Proceedings of the Algorithms, Probability, Networks, and Games, 2015

A Glimpse at Paul G. Spirakis.
Proceedings of the Algorithms, Probability, Networks, and Games, 2015

ART ^+ + : A Fault-Tolerant Decentralized Tree Structure with Ultimate Sub-logarithmic Efficiency.
Proceedings of the Algorithmic Aspects of Cloud Computing - First International Workshop, 2015

Analysis and Experimental Evaluation of Time-Dependent Distance Oracles.
Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, 2015

2014
A personalized multimodal tourist tour planner.
Proceedings of the 13th International Conference on Mobile and Ubiquitous Multimedia, 2014

Distance Oracles for Time-Dependent Networks.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Engineering Graph-Based Models for Dynamic Timetable Information Systems.
Proceedings of the 14th Workshop on Algorithmic Approaches for Transportation Modelling, 2014

2013
A New Dynamic Graph Structure for Large-Scale Transportation Networks.
Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

Improved Alternative Route Planning.
Proceedings of the 13th Workshop on Algorithmic Approaches for Transportation Modelling, 2013

2012
A Collaborative Decentralized Approach to Web Search.
IEEE Trans. Systems, Man, and Cybernetics, Part A, 2012

Topic 12: Theory and Algorithms for Parallel Computation.
Proceedings of the Euro-Par 2012 Parallel Processing - 18th International Conference, 2012

2011
Robust Line Planning in Case of Multiple Pools and Disruptions.
Proceedings of the Theory and Practice of Algorithms in (Computer) Systems, 2011

2010
On the Efficient Generation of Prime-Order Elliptic Curves.
J. Cryptology, 2010

D2-Tree: A New Overlay with Deterministic Bounds.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

2009
Incentive-Compatible Robust Line Planning.
Proceedings of the Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems, 2009

Engineering planar separator algorithms.
ACM Journal of Experimental Algorithmics, 2009

Secure Elliptic Curve generation and key establishment on a 802.11 WLAN embedded device.
Proceedings of the International Symposium on Autonomous Decentralized Systems (ISADS 2009), 2009

Efficient Route Planning in Flight Networks.
Proceedings of the ATMOS 2009, 2009

On Assessing Robustness in Transportation Planning.
Proceedings of the ATMOS 2009, 2009

2008
Negative Cycles in Weighted Digraphs.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

LEDA: a Library of Efficient Algorithms.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Engineering Algorithms for Large Network Applications.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Enabling Social Navigation on the Web.
Proceedings of the 2008 IEEE / WIC / ACM International Conference on Web Intelligence, 2008

Distributed simulation of heterogeneous systems of small programmable objects and traditional processors.
Proceedings of the Sixth ACM International Workshop on Mobility Management & Wireless Access, 2008

Iclone: towards online social navigation.
Proceedings of the HYPERTEXT 2008, 2008

Robust Line Planning under Unknown Incentives and Elasticity of Frequencies.
Proceedings of the ATMOS 2008, 2008

TRAILS, a Toolkit for Efficient, Realistic and Evolving Models of Mobility, Faults and Obstacles in Wireless Networks.
Proceedings of the Proceedings 41st Annual Simulation Symposium (ANSS-41 2008), 2008

2007
Efficient models for timetable information in public transportation systems.
ACM Journal of Experimental Algorithmics, 2007

Efficient generation of secure elliptic curves.
Int. J. Inf. Sec., 2007

Searchius: A Collaborative Search Engine.
Proceedings of the Eight Mexican International Conference in Current Trends in Computer Science, 2007

2006
Routing protocols for efficient communication in wireless ad-hoc networks.
Proceedings of the 3rd ACM International Workshop on Performance Evaluation of Wireless Ad Hoc, 2006

On the Implementation of Parallel Shortest Path Algorithms on a Supercomputer.
Proceedings of the Parallel and Distributed Processing and Applications, 2006

Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

Dynamic Interpolation Search Revisited.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Topic 12: Theory and Algorithms for Parallel Computation.
Proceedings of the Euro-Par 2006, Parallel Processing, 12th International Euro-Par Conference, Dresden, Germany, August 28, 2006

QoS-aware Multicommodity Flows and Transportation Planning.
Proceedings of the ATMOS 2006, 2006

2005
Geometric containers for efficient shortest-path computation.
ACM Journal of Experimental Algorithmics, 2005

Searching the Web Through User Information Spaces.
Proceedings of the Web Information Systems Engineering, 2005

Recent Advances in Multiobjective Optimization.
Proceedings of the Stochastic Algorithms: Foundations and Applications, 2005

ISB-Tree: A New Indexing Scheme with Efficient Expected Behaviour.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Topic 12 Theory and Algorithms for Parallel Computation.
Proceedings of the Euro-Par 2005, Parallel Processing, 11th International Euro-Par Conference, Lisbon, Portugal, August 30, 2005

An Experimental Study of Algorithms for Fully Dynamic Transitive Closure.
Proceedings of the Algorithms, 2005

Engineering Planar Separator Algorithms.
Proceedings of the Algorithms, 2005

2004
Dynamic Shortest Paths Containers.
Electr. Notes Theor. Comput. Sci., 2004

Towards Realistic Modeling of Time-Table Information through the Time-Dependent Approach.
Electr. Notes Theor. Comput. Sci., 2004

Generating Prime Order Elliptic Curves: Difficulties and Efficiency Considerations.
Proceedings of the Information Security and Cryptology, 2004

On the Use of Weber Polynomials in Elliptic Curve Cryptography.
Proceedings of the Public Key Infrastructure, 2004

Non-additive Shortest Paths.
Proceedings of the Algorithms, 2004

04261 Abstracts Collection - Algorithmic Methods for Railway Optimization.
Proceedings of the Algorithmic Methods for Railway Optimization, 20.06. - 25.06.2004, 2004

Timetable Information: Models and Algorithms.
Proceedings of the Algorithmic Methods for Railway Optimization, 2004

The Railway Traveling Salesman Problem.
Proceedings of the Algorithmic Methods for Railway Optimization, 2004

DAP: A Generic Platform for the Simulation of Distributed Algorithms.
Proceedings of the Proceedings 37th Annual Simulation Symposium (ANSS-37 2004), 2004

Experimental Comparison of Shortest Path Approaches for Timetable Information.
Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, 2004

2003
On the Construction of Prime Order Elliptic Curves.
Proceedings of the Progress in Cryptology, 2003

Improved Bounds for Finger Search on a RAM.
Proceedings of the Algorithms, 2003

2002
A Software Library for Elliptic Curve Cryptography.
Proceedings of the Algorithms, 2002

On the Efficient Generation of Elliptic Curves over Prime Fields.
Proceedings of the Cryptographic Hardware and Embedded Systems, 2002

Using Multi-level Graphs for Timetable Information in Railway Systems.
Proceedings of the Algorithm Engineering and Experiments, 4th International Workshop, 2002

2001
An Experimental Study of Dynamic Algorithms for Transitive Closure.
ACM Journal of Experimental Algorithmics, 2001

Introduction - Algorithmic MeThods and Models for Optimization of RailwayS - ATMOS 2001.
Electr. Notes Theor. Comput. Sci., 2001

An Experimental Study of Basic Communication Protocols in Ad-hoc Mobile Networks.
Proceedings of the Algorithm Engineering, 2001

Attack propagation in networks.
Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

2000
Improved Algorithms for Dynamic Shortest Paths.
Algorithmica, 2000

Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms.
Algorithmica, 2000

Implementations and Experimental Studies of Dynamic Graph Algorithms.
Proceedings of the Experimental Algorithmics, 2000

Distributed Algorithm Engineering.
Proceedings of the Experimental Algorithmics, 2000

1999
Transmissions in a network with capacities and delays.
Networks, 1999

1998
Shortest Paths in Digraphs of Small Treewdith. Part II: Optimal Parallel Algorithms.
Theor. Comput. Sci., 1998

A Parallel Priority Queue with Constant Time Operations.
J. Parallel Distrib. Comput., 1998

Computing Mimicking Networks.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

An Experimental Study of Dynamic Algorithms for Directed Graphs.
Proceedings of the Algorithms, 1998

1997
Simple and Work-Efficient Parallel Algorithms for the Minimum Spanning Tree Problem.
Parallel Processing Letters, 1997

Efficient Computation of Implicit Representations of Sparse Graphs.
Discrete Applied Mathematics, 1997

A Parallel Priority Data Structure with Applications.
Proceedings of the 11th International Parallel Processing Symposium (IPPS '97), 1997

1996
On the Parallel Complexity of Acyclic Logic Programs.
Parallel Processing Letters, 1996

A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs.
Proceedings of the Parallel Algorithms for Irregularly Structured Problems, 1996

Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane.
Proceedings of the Algorithms, 1996

1995
The Fourth Moment in Luby's Distribution.
Theor. Comput. Sci., 1995

On the Computation of Fast Data Transmissions in Networks with Capacities and Delays.
Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

On-line and Dynamic Algorithms for Shorted Path Problems.
Proceedings of the STACS 95, 1995

Shortest Path Queries in Digraphs of Small Treewidth.
Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

Quickest paths: parallelization and dynamization .
Proceedings of the 28th Annual Hawaii International Conference on System Sciences (HICSS-28), 1995

All-Pairs Min-Cut in Sparse Networks.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1995

Fast Algorithms for Maintaining Shortest Paths in Outerplanar and Planar Digraphs.
Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995

Optimal Parallel Shortest Paths in Small Treewidth Digraphs.
Proceedings of the Algorithms, 1995

1994
Hammock-on-Ears Decomposition: A Technique for the Efficient Parallel Solution of Shortest Paths and Other Problems.
Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

Efficient Sequential and Parallel Algorithms for the Negative Cycle Problem.
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

Saving Bits Made Easy.
Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1992
Efficient Parallel Algorithms for Shortest Paths in Planar Digraphs.
BIT, 1992

1991
Fast Parallel Algorithms for Coloring Random Graphs.
Proceedings of the 17th International Workshop, 1991

Computing Shortest Paths and Distances in Planar Graphs.
Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

1990
Optimal Parallel Algorithms for Sparse Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1990

Efficient Parallel Algorithms for Shortest Paths in Planar Graphs.
Proceedings of the SWAT 90, 1990

1989
Fast Parallel Approximations of hte Maximum Weighted Cut Problem through Derandomization.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1989

1986
The GRASPIN DB - A Syntax Directed, Language Independent Software Engineering Database.
Proceedings of the 1986 International Workshop on Object-Oriented Database Systems, 1986


  Loading...