Dr. Panos Giannopoulos

Raum 2.50

Email:

Telefon: +49 921557746

Telefax: +49 921557742

2011

[4] Geometric clustering: Fixed-parameter tractability and lower bounds with respect to the dimension (Sergio Cabello, Panos Giannopoulos, Christian Knauer, Dániel Marx, Günter Rote), In ACM Transactions on Algorithms, volume 7, 2011. [bib] [doi]

2010

[3] Computing Geometric Minimum-Dilation Graphs is NP-Hard (Panos Giannopoulos, Rolf Klein, Christian Knauer, Martin Kutz, Dániel Marx), In Int. J. Comput. Geometry Appl., volume 20, 2010. [bib] [doi]

2009

[2] Maximizing the Area of Overlap of Two Unions of Disks under Rigid Motion (Sergio Cabello, Mark de Berg, Panos Giannopoulos, Christian Knauer, René van Oostrum, Remco C. Veltkamp), In Int. J. Comput. Geometry Appl., volume 19, 2009. [bib] [doi]

[1] The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension (Panos Giannopoulos, Christian Knauer, Günter Rote), In IWPEC (Jianer Chen, Fedor V. Fomin, eds.), Springer, volume 5917, 2009. [bib] [doi]

2011
[4]	Geometric clustering: Fixed-parameter tractability and lower bounds with respect to the dimension (Sergio Cabello, Panos Giannopoulos, Christian Knauer, Dániel Marx, Günter Rote), In ACM Transactions on Algorithms, volume 7, 2011. [bib] [doi]
2010
[3]	Computing Geometric Minimum-Dilation Graphs is NP-Hard (Panos Giannopoulos, Rolf Klein, Christian Knauer, Martin Kutz, Dániel Marx), In Int. J. Comput. Geometry Appl., volume 20, 2010. [bib] [doi]
2009
[2]	Maximizing the Area of Overlap of Two Unions of Disks under Rigid Motion (Sergio Cabello, Mark de Berg, Panos Giannopoulos, Christian Knauer, René van Oostrum, Remco C. Veltkamp), In Int. J. Comput. Geometry Appl., volume 19, 2009. [bib] [doi]
[1]	The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension (Panos Giannopoulos, Christian Knauer, Günter Rote), In IWPEC (Jianer Chen, Fedor V. Fomin, eds.), Springer, volume 5917, 2009. [bib] [doi]