Follow
Panos Giannopoulos
Panos Giannopoulos
City, University of London
Verified email at city.ac.uk - Homepage
Title
Cited by
Cited by
Year
Using transportation distances for measuring melodic similarity.
R Typke, P Giannopoulos, RC Veltkamp, F Wiering, R Van Oostrum
ISMIR, 2003
1822003
A pseudo-metric for weighted point sets
P Giannopoulos, RC Veltkamp
European Conference on Computer Vision, 715-730, 2002
842002
Matching point sets with respect to the Earth Mover's Distance
S Cabello, P Giannopoulos, C Knauer, G Rote
Computational Geometry 39 (2), 118-133, 2008
362008
Improving the stretch factor of a geometric network by edge augmentation
M Farshi, P Giannopoulos, J Gudmundsson
SIAM Journal on Computing 38 (1), 226-240, 2008
352008
Parameterized complexity of geometric problems
P Giannopoulos, C Knauer, S Whitesides
The Computer Journal 51 (3), 372-384, 2008
342008
Hardness of discrepancy computation and ε-net verification in high dimension
P Giannopoulos, C Knauer, M Wahlström, D Werner
Journal of Complexity 28 (2), 162-176, 2012
272012
On the parameterized complexity of d-dimensional point set pattern matching
S Cabello, P Giannopoulos, C Knauer
INFORMATION PROCESSING LETTERS 105 (2), 73-77, 2007
252007
Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension
S Cabello, P Giannopoulos, C Knauer, D Marx, G Rote
ACM Transactions on Algorithms (TALG) 7 (4), 43, 2011
232011
Finding the best shortcut in a geometric network
M Farshi, P Giannopoulos, J Gudmundsson
Proceedings of the twenty-first annual symposium on Computational geometry …, 2005
232005
The parameterized complexity of some geometric problems in unbounded dimension
P Giannopoulos, C Knauer, G Rote
International Workshop on Parameterized and Exact Computation, 198-209, 2009
192009
Fixed-parameter tractability and lower bounds for stabbing problems
P Giannopoulos, C Knauer, G Rote, D Werner
Computational Geometry 46 (7), 839-860, 2013
182013
The complexity of separating points in the plane
S Cabello, P Giannopoulos
Algorithmica 74 (2), 643-663, 2016
172016
Matching point sets with respect to the earth mover’s distance
S Cabello, P Giannopoulos, C Knauer, G Rote
European Symposium on Algorithms, 520-531, 2005
162005
On some connection problems in straight-line segment arrangements
H Alt, S Cabello, P Giannopoulos, C Knauer
27th EuroCG, 27-30, 2011
152011
QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs
É Bonnet, P Giannopoulos, EJ Kim, P Rzążewski, F Sikora
arXiv preprint arXiv:1712.05010, 2017
142017
On the parameterized complexity of d-dimensional point set pattern matching
S Cabello, P Giannopoulos, C Knauer
International Workshop on Parameterized and Exact Computation, 175-183, 2006
142006
On the parameterized complexity of red-blue points separation
É Bonnet, P Giannopoulos, M Lampis
arXiv preprint arXiv:1710.00637, 2017
132017
Computing geometric minimum-dilation graphs is NP-hard
P Giannopoulos, R Klein, C Knauer, M Kutz, D Marx
International Journal of Computational Geometry & Applications 20 (02), 147-173, 2010
122010
Milling a graph with turn costs: a parameterized complexity perspective
M Fellows, P Giannopoulos, C Knauer, C Paul, F Rosamond, ...
International Workshop on Graph-Theoretic Concepts in Computer Science, 123-134, 2010
112010
Milling a graph with turn costs: a parameterized complexity perspective| NOVA. The University of Newcastle's Digital Repository
M Fellows, P Giannopoulos, C Knauer, C Paul, F Rosamond, ...
Springer, 2010
11*2010
The system can't perform the operation now. Try again later.
Articles 1–20