Loukas Georgiadis
- Computer Networks and Communications top 10%
- Computational Theory and Mathematics top 5%
- Artificial Intelligence
- Hardware and Architecture top 10%
- Signal Processing
- Co-authors
- Robert E. TarjanGiuseppe F. ItalianoRenato F. WerneckNikos ParotsidisGerth Stølting BrodalAdam L. BuchsbaumLuigi LauraHaim Kaplan
- Topics
- Complexity and Algorithms in Graphs (15 papers)Distributed systems and fault tolerance (12 papers)Interconnection Networks and Systems (8 papers)
- Cited by
- Computational Theory and MathematicsHardware and ArchitectureComputer Graphics and Computer-Aided Design
- Partner nations
- GreeceItalyUnited States
In The Last Decade
Loukas Georgiadis
26 papers receiving 219 citations
Peers
Comparison fields: 5 of 36
- Computer Networks and Communications 132
- Computational Theory and Mathematics 128
- Artificial Intelligence 65
- Hardware and Architecture 42
- Signal Processing 22
Countries citing papers authored by Loukas Georgiadis
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
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
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 4 | |
| 3 | 9 | |
| 4 | 1 | |
| 5 | 8 | |
| 6 | 0 | |
| 7 | 2 | |
| 8 | 2 | |
| 9 | 2-Connectivity in Directed Graphs. | 2 |
| 10 | 3 | |
| 11 | 4 | |
| 12 | 9 | |
| 13 | 13 | |
| 14 | 30 | |
| 15 | 15 | |
| 16 | 4 | |
| 17 | 7 | |
| 18 | Linear-time algorithms for dominators and related problems | 6 |
| 19 | Finding Dominators Revisited | 16 |
| 20 | 30 |
About Loukas Georgiadis
Loukas Georgiadis is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Software, having authored 32 papers that have together received 237 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (15 papers), Distributed systems and fault tolerance (12 papers) and Interconnection Networks and Systems (8 papers). The work is most often cited by research in Computational Theory and Mathematics (128 citations), Hardware and Architecture (42 citations) and Computer Graphics and Computer-Aided Design (21 citations). Loukas Georgiadis has collaborated with scholars based in Greece, Italy and United States. Frequent co-authors include Robert E. Tarjan, Giuseppe F. Italiano, Renato F. Werneck, Nikos Parotsidis, Gerth Stølting Brodal, Adam L. Buchsbaum, Luigi Laura, Haim Kaplan, Jeffery Westbrook and Anne Rogers. Their work appears in journals such as SIAM Journal on Computing, Theoretical Computer Science and Operations Research Letters.
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.