Christos Levcopoulos

1.8k total citations
63 papers, 678 citations indexed

About

Christos Levcopoulos is a scholar working on Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics and Computer Vision and Pattern Recognition. According to data from OpenAlex, Christos Levcopoulos has authored 63 papers receiving a total of 678 indexed citations (citations by other indexed papers that have themselves been cited), including 47 papers in Computer Graphics and Computer-Aided Design, 30 papers in Computational Theory and Mathematics and 15 papers in Computer Vision and Pattern Recognition. Recurrent topics in Christos Levcopoulos's work include Computational Geometry and Mesh Generation (47 papers), Advanced Graph Theory Research (19 papers) and Data Management and Algorithms (15 papers). Christos Levcopoulos is often cited by papers focused on Computational Geometry and Mesh Generation (47 papers), Advanced Graph Theory Research (19 papers) and Data Management and Algorithms (15 papers). Christos Levcopoulos collaborates with scholars based in Sweden, Netherlands and Australia. Christos Levcopoulos's co-authors include Joachim Gudmundsson, Giri Narasimhan, Andrzej Lingas, Mark H. Overmars, Ola Petersson, Michiel Smid, Matthew J. Katz, A. Frank van der Stappen, Mark de Berg and Jesper Jansson and has published in prestigious journals such as SIAM Journal on Computing, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

Christos Levcopoulos

58 papers receiving 588 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 Levcopoulos Sweden 16 341 235 168 150 129 63 678
Andrzej Lingas Sweden 17 266 0.8× 347 1.5× 162 1.0× 227 1.5× 162 1.3× 122 827
Csaba D. Tóth United States 15 439 1.3× 268 1.1× 180 1.1× 154 1.0× 167 1.3× 140 848
Ferrán Hurtado Spain 15 588 1.7× 315 1.3× 229 1.4× 102 0.7× 58 0.4× 123 815
Binay Bhattacharya Canada 14 240 0.7× 98 0.4× 149 0.9× 181 1.2× 66 0.5× 69 592
Sergio Cabello Slovenia 18 359 1.1× 382 1.6× 197 1.2× 116 0.8× 86 0.7× 75 762
Nabil H. Mustafa France 13 257 0.8× 179 0.8× 191 1.1× 87 0.6× 87 0.7× 49 584
Mihai Bâdoiu United States 10 177 0.5× 173 0.7× 200 1.2× 83 0.6× 255 2.0× 15 565
Hervé Brönnimann United States 19 524 1.5× 301 1.3× 219 1.3× 373 2.5× 205 1.6× 56 1.1k
Jeffrey S. Salowe United States 12 266 0.8× 144 0.6× 92 0.5× 127 0.8× 58 0.4× 31 528
Daniel Greene United States 9 177 0.5× 168 0.7× 172 1.0× 155 1.0× 243 1.9× 18 720

Countries citing papers authored by Christos Levcopoulos

Since Specialization
Citations

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

Fields of papers citing papers by Christos Levcopoulos

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Christos Levcopoulos

This figure shows the co-authorship network connecting the top 25 collaborators of Christos Levcopoulos. A scholar is included among the top collaborators of Christos Levcopoulos 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 Levcopoulos. Christos Levcopoulos 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.
Gąsieniec, Leszek, Jesper Jansson, Christos Levcopoulos, & Andrzej Lingas. (2025). Efficient assignment of identities in anonymous populations. Information and Computation. 303. 105265–105265. 1 indexed citations
2.
Gąsieniec, Leszek, Tomasz Jurdziński, Ralf Klasing, et al.. (2023). Perpetual maintenance of machines with different urgency requirements. Journal of Computer and System Sciences. 139. 103476–103476.
3.
Bae, Sang Won, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, & Christos Levcopoulos. (2019). Shortcuts for the circle. Computational Geometry. 79. 37–54. 1 indexed citations
4.
Shawi, Radwa El, Joachim Gudmundsson, & Christos Levcopoulos. (2014). Quickest path queries on transportation network. Lund University Publications (Lund University). 3 indexed citations
5.
Andersson, Mattias, Joachim Gudmundsson, & Christos Levcopoulos. (2007). Approximate distance oracles for graphs with dense clusters. Computational Geometry. 37(3). 142–154. 7 indexed citations
6.
Gudmundsson, Joachim & Christos Levcopoulos. (2007). Minimum weight pseudo-triangulations. Computational Geometry. 38(3). 139–153. 12 indexed citations
7.
Klein, Rolf, Christos Levcopoulos, & Andrzej Lingas. (2005). A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation. Computational Geometry. 34(1). 28–34. 2 indexed citations
8.
Berg, Mark de, et al.. (2005). TSP with neighborhoods of varying size. 1 indexed citations
9.
Andersson, Mattias, Joachim Gudmundsson, & Christos Levcopoulos. (2004). Chips on wafers, or packing rectangles into grids. Computational Geometry. 30(2). 95–111. 8 indexed citations
10.
Gudmundsson, Joachim, Christos Levcopoulos, Giri Narasimhan, & Michiel Smid. (2002). Approximate distance oracles for geometric graphs. Symposium on Discrete Algorithms. 828–837. 26 indexed citations
11.
Levcopoulos, Christos, et al.. (2002). Optimal algorithms for complete linkage clustering in d dimensions. Theoretical Computer Science. 286(1). 139–149. 17 indexed citations
12.
Gudmundsson, Joachim, Christos Levcopoulos, & Giri Narasimhan. (2001). Approximating a minimum Manhattan network. Nordic journal of computing. 8(2). 219–232. 19 indexed citations
13.
Gudmundsson, Joachim & Christos Levcopoulos. (1999). A fast approximation algorithm for TSP with neighborhoods. Nordic journal of computing. 6(4). 469–488. 37 indexed citations
14.
Levcopoulos, Christos, et al.. (1999). Minimum spanning trees in d dimensions. Nordic journal of computing. 6(4). 446–461. 8 indexed citations
15.
Levcopoulos, Christos, et al.. (1998). Computing a threaded quadtree from the Delaunay triangulation in linear time. Nordic journal of computing. 5(1). 1–18. 1 indexed citations
16.
Levcopoulos, Christos, et al.. (1997). A near-optimal heuristic for minimum weight triangulation of convex polygons. Symposium on Discrete Algorithms. 518–527. 2 indexed citations
17.
Levcopoulos, Christos & Ola Petersson. (1994). Sorting Shuffled Monotone Sequences. Information and Computation. 112(1). 37–50. 9 indexed citations
18.
Levcopoulos, Christos & Ola Petersson. (1992). Matching parentheses in parallel. Discrete Applied Mathematics. 40(3). 423–431. 3 indexed citations
19.
Levcopoulos, Christos & Andrzej Lingas. (1992). Fast algorithms for greedy triangulation. BIT Numerical Mathematics. 32(2). 280–296. 12 indexed citations
20.
Levcopoulos, Christos. (1986). Fast heuristics for minimum length rectangular partitions of polygons. 100–108. 15 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 Andrzej Lingas Breakdown of academic impact, for papers by Csaba D. Tóth Breakdown of academic impact, for papers by Ferrán Hurtado Breakdown of academic impact, for papers by Binay Bhattacharya Breakdown of academic impact, for papers by Sergio Cabello Breakdown of academic impact, for papers by Nabil H. Mustafa Breakdown of academic impact, for papers by Mihai Bâdoiu Breakdown of academic impact, for papers by Hervé Brönnimann Breakdown of academic impact, for papers by Jeffrey S. Salowe Breakdown of academic impact, for papers by Daniel Greene
Rankless by CCL
2026