( en | de | ru )

 

Disambiguation of "Giannopoulos, Panos"

Author of the publication

copydeleteadd this publication to your clipboard
Computing Geometric Minimum-Dilation Graphs is NP-Hard.

, , , , and . Int. J. Comput. Geom. Appl., 20 (2): 147-173 (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Krzysztof Giannopoulos

Nikos Giannopoulos

Athanassios Giannopoulos

Ara Panosyan

Ara Panosyan

 

Other publications of authors with the same name

The Complexity of Separating Points in the Plane., and . Algorithmica, 74 (2): 643-663 (2016)Geometric clustering: Fixed-parameter tractability and lower bounds with respect to the dimension., , , , and . ACM Trans. Algorithms, 7 (4): 43:1-43:27 (2011)Maximizing the Area of Overlap of Two Unions of Disks under Rigid Motion., , , , , and . Int. J. Comput. Geom. Appl., 19 (6): 533-556 (2009)Orthogonal Terrain Guarding is NP-complete., and . J. Comput. Geom., 10 (2): 21-44 (2019)Geometric Multicut: Shortest Fences for Separating Groups of Objects in the Plane., , , and . Discret. Comput. Geom., 64 (3): 575-607 (2020)On the Computational Complexity of Erdős-Szekeres and Related Problems in ℝ3., , and . ESA, volume 8125 of Lecture Notes in Computer Science, page 541-552. Springer, (2013)Improving the Stretch Factor of a Geometric Network by Edge Augmentation., , and . SIAM J. Comput., 38 (1): 226-240 (2008)Computing Geometric Minimum-Dilation Graphs is NP-Hard., , , , and . Int. J. Comput. Geom. Appl., 20 (2): 147-173 (2010)Abstract Milling with Turn Costs, , , , , , and . CoRR, (2009)The parameterized complexity of some geometric problems in unbounded dimension, , , and . CoRR, (2009)