Nikos Parotsidis

458 total citations
26 papers, 133 citations indexed

About

Nikos Parotsidis is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Artificial Intelligence. According to data from OpenAlex, Nikos Parotsidis has authored 26 papers receiving a total of 133 indexed citations (citations by other indexed papers that have themselves been cited), including 15 papers in Computer Networks and Communications, 14 papers in Computational Theory and Mathematics and 7 papers in Artificial Intelligence. Recurrent topics in Nikos Parotsidis's work include Complexity and Algorithms in Graphs (12 papers), Optimization and Search Problems (9 papers) and Interconnection Networks and Systems (8 papers). Nikos Parotsidis is often cited by papers focused on Complexity and Algorithms in Graphs (12 papers), Optimization and Search Problems (9 papers) and Interconnection Networks and Systems (8 papers). Nikos Parotsidis collaborates with scholars based in Italy, Greece and Denmark. Nikos Parotsidis's co-authors include Evaggelia Pitoura, Panayiotis Tsaparas, Giuseppe F. Italiano, Loukas Georgiadis, Luigi Laura, Thomas Dueholm Hansen, Shiri Chechik, Przemysław Uznański, Nikolaj Tatti and Kiran Garimella and has published in prestigious journals such as Journal of the ACM, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Nikos Parotsidis

21 papers receiving 123 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Nikos Parotsidis Italy 6 64 50 48 34 17 26 133
Michele Borassi Italy 7 34 0.5× 63 1.3× 43 0.9× 35 1.0× 4 0.2× 9 127
Giovanni Zappella Italy 8 28 0.4× 33 0.7× 13 0.3× 111 3.3× 39 2.3× 17 158
Konstantin Kutzkov Denmark 6 42 0.7× 67 1.3× 25 0.5× 47 1.4× 15 0.9× 13 123
Pierre‐Cyrille Héam France 7 45 0.7× 10 0.2× 65 1.4× 67 2.0× 44 2.6× 37 139
Amir Akbarnejad Canada 3 40 0.6× 55 1.1× 7 0.1× 210 6.2× 21 1.2× 6 233
Cécile Bothorel France 3 25 0.4× 121 2.4× 6 0.1× 90 2.6× 23 1.4× 7 161
Tim Kaler United States 4 44 0.7× 14 0.3× 28 0.6× 29 0.9× 15 0.9× 8 85
Adrian Vladu United States 6 34 0.5× 19 0.4× 63 1.3× 44 1.3× 4 0.2× 12 120
Jiaojiao Wu China 10 44 0.7× 22 0.4× 193 4.0× 46 1.4× 49 2.9× 27 288
Vikram Nitin United States 5 24 0.4× 37 0.7× 9 0.2× 63 1.9× 27 1.6× 6 107

Countries citing papers authored by Nikos Parotsidis

Since Specialization
Citations

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

Fields of papers citing papers by Nikos Parotsidis

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Nikos Parotsidis

