Panos Giannopoulos

531 total citations
25 papers, 186 citations indexed

About

Panos Giannopoulos 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, Panos Giannopoulos has authored 25 papers receiving a total of 186 indexed citations (citations by other indexed papers that have themselves been cited), including 20 papers in Computer Graphics and Computer-Aided Design, 12 papers in Computational Theory and Mathematics and 5 papers in Computer Vision and Pattern Recognition. Recurrent topics in Panos Giannopoulos's work include Computational Geometry and Mesh Generation (20 papers), Advanced Graph Theory Research (11 papers) and Complexity and Algorithms in Graphs (7 papers). Panos Giannopoulos is often cited by papers focused on Computational Geometry and Mesh Generation (20 papers), Advanced Graph Theory Research (11 papers) and Complexity and Algorithms in Graphs (7 papers). Panos Giannopoulos collaborates with scholars based in Germany, United Kingdom and Slovenia. Panos Giannopoulos's co-authors include Christian Knauer, René van Oostrum, Remco C. Veltkamp, Frans Wiering, Rainer Typke, Sergio Cabello, Günter Rote, Joachim Gudmundsson, Sue Whitesides and Magnus Wahlström and has published in prestigious journals such as SIAM Journal on Computing, The Computer Journal and Algorithmica.

In The Last Decade

Panos Giannopoulos

22 papers receiving 166 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Panos Giannopoulos Germany 7 99 81 67 45 19 25 186
André Schulz Germany 7 70 0.7× 28 0.3× 96 1.4× 53 1.2× 7 0.4× 39 172
Rom Pinchasi Israel 9 80 0.8× 20 0.2× 197 2.9× 155 3.4× 13 0.7× 64 274
Paul J. Heffernan United States 9 110 1.1× 47 0.6× 164 2.4× 40 0.9× 29 1.5× 14 218
Mirosław Kowaluk Poland 7 48 0.5× 18 0.2× 65 1.0× 60 1.3× 28 1.5× 24 138
Mina Makar United States 12 282 2.8× 37 0.5× 28 0.4× 13 0.3× 37 1.9× 25 324
Fabrizio Frati Italy 9 98 1.0× 29 0.4× 223 3.3× 175 3.9× 42 2.2× 61 299
Patrizio Angelini Italy 9 69 0.7× 19 0.2× 139 2.1× 94 2.1× 30 1.6× 47 188
Birgit Vogtenhuber Austria 7 48 0.5× 20 0.2× 159 2.4× 94 2.1× 14 0.7× 62 180
Bernardo M. Ábrego United States 9 67 0.7× 20 0.2× 142 2.1× 54 1.2× 6 0.3× 27 157
Sigal Ar Israel 5 58 0.6× 14 0.2× 36 0.5× 16 0.4× 16 0.8× 6 120

Countries citing papers authored by Panos Giannopoulos

Since Specialization
Citations

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

Fields of papers citing papers by Panos Giannopoulos

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Panos Giannopoulos

This figure shows the co-authorship network connecting the top 25 collaborators of Panos Giannopoulos. A scholar is included among the top collaborators of Panos Giannopoulos 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 Panos Giannopoulos. Panos Giannopoulos 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.
Brito‐Loeza, Carlos, et al.. (2024). Relationship between Irregularities of the Nuclear Envelope and Mitochondria in HeLa Cells Observed with Electron Microscopy. City Research Online (City University London). 1–5. 2 indexed citations
2.
Giannopoulos, Panos, et al.. (2020). Geometric Multicut: Shortest Fences for Separating Groups of Objects in the Plane. Discrete & Computational Geometry. 64(3). 575–607.
3.
Bonnet, Édouard, Panos Giannopoulos, Eun Jung Kim, Paweł Rzążewski, & Florian Sikora. (2018). QPTAS and subexponential algorithm for maximum clique on disk graphs. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 15.
4.
Bonnet, Édouard, Panos Giannopoulos, & Michael Lampis. (2017). On the Parameterized Complexity of Red-Blue Points Separation. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations
5.
Alt, Helmut, Sergio Cabello, Panos Giannopoulos, & Christian Knauer. (2017). Minimum Cell Connection in Line Segment Arrangements. International Journal of Computational Geometry & Applications. 27(3). 159–176. 2 indexed citations
6.
Cabello, Sergio & Panos Giannopoulos. (2014). The Complexity of Separating Points in the Plane. Algorithmica. 74(2). 643–663. 3 indexed citations
7.
Giannopoulos, Panos, et al.. (2014). Low-crossing spanning trees: an alternative proof and experiments. Middlesex University Research Repository (Middlesex University Of London). 1 indexed citations
8.
Cabello, Sergio & Panos Giannopoulos. (2013). The complexity of separating points in the plane. 379–386. 1 indexed citations
9.
Giannopoulos, Panos, et al.. (2011). Hardness of discrepancy computation and ε-net verification in high dimension. Journal of Complexity. 28(2). 162–176. 13 indexed citations
10.
Giannopoulos, Panos, et al.. (2011). Fixed-parameter tractability and lower bounds for stabbing problems. Computational Geometry. 46(7). 839–860. 5 indexed citations
11.
Cabello, Sergio, Panos Giannopoulos, Christian Knauer, Dániel Marx, & Günter Rote. (2011). Geometric clustering. ACM Transactions on Algorithms. 7(4). 1–27. 6 indexed citations
12.
Giannopoulos, Panos, Rolf Klein, Christian Knauer, Martin Kütz, & Dániel Marx. (2010). COMPUTING GEOMETRIC MINIMUM-DILATION GRAPHS IS NP-HARD. International Journal of Computational Geometry & Applications. 20(2). 147–173. 5 indexed citations
13.
Cabello, Sergio, Mark de Berg, Panos Giannopoulos, et al.. (2009). MAXIMIZING THE AREA OF OVERLAP OF TWO UNIONS OF DISKS UNDER RIGID MOTION. International Journal of Computational Geometry & Applications. 19(6). 533–556. 3 indexed citations
14.
Cabello, Sergio, Panos Giannopoulos, Christian Knauer, & Günter Rote. (2008). Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension. Symposium on Discrete Algorithms. 836–843. 6 indexed citations
15.
Giannopoulos, Panos, et al.. (2008). Improving the Stretch Factor of a Geometric Network by Edge Augmentation. SIAM Journal on Computing. 38(1). 226–240. 11 indexed citations
16.
Cabello, Sergio, Panos Giannopoulos, & Christian Knauer. (2007). On the parameterized complexity of d-dimensional point set pattern matching. Information Processing Letters. 105(2). 73–77. 8 indexed citations
17.
Cabello, Sergio, Panos Giannopoulos, Christian Knauer, & Günter Rote. (2006). Matching point sets with respect to the Earth Mover's Distance. Computational Geometry. 39(2). 118–133. 17 indexed citations
18.
Giannopoulos, Panos, et al.. (2005). Finding the best shortcut in a geometric network. TU/e Research Portal. 327–335. 7 indexed citations
19.
Typke, Rainer, Panos Giannopoulos, Remco C. Veltkamp, Frans Wiering, & René van Oostrum. (2003). Using transportation distances for measuring melodic similarity. International Symposium/Conference on Music Information Retrieval. 107–114. 77 indexed citations
20.
Overmars, M.H. & Panos Giannopoulos. (2000). Geometric matching of weighted point sets. 1 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

Rankless by CCL
2026