Christos D. Zaroliagis - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Robust Line Planning in Case of Multiple Pools and DisruptionsApostolos Bessas, Spyros C. Kontogiannis, Christos D. Zaroliagis. tapas 2011: 33-44 [doi]

2010

2009

Robust and Online Large-Scale Optimization: Models and Techniques for Transportation SystemsRavindra K. Ahuja, Rolf H. MÃ¶hring, Christos D. Zaroliagis, editors, Volume 5868 of Lecture Notes in Computer Science, Springer, 2009. [doi]

On Assessing Robustness in Transportation PlanningApostolos Bessas, Christos D. Zaroliagis. atmos 2009: [doi]

Incentive-Compatible Robust Line PlanningApostolos Bessas, Spyros C. Kontogiannis, Christos D. Zaroliagis. In Ravindra K. Ahuja, Rolf H. MÃ¶hring, Christos D. Zaroliagis, editors, Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems. Volume 5868 of Lecture Notes in Computer Science, pages 85-118, Springer, 2009. [doi]

Efficient Route Planning in Flight NetworksDaniel Delling, Thomas Pajor, Dorothea Wagner, Christos D. Zaroliagis. atmos 2009: [doi]

Engineering planar separator algorithmsMartin Holzer, Frank Schulz, Dorothea Wagner, Grigorios Prasinos, Christos D. Zaroliagis. jea, 14, 2009. [doi]

Secure Elliptic Curve generation and key establishment on a 802.11 WLAN embedded devicePanagiotis Papaioannou, Panagiotis E. Nastou, Yannis C. Stamatiou, Christos D. Zaroliagis. isads 2009: 41-48 [doi]

Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-Linear Objectives with ApplicationsGeorge Tsaggouris, Christos D. Zaroliagis. mst, 45(1):162-186, 2009. [doi]

2008

Distributed simulation of heterogeneous systems of small programmable objects and traditional processorsIoannis Chatzigiannakis, Christos Koninis, Grigorios Prasinos, Christos D. Zaroliagis. mobiwac 2008: 133-140 [doi]

TRAILS, a Toolkit for Efficient, Realistic and Evolving Models of Mobility, Faults and Obstacles in Wireless NetworksIoannis Chatzigiannakis, Athanasios Kinalis, Georgios Mylonas, Sotiris E. Nikoletseas, Grigorios Prasinos, Christos D. Zaroliagis. anss 2008: 23-32 [doi]

Robust Line Planning under Unknown Incentives and Elasticity of FrequenciesSpyros C. Kontogiannis, Christos D. Zaroliagis. patmos 2008: [doi]

An experimental study of algorithms for fully dynamic transitive closureIoannis Krommidas, Christos D. Zaroliagis. jea, 12, 2008. [doi]

Enabling Social Navigation on the WebAthanasios Papagelis, Manos Papagelis, Christos D. Zaroliagis. webist 2008: 162-168 [doi]

Iclone: towards online social navigationAthanasios Papagelis, Manos Papagelis, Christos D. Zaroliagis. ht 2008: 237-238 [doi]

2007

2006

Routing protocols for efficient communication in wireless ad-hoc networksIoannis Chatzigiannakis, Panagiotis C. Kokkinos, Christos D. Zaroliagis. pe-wasun 2006: 90-97 [doi]

Dynamic Interpolation Search RevisitedAlexis C. Kaporis, Christos Makris, Spyros Sioutas, Athanasios K. Tsakalidis, Kostas Tsichlas, Christos D. Zaroliagis. icalp 2006: 382-394 [doi]

Topic 12: Theory and Algorithms for Parallel ComputationDanny Krizanc, Michael Kaufmann, Pierre Fraigniaud, Christos D. Zaroliagis. europar 2006: 799 [doi]

On the Implementation of Parallel Shortest Path Algorithms on a SupercomputerGabriele Di Stefano, Alberto Petricola, Christos D. Zaroliagis. ispa 2006: 406-417 [doi]

Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with ApplicationsGeorge Tsaggouris, Christos D. Zaroliagis. isaac 2006: 389-398 [doi]

