Panos Giannopoulos

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2021

EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs.

[BibT_eX]

[DOI]

J. ACM, 2021

2020

Geometric Multicut: Shortest Fences for Separating Groups of Objects in the Plane.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2020

2019

On the parameterized complexity of red-blue points separation.

[BibT_eX]

[DOI]

Edouard Bonnet

Michael Lampis

J. Comput. Geom., 2019

Orthogonal Terrain Guarding is NP-complete.

[BibT_eX]

[DOI]

Édouard Bonnet

J. Comput. Geom., 2019

Geometric Multicut.

[BibT_eX]

[DOI]

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Computational Geometry, 2018

2017

Minimum Cell Connection in Line Segment Arrangements.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2017

2016

The Complexity of Separating Points in the Plane.

[BibT_eX]

[DOI]

Algorithmica, 2016

2013

Finding a largest empty convex subset in space is W[1]-hard

[BibT_eX]

[DOI]

CoRR, 2013

Fixed-parameter tractability and lower bounds for stabbing problems.

[BibT_eX]

[DOI]

Comput. Geom., 2013

On the Computational Complexity of Erdős-Szekeres and Related Problems in ℝ3.

[BibT_eX]

[DOI]

Daniel Werner

Proceedings of the Algorithms - ESA 2013, 2013

2012

Hardness of discrepancy computation and ε-net verification in high dimension.

[BibT_eX]

[DOI]

J. Complex., 2012

2011

Geometric clustering: Fixed-parameter tractability and lower bounds with respect to the dimension.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2011

Minimum cell connection and separation in line segment arrangements

[BibT_eX]

[DOI]

CoRR, 2011

Hardness of discrepancy computation and epsilon-net verification in high dimension

[BibT_eX]

[DOI]

CoRR, 2011

2010

Computing Geometric Minimum-Dilation Graphs is NP-Hard.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2010

Milling a Graph with Turn Costs: A Parameterized Complexity Perspective.

[BibT_eX]

[DOI]

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

2009

Maximizing the Area of Overlap of Two Unions of Disks under Rigid Motion.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2009

Abstract Milling with Turn Costs

[BibT_eX]

[DOI]

CoRR, 2009

The parameterized complexity of some geometric problems in unbounded dimension

[BibT_eX]

[DOI]

CoRR, 2009

The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension.

[BibT_eX]

[DOI]

Günter Rote

Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009

2008

Improving the Stretch Factor of a Geometric Network by Edge Augmentation.

[BibT_eX]

[DOI]

Mohammad Farshi

Joachim Gudmundsson

SIAM J. Comput., 2008

On the parameterized complexity of d-dimensional point set pattern matching.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

Matching point sets with respect to the Earth Mover's Distance.

[BibT_eX]

[DOI]

Comput. Geom., 2008

Parameterized Complexity of Geometric Problems.

[BibT_eX]

[DOI]

Sue Whitesides

Comput. J., 2008

Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension.

[BibT_eX]

[DOI]

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

2006

On the Parameterized Complexity of <i>d</i>-Dimensional Point Set Pattern Matching.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006

2005

Finding the best shortcut in a geometric network.

[BibT_eX]

[DOI]

Mohammad Farshi

Joachim Gudmundsson

Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

2003

Using transportation distances for measuring melodic similarity.

[BibT_eX]

[DOI]

Proceedings of the ISMIR 2003, 2003

2002

A Pseudo-Metric for Weighted Point Sets.

[BibT_eX]

[DOI]