Stathis Zachos

16 papers receiving 326 citations

Peers

Stathis Zachos
Comparison fields: 5 of 33
  • Computational Theory and Mathematics 299
  • Artificial Intelligence 241
  • Electrical and Electronic Engineering 44
  • Computer Networks and Communications 32
  • Computer Graphics and Computer-Aided Design 17
Replace Mikael Goldmann with:
Mikael Goldmann Sweden
M. Alekhnovich United States
Rahul Santhanam United Kingdom
Arnab Bhattacharyya United States
Prahladh Harsha United States
Gerd Wechsung Germany
V. Arvind India
Shubhangi Saraf United States
Dieter van Melkebeek United States
Marcos Kiwi Chile
Stathis Zachos relative to Mikael Goldmann Sweden Mikael Goldmann's profile →
Citations per field
00.5×1.7×
Mikael Goldmann · 1×
Citations per year

Countries citing papers authored by Stathis Zachos

Since Specialization
Citations

This map shows the geographic impact of Stathis Zachos'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 Stathis Zachos with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Stathis Zachos more than expected).

Fields of papers citing papers by Stathis Zachos

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Stathis Zachos. 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 Stathis Zachos. The network helps show where Stathis Zachos may publish in the future.

Co-authorship network of co-authors of Stathis Zachos

This figure shows the co-authorship network connecting the top 25 collaborators of Stathis Zachos. A scholar is included among the top collaborators of Stathis Zachos 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 Stathis Zachos. Stathis Zachos is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

17 of 17 papers shown
#WorkIndexed citations
1 2
2 0
3
Teaching programming through problem solving: The role of the programming language
3
4 1
5
Conflict-free coloring
15
6 2
7 6
8 14
9 5
10 11
11
Routing and Path Multi-Coloring
3
12 6
13 50
14 28
15 178
16 27
17 18

About Stathis Zachos

Stathis Zachos is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Computer Graphics and Computer-Aided Design, having authored 17 papers that have together received 369 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (7 papers), Complexity and Algorithms in Graphs (6 papers) and Advanced Optical Network Technologies (5 papers). The work is most often cited by research in Computational Theory and Mathematics (299 citations), Artificial Intelligence (241 citations) and Computer Graphics and Computer-Aided Design (17 citations). Stathis Zachos has collaborated with scholars based in Greece, United States and Germany. Frequent co-authors include Ravi B. Boppana, Johan Håstad, Hans Heller, Aris Pagourtzis, Michael Sipser, Yishay Mansour, Martin Fürer, Oded Goldreich, Amotz Bar-Noy and Katerina Potika. Their work appears in journals such as Computer Networks, Theoretical Computer Science and Journal of Computer and System Sciences.

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