Panos Giannopoulos

Publication Activity (10 Years)

Years Active: 2002-2023
Publications (10 Years): 17

Top Topics

Parameterized Complexity

Polynomially Solvable

Fixed Parameter Tractable

Top Venues

J. Comput. Geom.

Publications

Sergio Cabello, Panos Giannopoulos
On k-Means for Segments and Polylines. ESA (2023)
Sergio Cabello, Panos Giannopoulos
On k-means for segments and polylines. CoRR (2023)
Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora, Stéphan Thomassé
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. CoRR (2021)
Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora, Stéphan Thomassé
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. J. ACM 68 (2) (2021)
Mikkel Abrahamsen, Panos Giannopoulos, Maarten Löffler, Günter Rote
Geometric Multicut: Shortest Fences for Separating Groups of Objects in the Plane. Discret. Comput. Geom. 64 (3) (2020)
Édouard Bonnet, Panos Giannopoulos
Orthogonal Terrain Guarding is NP-complete. J. Comput. Geom. 10 (2) (2019)
Mikkel Abrahamsen, Panos Giannopoulos, Maarten Löffler, Günter Rote
Geometric Multicut. CoRR (2019)
Mikkel Abrahamsen, Panos Giannopoulos, Maarten Löffler, Günter Rote
Geometric Multicut. ICALP (2019)
Edouard Bonnet, Panos Giannopoulos, Michael Lampis
On the parameterized complexity of red-blue points separation. J. Comput. Geom. 10 (1) (2019)
Édouard Bonnet, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora
QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs. SoCG (2018)
Édouard Bonnet, Panos Giannopoulos
Orthogonal Terrain Guarding is NP-complete. SoCG (2018)
Helmut Alt, Sergio Cabello, Panos Giannopoulos, Christian Knauer
Minimum Cell Connection in Line Segment Arrangements. Int. J. Comput. Geom. Appl. 27 (3) (2017)
Édouard Bonnet, Panos Giannopoulos, Michael Lampis
On the Parameterized Complexity of Red-Blue Points Separation. IPEC (2017)
Édouard Bonnet, Panos Giannopoulos, Michael Lampis
On the Parameterized Complexity of Red-Blue Points Separation. CoRR (2017)
Édouard Bonnet, Panos Giannopoulos
Orthogonal Terrain Guarding is NP-complete. CoRR (2017)
Édouard Bonnet, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora
QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs. CoRR (2017)
Sergio Cabello, Panos Giannopoulos
The Complexity of Separating Points in the Plane. Algorithmica 74 (2) (2016)
Panos Giannopoulos, Christian Knauer, Günter Rote, Daniel Werner
Fixed-parameter tractability and lower bounds for stabbing problems. Comput. Geom. 46 (7) (2013)
Sergio Cabello, Panos Giannopoulos
The complexity of separating points in the plane. SoCG (2013)
Panos Giannopoulos, Christian Knauer, Daniel Werner
On the Computational Complexity of Erdős-Szekeres and Related Problems in ℝ3. ESA (2013)
Panos Giannopoulos, Christian Knauer
Finding a largest empty convex subset in space is W[1]-hard CoRR (2013)
Panos Giannopoulos, Christian Knauer, Magnus Wahlström, Daniel Werner
Hardness of discrepancy computation and ε-net verification in high dimension. J. Complex. 28 (2) (2012)
Sergio Cabello, Panos Giannopoulos, Christian Knauer, Dániel Marx, Günter Rote
Geometric clustering: Fixed-parameter tractability and lower bounds with respect to the dimension. ACM Trans. Algorithms 7 (4) (2011)
Helmut Alt, Sergio Cabello, Panos Giannopoulos, Christian Knauer
Minimum cell connection and separation in line segment arrangements CoRR (2011)
Panos Giannopoulos, Christian Knauer, Magnus Wahlström, Daniel Werner
Hardness of discrepancy computation and epsilon-net verification in high dimension CoRR (2011)
Panos Giannopoulos, Rolf Klein, Christian Knauer, Martin Kutz, Dániel Marx
Computing Geometric Minimum-Dilation Graphs is NP-Hard. Int. J. Comput. Geom. Appl. 20 (2) (2010)
Mike Fellows, Panos Giannopoulos, Christian Knauer, Christophe Paul, Frances A. Rosamond, Sue Whitesides, Nathan Yu
Milling a Graph with Turn Costs: A Parameterized Complexity Perspective. WG (2010)
Michael R. Fellows, Panos Giannopoulos, Christian Knauer, Christophe Paul, Frances A. Rosamond, Sue Whitesides, Nathan Yu
Abstract Milling with Turn Costs CoRR (2009)
Panos Giannopoulos, Christian Knauer, Günter Rote
The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension. IWPEC (2009)
Sergio Cabello, Mark de Berg, Panos Giannopoulos, Christian Knauer, René van Oostrum, Remco C. Veltkamp
Maximizing the Area of Overlap of Two Unions of Disks under Rigid Motion. Int. J. Comput. Geom. Appl. 19 (6) (2009)
Panos Giannopoulos, Christian Knauer, Günter Rote, Daniel Werner
The parameterized complexity of some geometric problems in unbounded dimension CoRR (2009)
Panos Giannopoulos, Christian Knauer, Günter Rote, Daniel Werner
Fixed-parameter tractability and lower bounds for stabbing problems CoRR (2009)
Sergio Cabello, Panos Giannopoulos, Christian Knauer
On the parameterized complexity of d-dimensional point set pattern matching. Inf. Process. Lett. 105 (2) (2008)
Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote
Matching point sets with respect to the Earth Mover's Distance. Comput. Geom. 39 (2) (2008)
Panos Giannopoulos, Christian Knauer, Sue Whitesides
Parameterized Complexity of Geometric Problems. Comput. J. 51 (3) (2008)
Mohammad Farshi, Panos Giannopoulos, Joachim Gudmundsson
Improving the Stretch Factor of a Geometric Network by Edge Augmentation. SIAM J. Comput. 38 (1) (2008)
Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote
Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension. SODA (2008)
Sergio Cabello, Panos Giannopoulos, Christian Knauer
-Dimensional Point Set Pattern Matching. IWPEC (2006)
Mohammad Farshi, Panos Giannopoulos, Joachim Gudmundsson
Finding the best shortcut in a geometric network. SCG (2005)
Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote
Matching point sets with respect to the Earth mover's distance. EuroCG (2005)
Mohammad Farshi, Panos Giannopoulos, Joachim Gudmundsson
Finding the best shortcut in a geometric network. EuroCG (2005)
Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote
Matching Point Sets with Respect to the Earth Mover's Distance. ESA (2005)
Mark de Berg, Sergio Cabello, Panos Giannopoulos, Christian Knauer, René van Oostrum, Remco C. Veltkamp
Maximizing the Area of Overlap of Two Unions of Disks Under Rigid Motion. SWAT (2004)
Rainer Typke, Panos Giannopoulos, Remco C. Veltkamp, Frans Wiering, René van Oostrum
Using transportation distances for measuring melodic similarity. ISMIR (2003)
Panos Giannopoulos, Remco C. Veltkamp
A Pseudo-Metric for Weighted Point Sets. ECCV (3) (2002)