QoS-aware Multicommodity Flows and Transportation PlanningGeorge Tsaggouris, Christos D. Zaroliagis. patmos 2006: [doi]

2005

Engineering Planar Separator AlgorithmsMartin Holzer, Grigorios Prasinos, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis. esa 2005: 628-639 [doi]

ISB-Tree: A New Indexing Scheme with Efficient Expected BehaviourAlexis C. Kaporis, Christos Makris, George Mavritsakis, Spyros Sioutas, Athanasios K. Tsakalidis, Kostas Tsichlas, Christos D. Zaroliagis. isaac 2005: 318-327 [doi]

An Experimental Study of Algorithms for Fully Dynamic Transitive ClosureIoannis Krommidas, Christos D. Zaroliagis. esa 2005: 544-555 [doi]

Searching the Web Through User Information SpacesAthanasios Papagelis, Christos D. Zaroliagis. wise 2005: 611-612 [doi]

Topic 12 Theory and Algorithms for Parallel ComputationAndrea Pietracaprina, Kieran T. Herley, Christos D. Zaroliagis, Casiano Rodriguez-Leon. europar 2005: 929 [doi]

Geometric containers for efficient shortest-path computationDorothea Wagner, Thomas Willhalm, Christos D. Zaroliagis. jea, 10, 2005. [doi]

Recent Advances in Multiobjective OptimizationChristos D. Zaroliagis. saga 2005: 45-47 [doi]

2004

DAP: A Generic Platform for the Simulation of Distributed AlgorithmsIoannis Chatzigiannakis, Athanasios Kinalis, Athanassios S. Poulakidas, Grigorios Prasinos, Christos D. Zaroliagis. anss 2004: 167-177 [doi]

The Railway Traveling Salesman ProblemGeorgia Hadjicharalambous, Petrica C. Pop, Evangelia Pyrga, George Tsaggouris, Christos D. Zaroliagis. patmos 2007: 264-275 [doi]

On the Use of Weber Polynomials in Elliptic Curve CryptographyElisavet Konstantinou, Yannis C. Stamatiou, Christos D. Zaroliagis. europki 2004: 335-349 [doi]

Generating Prime Order Elliptic Curves: Difficulties and Efficiency ConsiderationsElisavet Konstantinou, Aristides Kontogeorgis, Yannis C. Stamatiou, Christos D. Zaroliagis. icisc 2005: 261-278 [doi]

Timetable Information: Models and AlgorithmsMatthias Müller-Hannemann, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis. patmos 2007: 67-90 [doi]

Experimental Comparison of Shortest Path Approaches for Timetable InformationEvangelia Pyrga, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis. alenex 2004: 88-99

Towards Realistic Modeling of Time-Table Information through the Time-Dependent ApproachEvangelia Pyrga, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis. ENTCS, 92:85-103, 2004. [doi]

Non-additive Shortest PathsGeorge Tsaggouris, Christos D. Zaroliagis. esa 2004: 822-834 [doi]

Dynamic Shortest Paths ContainersDorothea Wagner, Thomas Willhalm, Christos D. Zaroliagis. ENTCS, 92:65-84, 2004. [doi]

2003

2002

On the Efficient Generation of Elliptic Curves over Prime FieldsElisavet Konstantinou, Yannis C. Stamatiou, Christos D. Zaroliagis. ches 2003: 333-348 [doi]

A Software Library for Elliptic Curve CryptographyElisavet Konstantinou, Yannis C. Stamatiou, Christos D. Zaroliagis. esa 2002: 625-636 [doi]

Using Multi-level Graphs for Timetable Information in Railway SystemsFrank Schulz, Dorothea Wagner, Christos D. Zaroliagis. alenex 2002: 43-59 [doi]

2001

2000

Computing Mimicking NetworksShiva Chaudhuri, K. V. Subrahmanyam, Frank Wagner, Christos D. Zaroliagis. algorithmica, 26(1):31-49, 2000. [doi]

Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential AlgorithmsShiva Chaudhuri, Christos D. Zaroliagis. algorithmica, 27(3):212-226, 2000. [doi]

Improved Algorithms for Dynamic Shortest PathsHristo Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis. algorithmica, 28(4):367-389, 2000. [doi]

