Christos Zaroliagis

2.5k total citations
84 papers, 958 citations indexed

About

Christos Zaroliagis is a scholar working on Computer Networks and Communications, Signal Processing and Computational Theory and Mathematics. According to data from OpenAlex, Christos Zaroliagis has authored 84 papers receiving a total of 958 indexed citations (citations by other indexed papers that have themselves been cited), including 36 papers in Computer Networks and Communications, 28 papers in Signal Processing and 25 papers in Computational Theory and Mathematics. Recurrent topics in Christos Zaroliagis's work include Data Management and Algorithms (27 papers), Complexity and Algorithms in Graphs (20 papers) and Advanced Graph Theory Research (13 papers). Christos Zaroliagis is often cited by papers focused on Data Management and Algorithms (27 papers), Complexity and Algorithms in Graphs (20 papers) and Advanced Graph Theory Research (13 papers). Christos Zaroliagis collaborates with scholars based in Greece, Germany and United States. Christos Zaroliagis's co-authors include Frank Schulz, Grammati Pantziou, Evangelia Pyrga, Dorothea Wagner, Dorothea Wagner, Vlasios Kasapakis, Damianos Gavalas, Charalampos Konstantopoulos, Thomas Willhalm and Ravindra K. Ahuja and has published in prestigious journals such as Expert Systems with Applications, Theoretical Computer Science and IEEE Transactions on Systems Man and Cybernetics - Part A Systems and Humans.

In The Last Decade

Christos Zaroliagis

80 papers receiving 887 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Christos Zaroliagis Greece 15 328 324 231 193 168 84 958
Paola Festa Italy 19 77 0.2× 280 0.9× 113 0.5× 162 0.8× 85 0.5× 68 1.4k
Leong Hou U Macao 18 375 1.1× 213 0.7× 180 0.8× 20 0.1× 213 1.3× 84 823
Mathijs de Weerdt Netherlands 20 66 0.2× 285 0.9× 66 0.3× 98 0.5× 59 0.4× 123 1.2k
Stefan Edelkamp Germany 18 96 0.3× 433 1.3× 37 0.2× 323 1.7× 259 1.5× 111 1.4k
William Yeoh United States 16 269 0.8× 531 1.6× 28 0.1× 68 0.4× 165 1.0× 97 921
Le Gruenwald United States 20 563 1.7× 881 2.7× 58 0.3× 92 0.5× 184 1.1× 138 1.6k
Christian Prehofer Germany 20 54 0.2× 937 2.9× 50 0.2× 127 0.7× 130 0.8× 121 1.5k
Marcus Poggi de Aragão Brazil 15 61 0.2× 145 0.4× 63 0.3× 85 0.4× 64 0.4× 19 1.1k
George Karakostas Canada 21 32 0.1× 600 1.9× 61 0.3× 119 0.6× 53 0.3× 56 977
Ming‐Chao Chiang Taiwan 16 113 0.3× 541 1.7× 29 0.1× 103 0.5× 269 1.6× 83 1.3k

Countries citing papers authored by Christos Zaroliagis

Since Specialization
Citations

This map shows the geographic impact of Christos Zaroliagis's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Christos Zaroliagis with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Christos Zaroliagis more than expected).

Fields of papers citing papers by Christos Zaroliagis

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Christos Zaroliagis. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Christos Zaroliagis. The network helps show where Christos Zaroliagis may publish in the future.

Co-authorship network of co-authors of Christos Zaroliagis

