© Copyright Notice: The documents available from this site are provided as a means to ensure timely dissemination of technical work on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder (Springer-Verlag, ACM, IEEE, Elsevier, Academic Press, etc.). Permission to make digital or hard copies of part or all of these works for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage. The electronic version of some of the works available from this site may differ from the definitive published version.

---

Books & Volumes             Journals & Chapters             Conferences             Other

---

Books & Volumes

• R. Ahuja, R. Moehring, and C. Zaroliagis "Robust and Online Large-Scale Optimization", Springer, 2009.

• C. Zaroliagis, scientific redaction of the Greek edition of the book "Algorithm Design" by Jon Kleinberg and Éva Tardos, Klidarithmos, 2008.

• F. Geraets, L. Kroon, A. Schoebel, D. Wagner, and C. Zaroliagis "Algorithmic Methods for Railway Optimization" Springer-Verlag, 2007.

• J.S. Vitter and C. Zaroliagis, "Algorithm Engineering" Springer-Verlag, 1999.



---

Journals & Chapters

[J32] A. Kaporis, C. Makris, S. Sioutas, A. Tsakalidis, K. Tsichlas, and C. Zaroliagis, "Improved Bounds for Finger Search on a RAM",
Algorithmica, to appear .

[J31] E. Konstantinou, A. Kontogeorgis, Y. Stamatiou, and C. Zaroliagis, ''On the Efficient Generation of Prime Order Elliptic Curves"
Journal of Cryptology, to appear.

[J30] A. Bessas, S. Kontogiannis, and C. Zaroliagis, ''Incentive-Compatible Robust line Planning"
In Robust and Online Large-Scale Optimization, Chapter 4, Springer 2009, pp. 85-118.

[J29] M. Holzer, G. Prasinos, F. Schulz, D. Wagner, and C. Zaroliagis, ''Engineering Planar Separator Algorithms",
ACM Journal of Experimental Algorithmics, Vol.14 (2009), No. 1.5, pp.1-31.

[J28] G. Tsaggouris and C. Zaroliagis, ''Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications",
Theory of Computing Systems, Vol.45 (2009), No. 1, pp.162-186.

[J27] E. Pyrga, F. Schulz, D. Wagner, and C. Zaroliagis, ''Efficient Models for Timetable Information in Public Transportation Systems",
ACM Journal of Experimental Algorithmics, Vol.12 (2008), No. 2.4, pp.1-39.

[J26] I. Krommudas and C. Zaroliagis, ''An Experimental Study of Algorithms for Fully Dynamic Transitive Closure",
ACM Journal of Experimental Algorithmics, Vol.12 (2008), No. 1.6, pp.1-22.

[J25] P.C. Pop, C. Zaroliagis, and G. Hadjicharalambous, "A Cutting Plane Approach to Solve the Railway Traveling Salesman Problem",
Studia Universitatis Mathematica, Vol.53 (2008), No. 1, pp. 63-73.

[J24] E. Konstantinou, Y. Stamatiou, and C. Zaroliagis, "Efficient Generation of Secure Elliptic Curves"
International Journal of Information Security Vol.6 (2007), No.1, pp.47-63.

[J23] M. Mueller-Hannemann, F. Schulz, D. Wagner, and C. Zaroliagis, "Timetable Information: Models and Algorithms''
Chapter 3, in Algorithmic Methods for Railway Optimization, Springer-Verlag 2007, pp.67-90.

[J22] D. Wagner, T. Willhalm, and C. Zaroliagis, ''Geometric Containers for Efficient Shortest Path Computation",
ACM Journal of Experimental Algorithmics, Vol.10 (2005), No.1.3, pp.1-30.

[J21] S. Nikoletseas, G. Prasinos, P. Spirakis, and C. Zaroliagis, ''Attack Propagation in Networks",
Theory of Computing Systems, Vol.36 (2003), pp.533-574.

