Items where Author / Artist / Editor is "Giannopoulos, Panos"

See full list of headings
Export as [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | No Grouping
Number of items: 6.

Article

Alt, Helmut, Cabello, Sergio, Giannopoulos, Panos and Knauer, Christian (2017) Minimum cell connection in line segment arrangements. International Journal of Computational Geometry and Applications, 27 (3). pp. 159-176. ISSN 1793-6357 (doi:10.1142/s0218195917500017)

Cabello, Sergio and Giannopoulos, Panos (2016) The complexity of separating points in the plane. Algorithmica, 74 (2). pp. 643-663. ISSN 0178-4617 (doi:10.1007/s00453-014-9965-6)

Conference or Workshop Item

Bonnet, Edouard, Giannopoulos, Panos, Kim, Eun Jung, Rzążewski, Paweł and Sikora, Florian (2018) QPTAS and subexponential algorithm for maximum clique on disk graphs. In: 34th International Symposium on Computational Geometry, 11-14 Jun 2018, Budapest, Hungary. (doi:10.4230/LIPIcs.SoCG.2018.12)

Bonnet, Edouard and Giannopoulos, Panos (2018) Orthogonal terrain guarding is NP-complete. In: 34th International Symposium on Computational Geometry (SoCG 2018), 11-14 Jun 2018, Budapest, Hungary. (doi:10.4230/LIPIcs.SoCG.2018.11)

Bonnet, Edouard, Giannopoulos, Panos and Lampis, Michael (2018) On the parameterized complexity of red-blue points separation. In: 12th International Symposium on Parameterized and Exact Computation (IPEC 2017), 06-08 Sep 2017, Vienna, Austria. (doi:10.4230/LIPIcs.IPEC.2017.8)

Giannopoulos, Panos, Konzack, Maximilian and Mulzer, Wolfgang (2014) Low-crossing spanning trees: an alternative proof and experiments. In: European Workshop on Computational Geometry, 03-05 Mar 2014, Ein-Gedi, Israel.

This list was generated on Thu Nov 14 05:17:07 2019 GMT.