This figure shows the co-authorship network connecting the top 25 collaborators of Christos Zaroliagis. A scholar is included among the top collaborators of Christos Zaroliagis based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Christos Zaroliagis. Christos Zaroliagis is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Chatzigiannakis, Ioannis, Damianos Gavalas, Vlasios Kasapakis, et al.. (2021). Enhancing shopping experiences in smart retailing. Journal of Ambient Intelligence and Humanized Computing. 14(12). 15705–15723. 21 indexed citations
2.
D’Angelo, Gianlorenzo, et al.. (2017). Engineering graph-based models for dynamic timetable information systems. Journal of Discrete Algorithms. 46-47. 40–58. 9 indexed citations
3.
Zaroliagis, Christos, Grammati Pantziou, & Spyros Kontogiannis. (2015). Algorithms, Probability, Networks, and Games. Lecture notes in computer science. 7 indexed citations
4.
Gavalas, Damianos, Vlasios Kasapakis, Charalampos Konstantopoulos, et al.. (2014). A personalized multimodal tourist tour planner. 73–80. 5 indexed citations
5.
Zaroliagis, Christos, et al.. (2013). An experimental study of bicriteria models for robust timetabling. Optimization. 62(8). 1089–1112. 1 indexed citations
6.
Kaporis, Alexis C., Christos Makris, Spyros Sioutas, et al.. (2010). ISB-tree: A new indexing scheme with efficient expected behaviour. Journal of Discrete Algorithms. 8(4). 373–387. 4 indexed citations
7.
Ahuja, Ravindra K., Rolf H. Möhring, & Christos Zaroliagis. (2009). Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems. Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)). 60 indexed citations
8.
Stamatiou, Yannis C., et al.. (2009). On the Efficient Generation of Prime-Order Elliptic Curves. Journal of Cryptology. 23(3). 477–503. 1 indexed citations
9.
Chatzigiannakis, Ioannis, et al.. (2008). Distributed simulation of heterogeneous systems of small programmable objects and traditional processors. IRIS Research product catalog (Sapienza University of Rome). 133–140. 1 indexed citations
10.
Zaroliagis, Christos, et al.. (2007). Searchius: A Collaborative Search Engine. 280. 88–98. 1 indexed citations
11.
Chatzigiannakis, Ioannis, et al.. (2004). DAP: a generic platform for the simulation of distributed algorithms. Annual Simulation Symposium. 167–177. 6 indexed citations
12.
Djidjev, Hristo, Grammati Pantziou, & Christos Zaroliagis. (2000). Improved Algorithms for Dynamic Shortest Paths. Algorithmica. 28(4). 367–389. 9 indexed citations
13.
Vitter, Jeffrey Scott & Christos Zaroliagis. (1999). Algorithm Engineering. Lecture notes in computer science. 6 indexed citations
14.
Alberts, David S., Giuseppe Cattaneo, Giuseppe F. Italiano, Umberto Nanni, & Christos Zaroliagis. (1998). A Software Library of Dynamic Graph Algorithms. Max Planck Institute for Plasma Physics. 129–136. 3 indexed citations
15.
Frigioni, Daniele, et al.. (1998). An experimental study of dynamic algorithms for directed graphs. Max Planck Institute for Plasma Physics. 368–380. 5 indexed citations
16.
Zaroliagis, Christos, et al.. (1998). Shortest paths in digraphs of small treewidth. Part II: Optimal parallel algorithms. Theoretical Computer Science. 203(2). 205–223. 10 indexed citations
17.
Brodal, Gerth Stølting, Jesper Larsson Träff, & Christos Zaroliagis. (1997). A parallel priority data structure with applications. Max Planck Institute for Plasma Physics. 689–693. 3 indexed citations
18.
Kavvadias, Dimitris J., Grammati Pantziou, Paul G. Spirakis, & Christos Zaroliagis. (1996). Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems. Theoretical Computer Science. 168(1). 121–154. 1 indexed citations
19.
Zaroliagis, Christos, et al.. (1995). Optimal parallel shortest paths in small treewidth digraphs. Lecture notes in computer science. 31–45. 1 indexed citations
20.
Pantziou, Grammati, Paul G. Spirakis, & Christos Zaroliagis. (1992). Efficient parallel algorithms for shortest paths in planar digraphs. BIT Numerical Mathematics. 32(2). 215–236. 6 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026