[J20] D. Kalles, A. Papagelis, and C. Zaroliagis, ''Algorithmic Aspects of Web Intelligent Systems",
Chapter 15, in Web Intelligence, Springer-Verlag, 2003, pp.323-344.

[J19] P. Spirakis and C. Zaroliagis, ''Distributed Algorithm Engineering",
Chapter 10, in Experimental Algorithmics -- From Algorithm Design to Robust and Efficient Software, Springer-Verlag, 2002, pp.197-228.

[J18] C. Zaroliagis, ''Implementations and Experimental Studies of Dynamic Graph Algorithms",
Chapter 11, in Experimental Algorithmics -- From Algorithm Design to Robust and Efficient Software, Springer-Verlag, 2002, pp.229-278.

[J17] D. Frigioni, T. Miller, U. Nanni, and C. Zaroliagis, ''An Experimental Study of Dynamic Algorithms for Transitive Closure",
ACM Journal of Experimental Algorithmics Vol.6 (2001), No. 9, pp.1-42.

[J16] J.L. Traeff and C. Zaroliagis, "A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs",
Journal of Parallel and Distributed Computing Vol.60 (2000), No.9, pp.1103-1124.

[J15] H. Djidjev, G. Pantziou, and C. Zaroliagis, ''Improved Algorithms for Dynamic Shortest Paths",
Algorithmica Vol.28 (2000), No.4, pp.367-389, Special Issue on Graph Algorithms and Applications.

[J14] S. Chaudhuri, K.V. Subrahmanyam, F. Wagner, and C. Zaroliagis, ''Computing Mimicking Networks",
Algorithmica Vol.26 (2000), No.1, pp. 31-49.

[J13] S. Chaudhuri and C. Zaroliagis, ''Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms",
Algorithmica Vol.27 (2000), No.3, pp.212-226, Special Issue on Treewidth.

[J12] D. Kagaris, G. Pantziou, S. Tragoudas, and C. Zaroliagis, "Transmissions in a Network with Capacities and Delays",
Networks Vol.33 (1999), No.3, pp.167-174.

[J11] S. Arikati, S. Chaudhuri, and C. Zaroliagis, "All-Pairs Min-Cut in Sparse Networks",
Journal of Algorithms Vol.29 (1998), No.1, pp.82-110.

[J10] S. Chaudhuri and C. Zaroliagis, "Shortest Paths in Digraphs of Small Treewidth. Part II: Optimal Parallel Algorithms",
Theoretical Computer Science, Vol.203 (1998), No.2, pp.205-223.

[J9] G.S. Brodal, J.L. Traeff, and C. Zaroliagis, "A Parallel Priority Queue with Constant Time Operations",
Journal of Parallel and Distributed Computing, Vol.49 (1998), No.1, pp.4-21, Special Issue on Parallel and Distributed Data Structures.

[J8] C. Zaroliagis, "Simple and Work-Efficient Parallel Algorithms for the Minimum Spanning Tree Problem",
Parallel Processing Letters, Vol.7 (1997), No.1, pp.25-37.

[J7] S. Arikati, A. Maheshwari, and C. Zaroliagis, "Efficient Computation of Implicit Representations of Sparse Graphs",
Discrete Applied Mathematics, Vol.78 (1997), pp.1-16.

[J6] S. Chaudhuri, Y. Dimopoulos, and C. Zaroliagis, "On the Parallel Complexity of Acyclic Logic Programs",
Parallel Processing Letters, Vol.6 (1996), No.2, pp.223-230.

[J5] D. Kavvadias, G. Pantziou, P. Spirakis, and C. Zaroliagis,
"Hammock-on-Ears Decomposition: A Technique for the Efficient Parallel Solution of Shortest Paths and Other Problems",
Theoretical Computer Science, Vol.168 (1996), No.1, pp.121-154.

[J4] D. Dubhashi, G. Pantziou, P. Spirakis, and C. Zaroliagis, "The Fourth Moment in Luby's Distribution",
Theoretical Computer Science, Vol.148 (1995), No.1, pp.133-140.

[J3] G. Pantziou, P. Spirakis, and C. Zaroliagis, ''Efficient Parallel Algorithms for Shortest Paths in Planar Digraphs",
BIT, Vol.32 (1992), No.2, pp.215-236.

[J2] D. Christodoulakis, P. Soupos, and C. Zaroliagis, ''The Implementation of a Software Engineering Database using desk-size Computing Resources",
Microprocessing and Microprogramming, Vol.21 (1987), No.1-5, pp.383-390.

[J1] D. Christodoulakis, S. Goutas, P. Soupos, and C. Zaroliagis, ''The GRASPIN DB - A Software Development Environment Database",
ACM Software Engineering Notes, Vol.12 (1987), No.1.



---

Conferences

[C58] D. Delling, T. Pajor, D. Wagner, and C. Zaroliagis, "Efficient Route Planning in Flight Networks"
in Proc. 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems -- ATMOS 2009.

[C57] A. Bessas and C. Zaroliagis, "On Assessing Robustness in Transportation Planning"
in Proc. 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems -- ATMOS 2009.

[C56] P.Papaioannou, P.Nastou, Y.Stamatiou, and C.Zaroliagis, "Secure Elliptic Curve Generation and Key Establishment on a 802.11 WLAN Embedded Device",
in Proc. 9th Int'l Symposium on Autonomous Decentralized Systems -- ISADS 2009 (IEEE Computer Science Press, 2009).

[C55] A. Papagelis, M. Papagelis, and C. Zaroliagis, "Enabling Social Navigation on the Web"
in Proc. 2008 IEEE/WIC/ACM Int'l Conference on Web Intelligence -- WI 2008 (IEEE Computer Science Press, 2008), pp. 162-168.

[C54] S. Kontogiannis and C. Zaroliagis, "Robust Line Planning under Unknown Incentives and Elasticity of Frequencies"
in Proc. 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems -- ATMOS 2008.

[C53] I. Chatzigiannakis, C. Koninis, G. Prasinos, and C. Zaroliagis, "Distributed Simulation of Heterogenous Systems of Small Programmable Objects and Traditional Processors",
in Proc. 6th ACM International Workshop on Mobility Management and Wireless Access -- MOBIWAC 2008 (ACM Press, 2008), pp. 133-140.

[C52] A.Papagelis, M. Papagelis, and C. Zaroliagis, "iClone: Towards Online Social Navigation",
in Proc. 19th ACM Conference on Hypertext and Hypermedia -- HT 2008 (ACM Press, 2008), pp.237-238.

[C51] I. Chatzigiannakis, A. Kinalis, G. Mylonas, S. Nikoletseas, G. Prasinos, and C. Zaroliagis,
"TRAILS, a Toolkit for Efficient, Realistic and Evolving Models of Mobility, Faults and Obstacles in Wireless Networks",
in Proc.41st Annual Simulation Symposium -- ANSS 2008 (IEEE Computer Society Press, 2008), pp.23-32.

[C50] A. Papagelis and C. Zaroliagis, "Searchius: A Collaborative Search Engine",
in Proc.8th Int'l Conference on Current Trends in Computer Science -- ENC 2007 (IEEE Compute Science Press, 2007), pp.88-98.

[C49] G. Tsaggouris and C. Zaroliagis, "Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications",
in Algorithms and Computation -- ISAAC 2006, Lecture Notes in Computer Science Vol.4288 (Springer-Verlag, 2006), pp.389-398.

[C48] G. Di Stefano, A. Petricola, and C. Zaroliagis, "On the Implementation of Parallel Shortest Path Algorithms on a Supercomputer",
in Parallel and Distributed Processing and Applications -- ISPA 2006, Lecture Notes in Computer Science Vol.4330 (Springer-Verlag, 2006), pp.406-417.

[C47] I. Chatzigiannakis, P. Kokkinos, and C. Zaroliagis, "Routing Protocols for Efficient Communication in Wireless Ad-hoc Networks",
in Proc. 3rd ACM Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks -- PE-WASUN 2006, pp.90-97.

