Using transportation distances for measuring melodic similarity. R Typke, P Giannopoulos, RC Veltkamp, F Wiering, R Van Oostrum ISMIR, 2003 | 198 | 2003 |
A pseudo-metric for weighted point sets P Giannopoulos, RC Veltkamp European Conference on Computer Vision, 715-730, 2002 | 84 | 2002 |
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 | 42 | 2008 |
Parameterized complexity of geometric problems P Giannopoulos, C Knauer, S Whitesides The Computer Journal 51 (3), 372-384, 2008 | 37 | 2008 |
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 | 36 | 2008 |
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 | 33 | 2012 |
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 | 29 | 2007 |
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 | 25 | 2011 |
EPTAS and subexponential algorithm for maximum clique on disk and unit ball graphs M Bonamy, É Bonnet, N Bousquet, P Charbit, P Giannopoulos, EJ Kim, ... Journal of the ACM (JACM) 68 (2), 1-38, 2021 | 23 | 2021 |
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 | 22 | 2005 |
On the parameterized complexity of red-blue points separation É Bonnet, P Giannopoulos, M Lampis arXiv preprint arXiv:1710.00637, 2017 | 21 | 2017 |
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 | 20 | 2017 |
The complexity of separating points in the plane S Cabello, P Giannopoulos Algorithmica 74 (2), 643-663, 2016 | 20 | 2016 |
Fixed-parameter tractability and lower bounds for stabbing problems P Giannopoulos, C Knauer, G Rote, D Werner Computational Geometry 46 (7), 839-860, 2013 | 20 | 2013 |
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 | 19 | 2009 |
On some connection problems in straight-line segment arrangements H Alt, S Cabello, P Giannopoulos, C Knauer 27th EuroCG, 27-30, 2011 | 17 | 2011 |
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 | 16 | 2010 |
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 | 16 | 2005 |
On the parameterized complexity of d-dimensional point set pattern matching S Cabello, P Giannopoulos, C Knauer Information Processing Letters 105 (2), 73-77, 2008 | 15 | 2008 |
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 | 14 | 2006 |