Curriculum Vitae

Dr. habil. Panos Giannopoulos

Personal Details

Name: Panos GiannopoulosAddress: 7 Merchon House

Anson RoadLondon, N7 0RGUK

Tel. (mob.): +44 (0)7749 144755Email1: p.giannopoulos@mdx.ac.ukWeb: http://www.eis.mdx.ac.uk

/staffpages/panosgiannopoulos/

Current Positions

09/2014– Lecturer (tenured, equivalent to U.S. Assistant Professor)

Middlesex University, London, UK

Previous Positions

03/2014–08/2014 Researcher

Algorithms und Data StructuresInstitut fur Informatik, Universitat Bayreuth, Germany

Project: “Parameterized complexity of geometric problems” (DFG, 3rd phase)

01/2014–05/2014 Researcher

Mathematical Geometry ProcessingInstitut fur Informatik und Mathematik, Freie Universitat Berlin, Germany

Project: MATHEON, F4 “Topological Methods in Shape Analysis”

06/2011–12/2013 Lecturer

Theoretical Computer ScienceInstitut fur Informatik, Freie Universitat Berlin, Germany

and Researcher

Algorithms und Data StructuresInstitut fur Informatik, Universitat Bayreuth, Germany

Project: “Parameterized complexity of geometric problems” (DFG, 2nd phase)

09/2010–03/2011 Service to the Greek Army (Compulsory)

06/2008–07/2010 Researcher & LecturerTheoretical Computer ScienceInstitut fur Informatik, Freie Universitat Berlin, Germany

Project: “Parameterized complexity of geometric problems” (DFG, 1st phase)

12/2007–05/2008 Post-doctoral positionAlgorithms in Computational Genomics at TAUSchool of Computer Science, Tel Aviv University, IsraelProject: “Graph Drawing in Biological Networks” (EU)

01/2007–10/2007 Research AssociateTheoretical Computer ScienceInstitut fur Informatik, Freie Universitat Berlin, Germany

10/2005–12/2006 Post-doctoral positionLogic in Computer ScienceInstitut fur Informatik, Humboldt Universitat zu Berlin, GermanyProject: “Parameterized complexity theory” (DFG, 2nd phase)

09/2002–12/2002 Marie Curie ScholarEuropean Graduate Program ”Combinatorics, Geometry, and Computation”Theoretical Computer Science,Institut fur Informatik, Freie Universitat Berlin, Germany

02/2000–08/2005 Research AssistantCenter for Geometry, Imaging and Virtual EnvironmentsInstitute of Information and Computing Sciences,Utrecht University, The NetherlandsProject: “Shape Matching Environment” (STW)

1998–1999 Software EngineerOrchestream Ltd. (acquired by MetaSolv in 2003) , London, UKProject: Quality of Service in Computer Networks

Other positions offered

2010 Assistant Professor (Tenured), Department of Informatics, Ionian University,Corfu, Greece (Declined)

Education, Diplomas

2013 Habilitation in Computer ScienceFreie Universitat Berlin, GermanyThesis: Parameterized complexity results for geometric optimisation problems

2005 PhD in Computer ScienceUtrecht University, The NetherlandsThesis: Geometric matching of weighted point sets

1998 M.Sc. in Advanced ComputingDepartment of ComputingImperial College, University of London, UK

1997 Diploma (B.Sc.) in Computer Engineering and InformaticsDepartment of Computer Engineering and InformaticsUniversity of Patras, Greece

Research Interests

Exact and approximation algorithms, parameterized complexity, computational geometry, geo-metric optimization. In particular, I study fundamental algorithmic problems coming from shapematching and computer vision, geometric graphs and networks, sensor networks, and discretegeometry and optimization (see also Publications section).

Program Committees

ACM Symposium on Computational Geometry, Video and Multimedia Presentation (2012)

Teaching Experience

In general, I enjoy teaching courses with a theoretical/algorithmic component. In my classes, Istrive for teaching students (i) problem solving skills and (ii) rigor. Moreover, as it’s necessary fortheory courses, I always make the material taught relevant by giving the motivation backgroundwith many application examples. I have taught the following courses:

Computational Geometry (Lecturer 50%, 4h lec.+2h tut./week, FU Berlin, 2013):This is a course on algorithms for problems that involve geometric input objects. It includes,

for example, segment-segment intersections, convex hull, triangulations, Voronoi diagrams, linearprogramming, spatial data structures, visibility and shortest paths in geometric environments.The applications of such problems are numerous and come from such fields as computer graphics,computer vision, motion planning, cartography etc.

Geometric Computing and CGAL (Lecturer 100%, 2h lec.+2h. tut./week, FU Berlin, 2012/2013):This is software project oriented course, where the students learn how to implement geometric

algorithms. Basic concepts and algorithms are first explained in class, then students are given pro-gramming assignments. The students also learn how to use CGAL (the Computational GeometryAlgorithms Library) and several advanced programming techniques (traits classes, kernels etc.)

Approximation Algorithms (Lecturer 100%, 2h lec.+2h tut./week, FU Berlin, 2012):This course is on algorithms for solving hard problems, for which no polynomial-time algorithms

are known or expected to exist. The students learn the concept of finding an approximate solution(with some guarantee) and several basic and advanced techniques for devising algorithms thatproduce such solutions. We study graph problems, scheduling problems, satisfiability problems,etc.

Parameterized Complexity (Lecturer 100%, 2h lec.+2h tut./week, FU Berlin, 2009):This is another course on algorithms for solving hard problems, however, in contrast to approx-

imation algorithms, the focus is on algorithms for obtaining exact solutions, albeit in exponentialtime, confining exponentiality in input parameters. This course is relatively new, as is the theoryof parameterized complexity. We study mainly optimization problems on graphs.

Software Development (Lecturer 30%, 3h lec/week, Middlesex U., London, 2014/15)

Information Security Management (Lecturer 50%, 3h lec/week, Middlesex U., London, 2014/15)—Computational Geometry (Teaching assistant, IICS, Utrecht, 2003)Computer Graphics (Teaching assistant, IICS, Utrecht, 2001)

PhD Students Advisor

Daniel Werner, FU-Berlin (2009 – 2013, with Prof. Dr. Christian Knauer)

Master Students Advisor

Maximilian Konzack, FU-Berlin (2013, with Prof. Dr. Wolfgang Mulzer)Paul Seiferth, FU-Berlin (2012, with Prof. Dr. Wolfgang Mulzer)Daniel Werner, FU-Berlin (2009, with Prof. Dr. Christian Knauer)Idan Zohar, Tel Aviv University (2008, with Prof. Dr. Ron Shamir)

External Funding (joint PI)

2013–2014 ECOPAY-local (together with Dr. Astrid Sturm, in cooperation with theHelmholtz Center for Environmental Research - UFZ) (Budget: 50K, funded byINBO: Scientific Research Institute for Nature and Forest, Brussels, Belgium)

Scholarships, Fellowships

Edmond J. Safra Bioinformatics Program Fellowship (2007)ICSI, Berkley, USA (2007, Declined)Marie Curie scholarship, European Graduate Program CGC (2002)EPSRC (UK Research Council) fees scholarship, M.Sc. in Advanced Computing (1997)

Regular reviewer for conferences and journals

CGTA, DCG, ACM TALG, J. of Experimental Algorithms, Eur. J. of Operation Research, JoCG,SoCG, SODA, STOC, ESA, STACS, WADS, SWAT, ICALP, WG, etc.

Invited Talks

‘Fixed-parameter tractability and lower bounds for geometric optimisation problems’, Dep. ofComputer and Information Science, University of Ljubljana, Slovenia, 2014.

‘The complexity of connecting and separating points in the plane’, Seminar of Combinatoricsand Operations Research (CRO) Group, Laboratoire d‘Informatique Fondamentale de Marseille,CNRS, Aix*Marseille Universite, 2013

‘On the computational complexity of Erdos-Szekeres and related problems in R3’, Joint Mathe-matical Conference of the Catalan, Slovenian, Austrian, Slovak, and Czech Mathematical Societies(CSASC 2013), Koper, Slovenia, 2013

‘Parameterized complexity of geometric problems’, Tokyo Institute of Technology, Tokyo, Japan,2009

Participation in Research Workshops (Invited)

International INRIA-McGill (Barbados) Workshop on Computational Geometry (2007, 2010)‘Geometric Networks, Metric Space Embeddings and Spatial Data Mining’, Dagstuhl (2009)German-Korean Workshop on Computational Geometry, Dagstuhl, Germany (2007, 2010, 2014)

Short-term research visits

Dep. of Mathematics, University of Ljubljana, Slovenia. Host: Dr. S. Cabello (2006–2013)POSTECH, Pohang, Korea. Host: Ass. Prof. Dr. Hee-Kap Ahn (Jan. 2010)Tokyo Institute of Technology, Tokyo, Japan. Host: Dr. Y. Okamoto (Nov. 2009)GSIS, Tohoku University, Japan. Host: Prof. Dr. T. Tokuyama (Oct. 2009)