[C46] G. Tsaggouris and C. Zaroliagis, "QoS-aware Multicommodity Flows and Transportation Planning",
in Proc.6th Workshop on Algorithmic Methods and Models for Optimization of Railways -- ATMOS 2006.

[C45] A. Kaporis, C. Makris, S. Sioutas, A. Tsakalidis, K. Tsichlas, and C. Zaroliagis, "Dynamic Interpolation Search Revisited",
in Automata, Languages and Programming -- ICALP 2006, Lecture Notes in Computer Science Vol.4051, Part I (Springer-Verlag, 2006), pp.382-394.

[C44] A. Kaporis, C. Makris, G. Mavritsakis, S. Sioutas, A. Tsakalidis, K. Tsichlas, and C. Zaroliagis, "ISB-Tree: A New Indexing Scheme with Efficient Expected Behaviour",
in Algorithms and Computation -- ISAAC 2005, Lecture Notes in Computer Science Vol.3827 (Springer-Verlag, 2005), pp.318-327.

[C43] A. Papagelis and C. Zaroliagis, "Searching the Web through User Information Spaces",
in Web Information Systems Engineering -- WISE 2005, Lecture Notes in Computer Science Vol.3806 (Springer-Verlag, 2005), pp.611-612.

[C42] M. Holzer, G. Prasinos, F. Schulz, D. Wagner, and C. Zaroliagis, "Engineering Planar Separator Algorithms",
in Algorithms -- ESA 2005, Lecture Notes in Computer Science Vol.3669 (Springer-Verlag, 2005), pp.628-639.

[C41] I. Krommudas and C. Zaroliagis, "An Experimental Study of Algorithms for Fully Dynamic Transitive Closure",
in Algorithms -- ESA 2005, Lecture Notes in Computer Science Vol.3669 (Springer-Verlag, 2005), pp.544-555.

[C40] G. Hadjicharalambous, P. Pop, E Pyrga, G. Tsaggouris, and C. Zaroliagis, "The Railway Traveling Salesman Problem",
in Algorithmic Methods for Railway Optimization -- Proc. ATMOS 2004, Lecture Notes in Computer Science Vol.4359 (Springer-Verlag, 2007), pp.264-275.

[C39] E. Konstantinou, A. Kontogeorgis, Y. Stamatiou, and C. Zaroliagis, "Generating Prime Order Elliptic Curves: Difficulties and Efficiency Considerations",
in Information Security and Cryptology -- ICISC 2004, Lecture Notes in Computer Science Vol.3506 (Springer-Verlag, 2005), pp.261-278.

[C38] I. Chatzigiannakis, P. Kokkinos, and C. Zaroliagis, "Synthesizing Routing Protocols for Ad-Hoc Mobile Networks",
in Proc.12th IEEE Symp.on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems -- MASCOTS 2004 (IEEE Computer Society Press, 2004), pp.634-637.

[C37] G. Tsaggouris and C. Zaroliagis, "Non-Additive Shortest Paths",
in Algorithms -- ESA 2004, Lecture Notes in Computer Science Vol.3221 (Springer-Verlag, 2004), pp.822-834.

[C36] E. Konstantinou, Y. Stamatiou, and C. Zaroliagis, "On the Use of Weber Polynomials in Elliptic Curve Cryptography",
in Public Key Infrastructure -- EuroPKI 2004, Lecture Notes in Computer Science Vol.3093 (Springer-Verlag, 2004), pp.335-349.

[C35] I. Chatzigiannakis, A. Kinalis, A. Poulakidas, G. Prasinos, and C. Zaroliagis, "DAP: A generic platform for the simulation of distributed algorithms",
in Proc. 37th Annual Simulation Symposium -- ANSS 2004 (IEEE Computer Society Press, 2004), pp.167-177.

[C34] E. Pyrga, F. Schulz, D. Wagner, and C. Zaroliagis, "Experimental Comparison of Shortest Path Approaches for Timetable Information",
in Algorithm Engineering and Experiments -- ALENEX 2004 (SIAM, 2004), pp.88-99.

[C33] E. Konstantinou, Y. Stamatiou, and C. Zaroliagis, "On the Construction of Prime Order Elliptic Curves",
in Progress in Cryptology -- INDOCRYPT 2003, Lecture Notes in Computer Science Vol.2904 (Springer-Verlag, 2003), pp.309-322.

[C32] D. Wagner, T. Willhalm, and C. Zaroliagis, "Dynamic Shortest Path Containers",
in Proc.3rd Workshop on Algorithmic Methods and Models for Optimization of Railways -- ATMOS 2003,
Electronic Notes in Theoretical Computer Science Vol.92 (Elsevier, 2004), pp.65-84.

[C31] E. Pyrga, F. Schulz, D. Wagner, and C. Zaroliagis, "Towards Realistic Modeling of Time-Table Information through the Time-Dependent Approach",
in Proc.3rd Workshop on Algorithmic Methods and Models for Optimization of Railways -- ATMOS 2003,
Electronic Notes in Theoretical Computer Science Vol.92 (Elsevier, 2004), pp.85-103.

[C30] A. Kaporis, C. Makris, S. Sioutas, A. Tsakalidis, K. Tsichlas, and C. Zaroliagis, "Improved Bounds for Finger Search on a RAM",
in Algorithms-- ESA 2003, Lecture Notes in Computer ScienceVol.2832 (Springer-Verlag, 2003), pp.325-336.

[C29] E. Konstantinou, Y. Stamatiou, and C. Zaroliagis, "On the Efficient Generation of Elliptic Curves over Prime Fields",
in Cryptographic Hardware and Embedded Systems -- CHES 2002, Lecture Notes in Computer Science Vol.2523 (Springer-Verlag, 2002), pp.333-348.

[C28] E. Konstantinou, Y. Stamatiou, and C. Zaroliagis, "A Software Library for Elliptic Curve Cryptography",
in Algorithms -- ESA 2002, Lecture Notes in Computer Science Vol. 2461 (Springer-Verlag, 2002), pp.625-637.

[C27] F. Schulz, D. Wagner, and C. Zaroliagis, "Using Multi-Level Graphs for Timetable Information in Railway Systems",
in Algorithm Engineering and Experiments -- ALENEX 2002, Lecture Notes in Computer Science Vol. 2409 (Springer-Verlag, 2002), pp.43-59.

[C26] I.Chatzigiannakis, S.Nikoletseas, N.Paspallis, P.Spirakis, and C.Zaroliagis, "An Experimental Study of Basic Communication Protocols in Ad-Hoc Mobile Networks",
in Algorithm Engineering and Experiments -- WAE 2001, Lecture Notes in Computer Science Vol. 2141 (Springer-Verlag, 2001), pp.159-171.

[C25] S. Nikoletseas, G. Prasinos, P. Spirakis, and C. Zaroliagis, "Attack Propagation in Networks",
in Proc.13th ACM Symposium on Parallel Algorithms and Architectures -- SPAA 2001 (ACM Press, 2001), pp.67-76.

[C24] D. Frigioni, T. Miller, U. Nanni, G. Pasqualone, G. Schafer, and C. Zaroliagis, "An Experimental Study of Dynamic Algorithms for Directed Graphs'',
in Algorithms -- ESA'98, Lecture Notes in Computer Science Vol. 1461 (Springer-Verlag, 1998), pp.368-380.

[C23] S. Chaudhuri, K.V. Subrahmanyam, F. Wagner, and C. Zaroliagis, "Computing Mimicking Networks",
in Automata, Languages and Programming -- ICALP'98, Lecture Notes in Computer Science Vol. 1443 (Springer-Verlag, 1998),pp.556-567.

