Loukas Georgiadis

832 total citations
32 papers, 237 citations indexed

About

Loukas Georgiadis is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Loukas Georgiadis has authored 32 papers receiving a total of 237 indexed citations (citations by other indexed papers that have themselves been cited), including 23 papers in Computational Theory and Mathematics, 19 papers in Computer Networks and Communications and 10 papers in Artificial Intelligence. Recurrent topics in Loukas Georgiadis's work include Complexity and Algorithms in Graphs (15 papers), Distributed systems and fault tolerance (12 papers) and Interconnection Networks and Systems (8 papers). Loukas Georgiadis is often cited by papers focused on Complexity and Algorithms in Graphs (15 papers), Distributed systems and fault tolerance (12 papers) and Interconnection Networks and Systems (8 papers). Loukas Georgiadis collaborates with scholars based in Greece, Italy and United States. Loukas Georgiadis's co-authors include Robert E. Tarjan, Giuseppe F. Italiano, Renato F. Werneck, Nikos Parotsidis, Gerth Stølting Brodal, Adam L. Buchsbaum, Irit Katriel, Haim Kaplan, Luigi Laura and Anne Rogers and has published in prestigious journals such as SIAM Journal on Computing, Theoretical Computer Science and Operations Research Letters.

In The Last Decade

Loukas Georgiadis

26 papers receiving 219 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Loukas Georgiadis Greece	10	132	128	65	42	22	32	237
Peter Emde Boas Netherlands	2	125 0.9×	117 0.9×	179 2.8×	61 1.5×	62 2.8×	2	325
W. H. J. Feijen Netherlands	6	173 1.3×	144 1.1×	131 2.0×	89 2.1×	11 0.5×	12	338
K. Subramani United States	8	95 0.7×	143 1.1×	99 1.5×	19 0.5×	24 1.1×	65	217
Naomi Nishimura Canada	12	180 1.4×	300 2.3×	79 1.2×	11 0.3×	16 0.7×	34	385
A. J. M. van Gasteren Netherlands	10	185 1.4×	200 1.6×	188 2.9×	94 2.2×	20 0.9×	15	415
Luděk Kučera Czechia	8	75 0.6×	177 1.4×	102 1.6×	25 0.6×	5 0.2×	35	303
Mark R. Brown United States	7	103 0.8×	83 0.6×	157 2.4×	34 0.8×	43 2.0×	9	244
Oliver Kullmann United Kingdom	10	137 1.0×	267 2.1×	185 2.8×	9 0.2×	17 0.8×	23	357
Surender Baswana India	14	252 1.9×	388 3.0×	155 2.4×	8 0.2×	48 2.2×	37	504
Raymond Boute Belgium	9	23 0.2×	92 0.7×	93 1.4×	66 1.6×	10 0.5×	41	234

Countries citing papers authored by Loukas Georgiadis

Since Specialization

Citations

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

Fields of papers citing papers by Loukas Georgiadis

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Loukas Georgiadis

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

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Georgiadis, Loukas, et al.. (2024). Computing the 3-Edge-Connected Components of Directed Graphs in Linear Time. 62–85.

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

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

Georgiadis, Loukas, et al.. (2019). Approximating the smallest 2-vertex connected spanning subgraph of a directed graph. Theoretical Computer Science. 807. 185–200. 1 indexed citations

Georgiadis, Loukas, et al.. (2018). Computing Critical Nodes in Directed Graphs. ACM Journal of Experimental Algorithmics. 23. 1–24. 8 indexed citations

Georgiadis, Loukas, et al.. (2017). Incremental Low-High Orders of Directed Graphs and Applications.. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 21.

Georgiadis, Loukas, et al.. (2017). Sparse certificates for 2-connectivity in directed graphs. Theoretical Computer Science. 698. 40–66. 2 indexed citations

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

Georgiadis, Loukas, Giuseppe F. Italiano, & Nikos Parotsidis. (2017). Strong Connectivity in Directed Graphs under Failures, with Applications. 1880–1899. 3 indexed citations

10.

Georgiadis, Loukas, Giuseppe F. Italiano, & Nikos Parotsidis. (2016). 2-Connectivity in Directed Graphs.. European Symposium on Algorithms. 2 indexed citations

11.

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

12.

Firmani, Donatella, et al.. (2015). Strong Articulation Points and Strong Bridges in Large Scale Graphs. Algorithmica. 74(3). 1123–1147. 4 indexed citations

13.

Georgiadis, Loukas, et al.. (2013). Finding dominators via disjoint set union. Journal of Discrete Algorithms. 23. 2–20. 13 indexed citations

14.

Buchsbaum, Adam L., Loukas Georgiadis, Haim Kaplan, et al.. (2008). Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems. SIAM Journal on Computing. 38(4). 1533–1573. 30 indexed citations

15.

Georgiadis, Loukas, Robert E. Tarjan, & Renato F. Werneck. (2006). Design of data structures for mergeable trees. Symposium on Discrete Algorithms. 394–403. 4 indexed citations

16.

Georgiadis, Loukas, Robert E. Tarjan, & Renato F. Werneck. (2006). Finding Dominators in Practice. Journal of Graph Algorithms and Applications. 10(1). 69–94. 22 indexed citations

17.

Georgiadis, Loukas & Robert E. Tarjan. (2005). Dominator tree verification and vertex-disjoint paths. Symposium on Discrete Algorithms. 433–442. 7 indexed citations

18.

Tarjan, Robert E. & Loukas Georgiadis. (2005). Linear-time algorithms for dominators and related problems. 6 indexed citations

19.

Georgiadis, Loukas & Robert E. Tarjan. (2004). Finding Dominators Revisited. Symposium on Discrete Algorithms. 16 indexed citations

20.

Georgiadis, Loukas & Robert E. Tarjan. (2004). Finding dominators revisited: extended abstract. Symposium on Discrete Algorithms. 869–878. 30 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