Panos Giannopoulos

Cited by

	All	Since 2018
Citations	702	199
h-index	15	9
i10-index	20	7

2003200420052006200720082009201020112012201320142015201620172018201920202021202220239 24 32 25 37 44 28 49 31 29 47 41 37 26 25 36 30 38 26 45 24

Public access

View all

13 articles

2 articles

available

not available

Based on funding mandates

Co-authors

Christian KnauerInstitut für Informatik, Universität BayreuthVerified email at uni-bayreuth.de
Sergio CabelloUniversity of Ljubljana and Institute of Mathematics, Physics and MechanicsVerified email at fmf.uni-lj.si
Remco C. Veltkampprofessor of Computer Science, Utrecht UniversityVerified email at uu.nl
René van OostrumAMDVerified email at 59bits.nl
Édouard BonnetENS Lyon, LIP, FranceVerified email at ens-lyon.fr
Joachim GudmundssonUniversity of SydneyVerified email at sydney.edu.au
Rainer TypkeEuropean CommissionVerified email at ec.europa.eu
Frans WieringUtrecht UniversityVerified email at uu.nl
Sue WhitesidesProfessor of Computer Science, University of Victoria BCVerified email at uvic.ca
Dániel MarxCISPA Helmholtz Center for Information SecurityVerified email at cispa.saarland
M FarshiAssociate Prof. of Computer Science, Combinatorial & Geometric Algorithms lab, Yazd UniversityVerified email at yazd.ac.ir
Helmut AltFreie Universität BerlinVerified email at mi.fu-berlin.de
Mark de BergProfessor of Computer Science, TU EindhovenVerified email at win.tue.nl
Michael LampisLAMSADE, Université Paris DauphineVerified email at dauphine.fr
Magnus WahlströmRoyal Holloway, University of LondonVerified email at rhul.ac.uk
Frances rosamondUniversity of Bergen, NorwayVerified email at uib.no
Christophe PaulCNRS LIRMMVerified email at lirmm.fr
Florian SikoraLAMSADE, Université Paris-DauphineVerified email at dauphine.fr
Paweł RzążewskiWarsaw University of Technology, Faculty of Mathematics and Information ScienceVerified email at mini.pw.edu.pl
Eun Jung KimLAMSADEVerified email at dauphine.fr

Panos Giannopoulos

City, University of London

Verified email at city.ac.uk - Homepage

Algorithms Computational Geometry


Title Sort by citations Sort by year Sort by 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	188	2003
A pseudo-metric for weighted point sets P Giannopoulos, RC Veltkamp European Conference on Computer Vision, 715-730, 2002	88	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	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	35	2008
Parameterized complexity of geometric problems P Giannopoulos, C Knauer, S Whitesides The Computer Journal 51 (3), 372-384, 2008	34	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	31	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	27	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
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	23	2005
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	20	2009
Fixed-parameter tractability and lower bounds for stabbing problems P Giannopoulos, C Knauer, G Rote, D Werner Computational Geometry 46 (7), 839-860, 2013	19	2013
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	17	2017
The complexity of separating points in the plane S Cabello, P Giannopoulos Algorithmica 74 (2), 643-663, 2016	17	2016
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 red-blue points separation É Bonnet, P Giannopoulos, M Lampis arXiv preprint arXiv:1710.00637, 2017	15	2017
On some connection problems in straight-line segment arrangements H Alt, S Cabello, P Giannopoulos, C Knauer 27th EuroCG, 27-30, 2011	15	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	14	2010
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
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	13	2008
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	12	2010

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors