default search action
Panos Giannopoulos
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c17]Daniel Brito-Pacheco, Cefa Karabag, Carlos Brito-Loeza, Panos Giannopoulos, Constantino Carlos Reyes-Aldasoro:
Relationship between Irregularities of the Nuclear Envelope and Mitochondria in HeLa Cells Observed with Electron Microscopy. ISBI 2024: 1-5 - [i15]Sergio Cabello, Panos Giannopoulos:
Searching in Euclidean Spaces with Predictions. CoRR abs/2408.04964 (2024) - 2023
- [c16]Sergio Cabello, Panos Giannopoulos:
On k-Means for Segments and Polylines. ESA 2023: 28:1-28:14 - [i14]Sergio Cabello, Panos Giannopoulos:
On k-means for segments and polylines. CoRR abs/2305.10922 (2023) - 2021
- [j15]Marthe Bonamy, Édouard Bonnet
, Nicolas Bousquet, Pierre Charbit
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. J. ACM 68(2): 9:1-9:38 (2021) - [i13]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 abs/2110.15419 (2021) - 2020
- [j14]Mikkel Abrahamsen
Geometric Multicut: Shortest Fences for Separating Groups of Objects in the Plane. Discret. Comput. Geom. 64(3): 575-607 (2020)
2010 – 2019
- 2019
- [j13]Edouard Bonnet, Panos Giannopoulos, Michael Lampis:
On the parameterized complexity of red-blue points separation. J. Comput. Geom. 10(1): 181-206 (2019) - [j12]Édouard Bonnet, Panos Giannopoulos:
Orthogonal Terrain Guarding is NP-complete. J. Comput. Geom. 10(2): 21-44 (2019) - [c15]Mikkel Abrahamsen
Geometric Multicut. ICALP 2019: 9:1-9:15 - [i12]Mikkel Abrahamsen, Panos Giannopoulos, Maarten Löffler, Günter Rote:
Geometric Multicut. CoRR abs/1902.04045 (2019) - 2018
- [c14]Édouard Bonnet, Panos Giannopoulos:
Orthogonal Terrain Guarding is NP-complete. SoCG 2018: 11:1-11:15 - [c13]Édouard Bonnet, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski
QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs. SoCG 2018: 12:1-12:15 - 2017
- [j11]Helmut Alt, Sergio Cabello, Panos Giannopoulos, Christian Knauer:
Minimum Cell Connection in Line Segment Arrangements. Int. J. Comput. Geom. Appl. 27(3): 159-176 (2017) - [c12]Édouard Bonnet, Panos Giannopoulos, Michael Lampis:
On the Parameterized Complexity of Red-Blue Points Separation. IPEC 2017: 8:1-8:13 - [i11]Édouard Bonnet, Panos Giannopoulos:
Orthogonal Terrain Guarding is NP-complete. CoRR abs/1710.00386 (2017) - [i10]Édouard Bonnet, Panos Giannopoulos, Michael Lampis:
On the Parameterized Complexity of Red-Blue Points Separation. CoRR abs/1710.00637 (2017) - [i9]Édouard Bonnet, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora:
QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs. CoRR abs/1712.05010 (2017) - 2016
- [j10]Sergio Cabello
The Complexity of Separating Points in the Plane. Algorithmica 74(2): 643-663 (2016) - 2013
- [j9]Panos Giannopoulos, Christian Knauer, Günter Rote, Daniel Werner:
Fixed-parameter tractability and lower bounds for stabbing problems. Comput. Geom. 46(7): 839-860 (2013) - [c11]Sergio Cabello, Panos Giannopoulos:
The complexity of separating points in the plane. SoCG 2013: 379-386 - [c10]Panos Giannopoulos, Christian Knauer, Daniel Werner:
On the Computational Complexity of Erdős-Szekeres and Related Problems in ℝ3. ESA 2013: 541-552 - [i8]Panos Giannopoulos, Christian Knauer:
Finding a largest empty convex subset in space is W[1]-hard. CoRR abs/1304.0247 (2013) - 2012
- [j8]Panos Giannopoulos, Christian Knauer, Magnus Wahlström
Hardness of discrepancy computation and ε-net verification in high dimension. J. Complex. 28(2): 162-176 (2012) - 2011
- [j7]Sergio Cabello
Geometric clustering: Fixed-parameter tractability and lower bounds with respect to the dimension. ACM Trans. Algorithms 7(4): 43:1-43:27 (2011) - [i7]Panos Giannopoulos, Christian Knauer, Magnus Wahlström, Daniel Werner:
Hardness of discrepancy computation and epsilon-net verification in high dimension. CoRR abs/1103.4503 (2011) - [i6]Helmut Alt, Sergio Cabello, Panos Giannopoulos, Christian Knauer:
Minimum cell connection and separation in line segment arrangements. CoRR abs/1104.4618 (2011) - 2010
- [j6]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): 147-173 (2010) - [c9]Mike Fellows
Milling a Graph with Turn Costs: A Parameterized Complexity Perspective. WG 2010: 123-134
2000 – 2009
- 2009
- [j5]Sergio Cabello
Maximizing the Area of Overlap of Two Unions of Disks under Rigid Motion. Int. J. Comput. Geom. Appl. 19(6): 533-556 (2009) - [c8]Panos Giannopoulos, Christian Knauer, Günter Rote:
The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension. IWPEC 2009: 198-209 - [i5]Panos Giannopoulos, Christian Knauer, Günter Rote, Daniel Werner:
The parameterized complexity of some geometric problems in unbounded dimension. CoRR abs/0906.3469 (2009) - [i4]Panos Giannopoulos, Christian Knauer, Günter Rote, Daniel Werner:
Fixed-parameter tractability and lower bounds for stabbing problems. CoRR abs/0906.3896 (2009) - [i3]Michael R. Fellows, Panos Giannopoulos, Christian Knauer, Christophe Paul, Frances A. Rosamond, Sue Whitesides, Nathan Yu:
Abstract Milling with Turn Costs. CoRR abs/0912.1050 (2009) - 2008
- [j4]Panos Giannopoulos, Christian Knauer, Sue Whitesides:
Parameterized Complexity of Geometric Problems. Comput. J. 51(3): 372-384 (2008) - [j3]Sergio Cabello
Matching point sets with respect to the Earth Mover's Distance. Comput. Geom. 39(2): 118-133 (2008) - [j2]Sergio Cabello
On the parameterized complexity of d-dimensional point set pattern matching. Inf. Process. Lett. 105(2): 73-77 (2008) - [j1]Mohammad Farshi, Panos Giannopoulos, Joachim Gudmundsson
Improving the Stretch Factor of a Geometric Network by Edge Augmentation. SIAM J. Comput. 38(1): 226-240 (2008) - [c7]Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote:
Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension. SODA 2008: 836-843 - 2006
- [c6]Sergio Cabello, Panos Giannopoulos, Christian Knauer:
On the Parameterized Complexity of d-Dimensional Point Set Pattern Matching. IWPEC 2006: 175-183 - 2005
- [c5]Mohammad Farshi, Panos Giannopoulos, Joachim Gudmundsson
Finding the best shortcut in a geometric network. SCG 2005: 327-335 - [c4]Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote:
Matching Point Sets with Respect to the Earth Mover's Distance. ESA 2005: 520-531 - [i2]Mohammad Farshi, Panos Giannopoulos, Joachim Gudmundsson:
Finding the best shortcut in a geometric network. EuroCG 2005: 29-32 - [i1]Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote:
Matching point sets with respect to the Earth mover's distance. EuroCG 2005: 57-60 - 2004
- [c3]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: 138-149 - 2003
- [c2]Rainer Typke, Panos Giannopoulos, Remco C. Veltkamp, Frans Wiering, René van Oostrum:
Using transportation distances for measuring melodic similarity. ISMIR 2003 - 2002
- [c1]Panos Giannopoulos, Remco C. Veltkamp:
A Pseudo-Metric for Weighted Point Sets. ECCV (3) 2002: 715-730
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-18 23:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: