A Pseudo-Metric for Weighted Point Sets. - Panos Giannopoulos; Remco C. Veltkamp (ECCV (3), 2002)

Using transportation distances for measuring melodic similarity. - Rainer Typke; Panos Giannopoulos; Remco C. Veltkamp; Frans Wiering; René van Oostrum (ISMIR, 2003)

Finding the best shortcut in a geometric network. - Mohammad Farshi; Panos Giannopoulos; Joachim Gudmundsson (EuroCG, 2005)

On the Parameterized Complexity of d-Dimensional Point Set Pattern Matching. - Sergio Cabello; Panos Giannopoulos; Christian Knauer (IWPEC, 2006)

Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension. - Sergio Cabello; Panos Giannopoulos; Christian Knauer; Günter Rote (SODA, 2008)

Parameterized Complexity of Geometric Problems. - Panos Giannopoulos; Christian Knauer; Sue Whitesides (Comput. J., 2008)

Matching point sets with respect to the Earth Mover's Distance. - Sergio Cabello; Panos Giannopoulos; Christian Knauer; Günter Rote (Comput. Geom., 2008)

On the parameterized complexity of d-dimensional point set pattern matching. - Sergio Cabello; Panos Giannopoulos; Christian Knauer (Inf. Process. Lett., 2008)

Improving the Stretch Factor of a Geometric Network by Edge Augmentation. - Mohammad Farshi; Panos Giannopoulos; Joachim Gudmundsson (SIAM J. Comput., 2008)

The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension. - Panos Giannopoulos; Christian Knauer; Günter Rote (IWPEC, 2009)

The parameterized complexity of some geometric problems in unbounded dimension - Panos Giannopoulos; Christian Knauer; Günter Rote; Daniel Werner (CoRR, 2009)

Abstract Milling with Turn Costs - Michael R. Fellows; Panos Giannopoulos; Christian Knauer; Christophe Paul; Frances A. Rosamond; Sue Whitesides; Nathan Yu (CoRR, 2009)

Maximizing the Area of Overlap of Two Unions of Disks under Rigid Motion. - Sergio Cabello; Mark de Berg; Panos Giannopoulos; Christian Knauer; René van Oostrum; Remco C. Veltkamp (Int. J. Comput. Geom. Appl., 2009)

Milling a Graph with Turn Costs: A Parameterized Complexity Perspective. - Mike Fellows; Panos Giannopoulos; Christian Knauer; Christophe Paul; Frances A. Rosamond; Sue Whitesides; Nathan Yu (WG, 2010)

Computing Geometric Minimum-Dilation Graphs is NP-Hard. - Panos Giannopoulos; Rolf Klein; Christian Knauer; Martin Kutz; Dániel Marx (Int. J. Comput. Geom. Appl., 2010)

Hardness of discrepancy computation and epsilon-net verification in high dimension - Panos Giannopoulos; Christian Knauer; Magnus Wahlström; Daniel Werner (CoRR, 2011)

Minimum cell connection and separation in line segment arrangements - Helmut Alt; Sergio Cabello; Panos Giannopoulos; Christian Knauer (CoRR, 2011)

Geometric clustering: Fixed-parameter tractability and lower bounds with respect to the dimension. - Sergio Cabello; Panos Giannopoulos; Christian Knauer; Dániel Marx; Günter Rote (ACM Trans. Algorithms, 2011)

Hardness of discrepancy computation and ε-net verification in high dimension. - Panos Giannopoulos; Christian Knauer; Magnus Wahlström; Daniel Werner (J. Complex., 2012)

On the Computational Complexity of Erdős-Szekeres and Related Problems in ℝ3. - Panos Giannopoulos; Christian Knauer; Daniel Werner (ESA, 2013)

Fixed-parameter tractability and lower bounds for stabbing problems. - Panos Giannopoulos; Christian Knauer; Günter Rote; Daniel Werner (Comput. Geom., 2013)

Finding a largest empty convex subset in space is W[1]-hard - Panos Giannopoulos; Christian Knauer (CoRR, 2013)

The Complexity of Separating Points in the Plane. - Sergio Cabello; Panos Giannopoulos (Algorithmica, 2016)

Minimum Cell Connection in Line Segment Arrangements. - Helmut Alt; Sergio Cabello; Panos Giannopoulos; Christian Knauer (Int. J. Comput. Geom. Appl., 2017)

QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs. - Édouard Bonnet; Panos Giannopoulos; Eun Jung Kim 002; Pawel Rzazewski; Florian Sikora (SoCG, 2018)

Geometric Multicut. - Mikkel Abrahamsen; Panos Giannopoulos; Maarten Löffler; Günter Rote (ICALP, 2019)

Orthogonal Terrain Guarding is NP-complete. - Édouard Bonnet; Panos Giannopoulos (J. Comput. Geom., 2019)

On the parameterized complexity of red-blue points separation. - Edouard Bonnet; Panos Giannopoulos; Michael Lampis (J. Comput. Geom., 2019)

Geometric Multicut: Shortest Fences for Separating Groups of Objects in the Plane. - Mikkel Abrahamsen; Panos Giannopoulos; Maarten Löffler; Günter Rote (Discret. Comput. Geom., 2020)

EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. - Marthe Bonamy; Édouard Bonnet; Nicolas Bousquet 001; Pierre Charbit; Panos Giannopoulos; Eun Jung Kim 002; Pawel Rzazewski; Florian Sikora; Stéphan Thomassé (J. ACM, 2021)

On k-Means for Segments and Polylines. - Sergio Cabello; Panos Giannopoulos (ESA, 2023)

Relationship between Irregularities of the Nuclear Envelope and Mitochondria in HeLa Cells Observed with Electron Microscopy. - Daniel Brito-Pacheco; Cefa Karabag; Carlos Brito-Loeza; Panos Giannopoulos; Constantino Carlos Reyes-Aldasoro (ISBI, 2024)

Searching in Euclidean Spaces with Predictions. - Sergio Cabello; Panos Giannopoulos (WAOA, 2024)

Persistent Homology and Gabor Features Reveal Inconsistencies Between Widely Used Colorectal Cancer Training and Testing Datasets. - Daniel Brito-Pacheco; Riad Ibadulla; Ximena Fernández; Panos Giannopoulos; Constantino Carlos Reyes-Aldasoro (MIUA (1), 2025)