[C22] D. Alberts, G. Cattaneo, G.F. Italiano, U. Nanni, and C. Zaroliagis, "A Software Library of Dynamic Graph Algorithms",
in Proc. Workshop on Algorithms and Experiments -- ALEX'98, (R. Battiti and A.A. Bertosi, eds.), 1998, pp.129-136.

[C21] T. Miller and C. Zaroliagis, "A First Experimental Study of a Dynamic Transitive Closure Algorithm",
in Proc. Workshop on Algorithm Engineering -- WAE'97 (G.F. Italiano and S. Orlando, eds.), 1997, pp.64-73.

[C20] G.S. Brodal, J.L.Traeff, and C. Zaroliagis, "A Parallel Priority Data Structure with Applications",
in Proc.11th IEEE Int'l Parallel Processing Symp. -- IPPS'97 (IEEE Computer Society Press, 1997), pp.689-694.

[C19] S. Arikati, D.Z. Chen, L.P. Chew, G. Das, M. Smid, and C. Zaroliagis, "Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane",
in Algorithms-- ESA'96, Lecture Notes in Computer Science, Vol. 1136 (Springer-Verlag, 1996), pp.514-528.

[C18] J.L.Traeff, and C.Zaroliagis, "A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs",
in Parallel Algorithms for Irregularly Structured Problems -- IRREGULAR'96, Lecture Notes in Computer Science, Vol. 1117 (Springer-Verlag, 1996), pp.183-194.

[C17] S. Arikati, S. Chaudhuri, and C. Zaroliagis, "All-Pairs Min-Cut in Sparse Networks",
in Foundations of Software Technology and Theoretical Computer Science -- FSTTCS'95, Lecture Notes in Computer Science, Vol. 1026 (Springer-Verlag, 1995), pp.363-376.

[C16] S.Chaudhuri, and C.Zaroliagis, "Optimal Parallel Shortest Paths in Small Treewidth Digraphs",
in Algorithms -- ESA'95, Lecture Notes in Computer Science, Vol. 979 (Springer-Verlag, 1995), pp.31-45.

[C15] H. Djidjev, G. Pantziou, and C. Zaroliagis, "Fast Algorithms for Maintaining Shortest Paths in Outerplanar and Planar Digraphs",
in Fundamentals of Computation Theory -- FCT'95, Lecture Notes in Computer Science, Vol. 965 (Springer-Verlag, 1995), pp.191-200.

[C14] D. Kagaris, G. Pantziou, S. Tragoudas, and C. Zaroliagis, "On the Computation of Fast Data Transmissions in Networks with Capacities and Delays",
in Algorithms and Data Structures -- WADS'95, Lecture Notes in Computer Science, Vol. 955 (Springer-Verlag, 1995), pp.291-302.

[C13] S. Chaudhuri and C. Zaroliagis, "Shortest Path Queries in Digraphs of Small Treewidth",
in Automata, Languages and Programming -- ICALP'95, Lecture Notes in Computer Science, Vol. 944 (Springer-Verlag, 1995), pp.244-255.

[C12] H. Djidjev, G. Pantziou, and C. Zaroliagis, "On-line and Dynamic Algorithms for Shortest Path Problems",
in Theoretical Aspects of Computer Science -- STACS'95, Lecture Notes in Computer Science, Vol. 900 (Springer-Verlag, 1995), pp.193-204.

[C11] D. Kagaris, G. Pantziou, S. Tragoudas, and C. Zaroliagis, ''Quickest Paths: Parallelization and Dynamization'',
in Proc.28th Int'l Conference on System Sciences -- HICSS-28, Volume II: Software technology (IEEE Computer Society Press, 1995), pp.39-44.

[C10] S. Arikati, A. Maheshwari, and C. Zaroliagis, ''Saving Bits Made Easy'',
in Proc.6th Canadian Conference on Computational Geometry -- CCCG'94, pp.140-146.

[C9] D. Kavvadias, G. Pantziou, P. Spirakis, and C. Zaroliagis, "Efficient Sequential and Parallel Algorithms for the Negative Cycle Problem",
in Algorithms and Computation -- ISAAC'94, Lecture Notes in Computer Science, Vol. 834 (Springer-Verlag, 1994), pp.270-278.

