Evanthia Papadopoulou
Orcid: 0000-0003-0144-7384Affiliations:
- University of Lugano, Switzerland
According to our database1,
Evanthia Papadopoulou
authored at least 57 papers
between 1987 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
1990
1995
2000
2005
2010
2015
2020
0
1
2
3
4
5
6
1
2
1
1
1
5
3
2
1
1
1
2
2
3
1
1
1
1
3
1
2
1
1
2
3
2
2
1
1
1
2
1
1
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on usi.to
-
on dl.acm.org
On csauthors.net:
Bibliography
2023
Discret. Comput. Geom., June, 2023
CoRR, 2023
Proceedings of the 39th International Symposium on Computational Geometry, 2023
2022
Discret. Appl. Math., 2022
Subdivision Methods for Sum-Of-Distances Problems: Fermat-Weber Point, n-Ellipses and the Min-Sum Cluster Voronoi Diagram (Media Exposition).
Proceedings of the 38th International Symposium on Computational Geometry, 2022
2021
Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021
Proceedings of the 29th Annual European Symposium on Algorithms, 2021
Proceedings of the 29th Annual European Symposium on Algorithms, 2021
2020
Proceedings of the LATIN 2020: Theoretical Informatics, 2020
2019
Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended.
J. Comb. Optim., 2019
Unbounded Regions of High-Order Voronoi Diagrams of Lines and Segments in Higher Dimensions.
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019
Proceedings of the Algorithms and Discrete Applied Mathematics, 2019
2018
Proceedings of the 34th International Symposium on Computational Geometry, 2018
2016
Randomized Incremental Construction for the Hausdorff Voronoi Diagram of point clusters.
CoRR, 2016
A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams.
Comput. Geom., 2016
Planar Minimization Diagrams via Subdivision with Applications to Anisotropic Voronoi Diagrams.
Comput. Graph. Forum, 2016
A Randomized Incremental Algorithm for the Hausdorff Voronoi Diagram of Non-crossing Clusters.
Algorithmica, 2016
2015
Linear-Time Algorithms for the Farthest-Segment Voronoi Diagram and Related Tree Structures.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015
2014
Linear-Time Algorithms for the Farthest-Segment Voronoi Diagram and Related Tree Structures.
CoRR, 2014
A Randomized Incremental Approach for the Hausdorff Voronoi Diagram of Non-crossing Clusters.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014
Implementing the L ∞ Segment Voronoi Diagram in CGAL and Applying in VLSI Pattern Analysis.
Proceedings of the Mathematical Software - ICMS 2014, 2014
2013
Proceedings of the 10th International Symposium on Voronoi Diagrams in Science and Engineering, 2013
Proceedings of the 10th International Symposium on Voronoi Diagrams in Science and Engineering, 2013
Proceedings of the Combinatorial Optimization and Applications, 2013
2012
Proceedings of the Ninth International Symposium on Voronoi Diagrams in Science and Engineering, 2012
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012
2011
Net-Aware Critical Area Extraction for Opens in VLSI Circuits Via Higher-Order Voronoi Diagrams.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2011
Proceedings of the Eighth International Symposium on Voronoi Diagrams in Science and Engineering, 2011
Proceedings of the Algorithms - ESA 2011, 2011
2008
Proceedings of the Handbook of Algorithms for Physical Design Automation., 2008
2007
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007
2006
2004
Int. J. Comput. Geom. Appl., 2004
2002
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002
2001
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2001
Int. J. Comput. Geom. Appl., 2001
2000
Proceedings of the 2000 International Symposium on Physical Design, 2000
1999
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1999
Int. J. Comput. Geom. Appl., 1999
1998
A New Approach for the Geodesic Voronoi Diagram of Points in a Simple Polygon and Other Restricted Polygonal Domains.
Algorithmica, 1998
Proceedings of the 1998 International Symposium on Physical Design, 1998
L<sub>infinity</sub> Voronoi Diagrams and Applications to VLSI Layout and Manufacturing.
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998
1997
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997
1996
Proceedings of the Algorithms and Computation, 7th International Symposium, 1996
1995
Efficient Computation of the Geodesic Voronoi Diagram of Points in a Simple Polygon (Extended Abstract).
Proceedings of the Algorithms, 1995
1994
Shortest Paths in a Simple Polygon in the Presence of Forbidden Vertices.
Proceedings of the 6th Canadian Conference on Computational Geometry, 1994
1993
1987
Proceedings of the Supercomputing, 1987