This figure shows the co-authorship network connecting the top 25 collaborators of Nikos Parotsidis. A scholar is included among the top collaborators of Nikos Parotsidis 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 Nikos Parotsidis. Nikos Parotsidis 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.
Goldberg, Andrew V., et al.. (2024). A metaheuristic algorithm for large maximum weight independent set problems. Networks. 85(1). 91–112. 2 indexed citations
2.
3.
Cohen-Addad, Vincent, et al.. (2024). Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor. Journal of the ACM. 71(2). 1–41.
4.
Goldberg, Andrew V., et al.. (2022). A Local Search Algorithm for Large Maximum Weight Independent Set Problems. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations
5.
Goldberg, Andrew V., et al.. (2021). New Instances for Maximum Weight Independent Set From a Vehicle Routing Application. Operations Research Forum. 2(4). 2 indexed citations
6.
Georgiadis, Loukas, Giuseppe F. Italiano, & Nikos Parotsidis. (2020). Strong Connectivity in Directed Graphs under Failures, with Applications. SIAM Journal on Computing. 49(5). 865–926. 4 indexed citations
7.
Abboud, Amir, Loukas Georgiadis, Giuseppe F. Italiano, et al.. (2019). Faster algorithms for all-pairs bounded min-cuts. IRIS - Institutional Research Information System (Libera Università Internazionale degli Studi Sociali Guido Carli). 9 indexed citations
8.
Italiano, Giuseppe F., et al.. (2019). Dominating sets and connected dominating sets in dynamic graphs. IRIS - Institutional Research Information System (Libera Università Internazionale degli Studi Sociali Guido Carli). 4 indexed citations
9.
Garimella, Kiran, Aristides Gionis, Nikos Parotsidis, & Nikolaj Tatti. (2017). Balancing information exposure in social networks. Aaltodoc (Aalto University). 30. 4663–4671. 8 indexed citations
10.
Chechik, Shiri, et al.. (2017). Faster algorithms for computing maximal 2-connected subgraphs in sparse directed graphs. arXiv (Cornell University). 1900–1918. 4 indexed citations
11.
Georgiadis, Loukas, et al.. (2017). Sparse certificates for 2-connectivity in directed graphs. Theoretical Computer Science. 698. 40–66. 2 indexed citations
12.
Georgiadis, Loukas, et al.. (2017). All-Pairs 2-Reachability in O(n^w log n) Time. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 2 indexed citations
13.
Georgiadis, Loukas, Giuseppe F. Italiano, & Nikos Parotsidis. (2017). Strong Connectivity in Directed Graphs under Failures, with Applications. 1880–1899. 3 indexed citations
14.
Chechik, Shiri, et al.. (2017). Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs. 1900–1918. 4 indexed citations
15.
Georgiadis, Loukas, Giuseppe F. Italiano, & Nikos Parotsidis. (2016). 2-Connectivity in Directed Graphs.. European Symposium on Algorithms. 2 indexed citations
16.
Parotsidis, Nikos, Evaggelia Pitoura, & Panayiotis Tsaparas. (2016). Centrality-Aware Link Recommendations. 503–512. 23 indexed citations
17.
Georgiadis, Loukas, Giuseppe F. Italiano, Luigi Laura, & Nikos Parotsidis. (2016). 2-Edge Connectivity in Directed Graphs. ACM Transactions on Algorithms. 13(1). 1–24. 10 indexed citations
18.
Chechik, Shiri, Thomas Dueholm Hansen, Giuseppe F. Italiano, Jakub Łącki, & Nikos Parotsidis. (2016). Decremental Single-Source Reachability and Strongly Connected Components in Õ(m√n) Total Update Time. Cineca Institutional Research Information System (Tor Vergata University). 28. 315–324. 5 indexed citations
19.
Georgiadis, Loukas, Giuseppe F. Italiano, Luigi Laura, & Nikos Parotsidis. (2015). 2-edge connectivity in directed graphs. Symposium on Discrete Algorithms. 13(1). 1988–2005. 3 indexed citations
20.
Magoutis, Kostas, et al.. (2015). Design and implementation of a social networking platform for cloud deployment specialists. Journal of Internet Services and Applications. 6(1). 5 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

Breakdown of academic impact, for papers by Michele Borassi Breakdown of academic impact, for papers by Giovanni Zappella Breakdown of academic impact, for papers by Konstantin Kutzkov Breakdown of academic impact, for papers by Pierre‐Cyrille Héam Breakdown of academic impact, for papers by Amir Akbarnejad Breakdown of academic impact, for papers by Cécile Bothorel Breakdown of academic impact, for papers by Tim Kaler Breakdown of academic impact, for papers by Adrian Vladu Breakdown of academic impact, for papers by Jiaojiao Wu Breakdown of academic impact, for papers by Vikram Nitin
Rankless by CCL
2026