Panos Giannopoulos

52 papers A* 5A 4B 3C 2Journal 30Unranked 8

Year	Rank	Type	Title / Venue / Authors
2026	A	`conf`	Delaunay Triangulations with Predictions. ITCS Sergio Cabello, Timothy M. Chan, Panos Giannopoulos
2026	J	`jnl`	Delaunay Triangulations with Predictions. CoRR Sergio Cabello, Timothy M. Chan, Panos Giannopoulos
2025	J	`jnl`	Near-Linear and Parameterized Approximations for Maximum Cliques in Disk Graphs. CoRR Jie Gao, Pawel Gawrychowski, Panos Giannopoulos, Wolfgang Mulzer, Satyam Singh, Frank Staals, Meirav Zehavi
2025	—	`conf`	Persistent Homology and Gabor Features Reveal Inconsistencies Between Widely Used Colorectal Cancer Training and Testing Datasets. MIUA (1) Daniel Brito-Pacheco, Riad Ibadulla, Ximena Fernández, Panos Giannopoulos, Constantino Carlos Reyes-Aldasoro
2024	—	`conf`	Relationship between Irregularities of the Nuclear Envelope and Mitochondria in HeLa Cells Observed with Electron Microscopy. ISBI Daniel Brito-Pacheco, Cefa Karabag, Carlos Brito-Loeza, Panos Giannopoulos, Constantino Carlos Reyes-Aldasoro
2024	B	`conf`	Searching in Euclidean Spaces with Predictions. WAOA Sergio Cabello, Panos Giannopoulos
2024	J	`jnl`	Searching in Euclidean Spaces with Predictions. CoRR Sergio Cabello, Panos Giannopoulos
2023	A	`conf`	On k-Means for Segments and Polylines. ESA Sergio Cabello, Panos Giannopoulos
2023	J	`jnl`	On k-means for segments and polylines. CoRR Sergio Cabello, Panos Giannopoulos
2021	J	`jnl`	EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. CoRR Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora, Stéphan Thomassé
2021	J	`jnl`	EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. J. ACM Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora, Stéphan Thomassé
2020	J	`jnl`	Geometric Multicut: Shortest Fences for Separating Groups of Objects in the Plane. Discret. Comput. Geom. Mikkel Abrahamsen, Panos Giannopoulos, Maarten Löffler, Günter Rote
2019	A*	`conf`	Geometric Multicut. ICALP Mikkel Abrahamsen, Panos Giannopoulos, Maarten Löffler, Günter Rote
2019	J	`jnl`	Geometric Multicut. CoRR Mikkel Abrahamsen, Panos Giannopoulos, Maarten Löffler, Günter Rote
2019	J	`jnl`	On the parameterized complexity of red-blue points separation. J. Comput. Geom. Edouard Bonnet, Panos Giannopoulos, Michael Lampis
2019	J	`jnl`	Orthogonal Terrain Guarding is NP-complete. J. Comput. Geom. Édouard Bonnet, Panos Giannopoulos
2018	A*	`conf`	Orthogonal Terrain Guarding is NP-complete. SoCG Édouard Bonnet, Panos Giannopoulos
2018	A*	`conf`	QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs. SoCG Édouard Bonnet, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora
2017	J	`jnl`	Minimum Cell Connection in Line Segment Arrangements. Int. J. Comput. Geom. Appl. Helmut Alt, Sergio Cabello, Panos Giannopoulos, Christian Knauer
2017	B	`conf`	On the Parameterized Complexity of Red-Blue Points Separation. IPEC Édouard Bonnet, Panos Giannopoulos, Michael Lampis
2017	J	`jnl`	On the Parameterized Complexity of Red-Blue Points Separation. CoRR Édouard Bonnet, Panos Giannopoulos, Michael Lampis
2017	J	`jnl`	Orthogonal Terrain Guarding is NP-complete. CoRR Édouard Bonnet, Panos Giannopoulos
2017	J	`jnl`	QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs. CoRR Édouard Bonnet, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora
2016	J	`jnl`	The Complexity of Separating Points in the Plane. Algorithmica Sergio Cabello, Panos Giannopoulos
2013	J	`jnl`	Finding a largest empty convex subset in space is W[1]-hard CoRR Panos Giannopoulos, Christian Knauer
2013	J	`jnl`	Fixed-parameter tractability and lower bounds for stabbing problems. Comput. Geom. Panos Giannopoulos, Christian Knauer, Günter Rote, Daniel Werner
2013	A	`conf`	On the Computational Complexity of Erdős-Szekeres and Related Problems in ℝ3. ESA Panos Giannopoulos, Christian Knauer, Daniel Werner
2013	A*	`conf`	The complexity of separating points in the plane. SoCG Sergio Cabello, Panos Giannopoulos
2012	J	`jnl`	Hardness of discrepancy computation and ε-net verification in high dimension. J. Complex. Panos Giannopoulos, Christian Knauer, Magnus Wahlström, Daniel Werner
2011	J	`jnl`	Geometric clustering: Fixed-parameter tractability and lower bounds with respect to the dimension. ACM Trans. Algorithms Sergio Cabello, Panos Giannopoulos, Christian Knauer, Dániel Marx, Günter Rote
2011	J	`jnl`	Hardness of discrepancy computation and epsilon-net verification in high dimension CoRR Panos Giannopoulos, Christian Knauer, Magnus Wahlström, Daniel Werner
2011	J	`jnl`	Minimum cell connection and separation in line segment arrangements CoRR Helmut Alt, Sergio Cabello, Panos Giannopoulos, Christian Knauer
2010	J	`jnl`	Computing Geometric Minimum-Dilation Graphs is NP-Hard. Int. J. Comput. Geom. Appl. Panos Giannopoulos, Rolf Klein, Christian Knauer, Martin Kutz, Dániel Marx
2010	B	`conf`	Milling a Graph with Turn Costs: A Parameterized Complexity Perspective. WG Mike Fellows, Panos Giannopoulos, Christian Knauer, Christophe Paul, Frances A. Rosamond, Sue Whitesides, Nathan Yu
2009	J	`jnl`	Abstract Milling with Turn Costs CoRR Michael R. Fellows, Panos Giannopoulos, Christian Knauer, Christophe Paul, Frances A. Rosamond, Sue Whitesides, Nathan Yu
2009	J	`jnl`	Fixed-parameter tractability and lower bounds for stabbing problems CoRR Panos Giannopoulos, Christian Knauer, Günter Rote, Daniel Werner
2009	J	`jnl`	Maximizing the Area of Overlap of Two Unions of Disks under Rigid Motion. Int. J. Comput. Geom. Appl. Sergio Cabello, Mark de Berg, Panos Giannopoulos, Christian Knauer, René van Oostrum, Remco C. Veltkamp
2009	—	`conf`	The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension. IWPEC Panos Giannopoulos, Christian Knauer, Günter Rote
2009	J	`jnl`	The parameterized complexity of some geometric problems in unbounded dimension CoRR Panos Giannopoulos, Christian Knauer, Günter Rote, Daniel Werner
2008	A*	`conf`	Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension. SODA Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote
2008	J	`jnl`	Improving the Stretch Factor of a Geometric Network by Edge Augmentation. SIAM J. Comput. Mohammad Farshi, Panos Giannopoulos, Joachim Gudmundsson
2008	J	`jnl`	Matching point sets with respect to the Earth Mover's Distance. Comput. Geom. Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote
2008	J	`jnl`	On the parameterized complexity of d-dimensional point set pattern matching. Inf. Process. Lett. Sergio Cabello, Panos Giannopoulos, Christian Knauer
2008	J	`jnl`	Parameterized Complexity of Geometric Problems. Comput. J. Panos Giannopoulos, Christian Knauer, Sue Whitesides
2006	—	`conf`	On the Parameterized Complexity of IWPEC Sergio Cabello, Panos Giannopoulos, Christian Knauer
2005	—	`conf`	Finding the best shortcut in a geometric network. SCG Mohammad Farshi, Panos Giannopoulos, Joachim Gudmundsson
2005	C	`conf`	Finding the best shortcut in a geometric network. EuroCG Mohammad Farshi, Panos Giannopoulos, Joachim Gudmundsson
2005	A	`conf`	Matching Point Sets with Respect to the Earth Mover's Distance. ESA Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote
2005	C	`conf`	Matching point sets with respect to the Earth mover's distance. EuroCG Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote
2004	—	`conf`	Maximizing the Area of Overlap of Two Unions of Disks Under Rigid Motion. SWAT Mark de Berg, Sergio Cabello, Panos Giannopoulos, Christian Knauer, René van Oostrum, Remco C. Veltkamp
2003	—	`conf`	Using transportation distances for measuring melodic similarity. ISMIR Rainer Typke, Panos Giannopoulos, Remco C. Veltkamp, Frans Wiering, René van Oostrum
2002	—	`conf`	A Pseudo-Metric for Weighted Point Sets. ECCV (3) Panos Giannopoulos, Remco C. Veltkamp