[C8] D. Kavvadias, G. Pantziou, P. Spirakis, and C. Zaroliagis,
"Hammock-on-Ears Decomposition: A Technique for the Efficient Parallel Solution of Shortest Paths and Other Problems",
in Mathematical Foundations of Computer Science -- MFCS'94, Lecture Notes in Computer Science, Vol. 841 (Springer-Verlag, 1994), pp.462-472.

[C7] H. Djidjev, G. Pantziou, and C. Zaroliagis, "Computing Shortest Paths and Distances in Planar Graphs",
in Automata, Languages and Programming -- ICALP'91, Lecture Notes in Computer Science, Vol. 510 (Springer-Verlag, 1991), pp.327-338.

[C6] Z. Kedem, K. Palem, G. Pantziou, P. Spirakis, and C. Zaroliagis, "Fast Parallel Algorithms for Coloring Random Graphs",
in Graph-Theoretic Concepts in Computer Science -- WG'91, Lecture Notes in Computer Science, Vol. 570 (Springer-Verlag, 1992), pp.135-147.

[C5] G. Pantziou, P. Spirakis, and C. Zaroliagis, "Efficient Parallel Algorithms for Shortest Paths in Planar Graphs",
in Algorithm Theory -- SWAT'90, Lecture Notes in Computer Science, Vol. 447 (Springer-Verlag, 1990), pp.288-300.

[C4] G. Pantziou, P. Spirakis, and C. Zaroliagis, "Optimal Parallel Algorithms for Sparse Graphs",
in Graph-Theoretic Concepts in Computer Science -- WG'90, Lecture Notes in Computer Science, Vol. 484 (Springer-Verlag, 1991), pp.1-17.

[C3] G. Pantziou, P. Spirakis, and C. Zaroliagis, "Fast Parallel Approximations of the Maximum Weighted Cut Problem through Derandomization",
in Foundations of Software Technology and Theoretical Computer Science -- FSTTCS'89, Lecture Notes in Computer Science, Vol. 405 (Springer-Verlag, 1989), pp.20-29.

[C2] D. Christodoulakis, S. Goutas, D. Maritsas, P. Soupos, and C. Zaroliagis, ''The Use of the Object-Oriented Approach in the GRASPIN DB'',
in Proc. 4th Annual ESPRIT Conference, Part I, pp.361-374, 1987.

[C1] D. Christodoulakis, S. Goutas, P. Soupos, and C. Zaroliagis, ''The GRASPIN DB -- A Syntax Directed, Language Independent Software Engineering Database'',
in Proc. IEEE International Workshop on Object-Oriented Database Systems, pp.235-236, 1986.



---

Other

[O6] C. Zaroliagis, "Negative Cycles in Weighted Digraphs", Encyclopedia of Algorithms, Springer-Verlag 2008, pp.576-578.

[O5] C. Zaroliagis, "LEDA: a Library of Efficient Algorithms", Encyclopedia of Algorithms, Springer-Verlag 2008, pp.442-444.

[O4] C. Zaroliagis, "Engineering Algorithms for Large Network Applications", Encyclopedia of Algorithms, Springer-Verlag 2008, pp.272-274.

[O3] D. Levendeas and C. Zaroliagis, "Heapsort using Multiple Heaps",
in Proc. 2nd Panhellenic Student Conference on Informatics -- EUREKA 2008, to appear.

[O2] C. Zaroliagis, "The Societal Impact of Algorithms in Transport Optimization",
in Proc. 11th Panhellenic Conference on Informatics -- PCI 2007, Vol. B, pp.433-441.

[O1] C. Zaroliagis, "Recent Advances in Multiobjective Optimization", in Stochastic Algorithms: Foundations and Applications -- SAGA 2005,
Lecture Notes in Computer Science Vol.3777 (Springer-Verlag, 2005), pp.45-47 [invited talk].