Programming Skills

C++, Generic Programming, Design Patterns, CGAL(CGAL developer since 2012: extending the Arrangements package (with E. Fogel (TAU, IL))

Language Knowledge Skills

Greek (native), English (fluent), German (fair), Dutch (basic)

Erdos number

3

Publications(Citation count: 367, h index:10, according to a recent Google Scholar search)

(Note: Authors in Theoretical Computer Science articles appear in alphabetical order.)

Submitted

S-1 H. Alt, S. Cabello, P. Giannopoulos, and C. Knauer. Minimum cell connection in line segmentarrangements. Submitted to International J. Computational Geometry and Applications.

Journals (Refereed)

J-1 S. Cabello and P. Giannopoulos. The complexity of separating points in the plane.Accepted at Algorithmica, Springer, 2014.

J-2 P. Giannopoulos, C. Knauer, and D. Werner. On the computational complexity of Erdos-Szekeres and related problems in R3. Accepted at Discrete & Computational Geometry,Springer, 2014.

J-3 P. Giannopoulos, C. Knauer, G. Rote, and D. Werner. Fixed-parameter tractability andlower bounds for stabbing problems. Computational Geometry Theory and Applications 46(7), pages 839–860, Elsevier, 2013.

J-4 P. Giannopoulos, C. Knauer, M. Wahlstrom, and D. Werner. Hardness of discrepancy and re-lated problems parameterized by the dimension. J. Complexity (28), pages 162–176, Elsevier,2012.

J-5 S. Cabello, P. Giannopoulos, C. Knauer, D. Marx, and G. Rote. Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension. ACM Transactionson Algorithms, 7 (4), pages 43:1–43:27, ACM, 2011.

J-6 P. Giannopoulos, R. Klein, C. Knauer, M. Kutz, and D. Marx. Computing geometric minimum-dilation graphs is NP-hard. International J. Computational Geometry and Applications, 20(2), pages 147–173, WSPC, 2010.

J-7 S. Cabello, M. de Berg, P. Giannopoulos, C. Knauer, R. van Oostrum, and R. C. Veltkamp.Maximizing the Area of Overlap of two Unions of Disks under Rigid Motion. International J.Computational Geometry and Applications, 19 (6), pages 533–556, WSPC, 2009.

J-8 M. Farshi, P. Giannopoulos, and J. Gudmundsson. Improving the stretch factor of a geometricnetwork by edge augmentation. SIAM J. on Computing, 38 (1), pages 226–240, SIAM, 2008.

J-9 S. Cabello, P. Giannopoulos, C. Knauer, and G. Rote. Matching Point Sets with respect tothe Earth Mover’s Distance. Computational Geometry, Theory and Applications, 39, pages118–133, Elsevier, 2008.

J-10 S. Cabello, P. Giannopoulos, and C. Knauer. On the parameterized complexity of d-dimensionalpoint set pattern matching. Information Processing Letters, 105, pages 73–77, Elsevier, 2008.

J-11 P. Giannopoulos, C. Knauer, and S. Whitesides. Parameterized complexity of geometricproblems. The Computer Journal, 51 (3), pages 372-384 Oxford University Press, 2008.

Conferences & Workshops (Refereed)

C-1 P. Giannopoulos, Maximilian Konzack, and Wolfgang Mulzer. Low-Crossing Spanning Trees:an Alternative Proof and Experiments. In Abstracts of the 30th European Workshop onComputational Geometry (EuroCG), 2014.

C-2 S. Cabello and P. Giannopoulos. The complexity of separating points in the plane. In Proc.of the 29th ACM Symp. on Computational Geometry (SoCG), pages 379–386, ACM, 2013.

C-3 P. Giannopoulos, C. Knauer, and D. Werner. On the computational complexity of Erdos-Szekeres and related problems in R3. In Proc of the 21st European Symposium on Algorithms(ESA), LNCS 8125, pages 541–552, Springer, 2013.

C-4 P. Giannopoulos and C. Knauer. Finding a largest empty convex subset in space is W[1]-hard.In Abstracts of the 29th European Workshop on Computational Geometry (EuroCG), pages65–68, 2013.

C-5 H. Alt, S. Cabello, P. Giannopoulos, and C. Knauer. On some connection problems in straight-line segment arrangements. In Abstracts of the 27th European Workshop on ComputationalGeometry (EuroCG), pages 27–30, 2011.

C-6 M. Fellows, P. Giannopoulos, C. Knauer, C. Paul, F. Rosamond, S. Whitesides, N. Yu. Graphmilling with turn costs: A parameterized complexity perspective. In Proc. 36th InternationalWorkshop on Graph Theoretic Concepts in Computer Science (WG), LNCS 6410, pages 123–134, Springer, 2010.

C-7 P. Giannopoulos, C. Knauer, and G. Rote. The parameterized complexity of some geometricproblems in unbounded dimension. In Proc. 4rt International Workshop on ParameterizedComplexity and Exact Computation (IWPEC), LNCS 5917, pages 198–209, Springer, 2009.

C-8 S. Cabello, P. Giannopoulos, C. Knauer, and G. Rote. Geometric clustering: fixed-parametertractability and lower bounds with respect to the dimension. In Proc. 19th ACM-SIAMSymposium on Discrete Algorithms (SODA), pages 836–843, ACM, 2008.

C-9 P. Giannopoulos, C. Knauer, D. Marx. Minimum-dilation tour (and path) is NP-hard. InAbstracts of the 23th European Workshop on Computational Geometry (EuroCG), 2007.

C-10 S. Cabello, P. Giannopoulos and C. Knauer. On the parameterized complexity of d-dimensionalpoint set pattern matching. In Proc. 2nd International Workshop on Parameterized Com-plexity and Exact Computation (IWPEC), LNCS 4169, pages 175–183, Springer, 2006.

C-11 S. Cabello, P. Giannopoulos, C. Knauer, and G. Rote. Matching Point Sets with respectto the Earth Mover’s Distance. In Proc. 13th Annual European Symposium on Algorithms(ESA), LNCS 3669, pages 520–531, Springer, 2005.

C-12 M. Farshi, P. Giannopoulos, and J. Gudmundsson. Finding the best shortcut in a geometricnetwork. In Proc. 21st ACM Symp. on Computational Geometry (SoCG), pages 327–335,ACM, 2005.

C-13 S. Cabello, M. de Berg, P. Giannopoulos, and C. Knauer. Maximizing the Area of Overlap oftwo Unions of Disks under Rigid Motion. In Proc. 9th Scandinavian Workshop on AlgorithmTheory (SWAT), LNCS 3111, pages 138–149, Springer, 2004.

C-14 R. Typke, P. Giannopoulos, R. C. Veltkamp, F. Wiering, and R. van Oostrum. Using trans-portation distances for measuring melodic similarity. In Proc. 4th International Conferenceon Music Information Retrieval (ISMIR), pages 107–114, Baltimore: Johns Hopkins Univer-sity, 2003.

C-15 P. Giannopoulos and R. C. Veltkamp. A Pseudo-Metric for Weighted Point Sets. In Proc. 7thEuropean Conference on Computer Vision (ECCV), LNCS 2353, pages 715–730, Springer,2002.

Technical reports

TR-1 M. de Berg, P. Giannopoulos, C. Knauer, R. van Oostrum, and R. C. Veltkamp. Maximizingthe area of overlap of two unions of disks under rigid motion. IICS, Utrecht University, TheNetherlands, UU-CS-2003-025, 2003.

Habilitation ThesisParameterized complexity results for geometric optimization problems, FU Berlin, 2013.

PhD ThesisGeometric matching of weighted point sets. Ph.D. Thesis, Utrecht University, 2005. ISBN 90-393-4021-8.

References

• Prof. Dr. Gunter RoteInstitut fur InformatikFreie Universitat BerlinTakustraße 9, D-14195 Berlin, Germanyrote@inf.fu-berlin.de+49-30-83875150

• Prof. Dr. Christian KnauerInstitut fur InformatikUniversitat BayreuthUniversitatsstrasse 30, 95447 Bayreuth, Germanychristian.knauer@uni-bayreuth.de+49-921-557740

• Prof. Dr. Helmut AltInstitut fur InformatikFreie Universitat BerlinTakustraße 9, D-14195 Berlin, Germanyalt@inf.fu-berlin.de+49-30-83875160

• Prof. Dr. Remco C. VeltkampDepartment of Information and Computing Sciences,Universiteit Utrecht,P.O. Box 80.089 3508 TB Utrecht,The NetherlandsR.C.Veltkamp@uu.nl+31-30-2534091

• Prof. Dr. Martin GroheRWTH AachenLehrstuhl fur Informatik 7, 52056 Aachen, Germanygrohe@informatik.rwth-aachen.de+49-241-8021710

• Prof. Dr. Mark de BergDepartment of Mathematics and Computing ScienceTU EindhovenP.O. Box 513, 5600 MB EindhovenThe Netherlandsm.t.d.berg@tue.nl+31-40-2472150