Distributed Algorithm EngineeringPaul G. Spirakis, Christos D. Zaroliagis. dagstuhl 2002: 197-228 [doi]

A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar DigraphsJesper Larsson Träff, Christos D. Zaroliagis. jpdc, 60(9):1103-1124, 2000. [doi]

Implementations and Experimental Studies of Dynamic Graph AlgorithmsChristos D. Zaroliagis. dagstuhl 2002: 229-278 [doi]

1999

Transmissions in a network with capacities and delaysDimitrios Kagaris, Grammati E. Pantziou, Spyros Tragoudas, Christos D. Zaroliagis. networks, 33(3):167-174, 1999. [doi]

Algorithm Engineering, 3rd International Workshop, WAE 99, London, UK, July 19-21, 1999, ProceedingsJeffrey Scott Vitter, Christos D. Zaroliagis, editors, Volume 1668 of Lecture Notes in Computer Science, Springer, 1999.

1998

1997

Efficient Computation of Implicit Representations of Sparse GraphsSrinivasa Rao Arikati, Anil Maheshwari, Christos D. Zaroliagis. DAM, 78(1-3):1-16, 1997. [doi]

A Parallel Priority Data Structure with ApplicationsGerth Stølting Brodal, Jesper Larsson Träff, Christos D. Zaroliagis. ipps 1997: 689-693 [doi]

Simple and Work-Efficient Parallel Algorithms for the Minimum Spanning Tree ProblemChristos D. Zaroliagis. ppl, 7(1):25-37, 1997.

1996

1995

All-Pairs Min-Cut in Sparse NetworksSrinivasa Rao Arikati, Shiva Chaudhuri, Christos D. Zaroliagis. fsttcs 1995: 363-376

Shortest Path Queries in Digraphs of Small TreewidthShiva Chaudhuri, Christos D. Zaroliagis. icalp 1995: 244-255

Optimal Parallel Shortest Paths in Small Treewidth DigraphsShiva Chaudhuri, Christos D. Zaroliagis. esa 1995: 31-45

Fast Algorithms for Maintaining Shortest Paths in Outerplanar and Planar DigraphsHristo Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis. fct 1995: 191-200

On-line and Dynamic Algorithms for Shorted Path ProblemsHristo Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis. STACS 1995: 193-204

The Fourth Moment in Luby s DistributionDevdatt P. Dubhashi, Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis. TCS, 148(1):133-140, 1995. [doi]

Quickest paths: parallelization and dynamization Dimitrios Kagaris, Spyros Tragoudas, Grammati E. Pantziou, Christos D. Zaroliagis. hicss 1995: 39-40 [doi]

On the Computation of Fast Data Transmissions in Networks with Capacities and DelaysDimitrios Kagaris, Spyros Tragoudas, Grammati E. Pantziou, Christos D. Zaroliagis. wads 1995: 291-302

1994

Saving Bits Made EasySrinivasa Rao Arikati, Anil Maheshwari, Christos D. Zaroliagis. cccg 1994: 140-146

Efficient Sequential and Parallel Algorithms for the Negative Cycle ProblemDimitris J. Kavvadias, Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis. isaac 1994: 270-278

Hammock-on-Ears Decomposition: A Technique for the Efficient Parallel Solution of Shortest Paths and Other ProblemsDimitris J. Kavvadias, Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis. mfcs 1994: 462-472

1992

Efficient Parallel Algorithms for Shortest Paths in Planar DigraphsGrammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis. bit, 32(2):215-236, 1992.

1991

Computing Shortest Paths and Distances in Planar GraphsHristo Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis. icalp 1991: 327-338

Fast Parallel Algorithms for Coloring Random GraphsZvi M. Kedem, Krishna V. Palem, Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis. criwg 1992: 135-147

1990

Efficient Parallel Algorithms for Shortest Paths in Planar GraphsGrammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis. swat 1990: 288-300

Optimal Parallel Algorithms for Sparse GraphsGrammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis. criwg 1991: 1-17

1989

Fast Parallel Approximations of hte Maximum Weighted Cut Problem through DerandomizationGrammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis. fsttcs 1989: 20-29