default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEvanthia Papadopoulou
Person information
- affiliation: University of Lugano, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j24]Kolja Junginger
, Evanthia Papadopoulou:
Deletion in Abstract Voronoi Diagrams in Expected Linear Time and Related Problems. Discret. Comput. Geom. 69(4): 1040-1078 (2023)- [c36]Evanthia Papadopoulou:
Abstract Voronoi-Like Graphs: Extending Delaunay's Theorem and Applications. SoCG 2023: 52:1-52:16 - [i8]Evanthia Papadopoulou:
Abstract Voronoi-like Graphs: Extending Delaunay's Theorem and Applications. CoRR abs/2303.06669 (2023) - [i7]Carlos Alegría, Ioannis Mantas, Evanthia Papadopoulou, Marko Savic, Carlos Seara, Martin Suderland:
The Voronoi Diagram of Rotating Rays with applications to Floodlight Illumination. CoRR abs/2304.11429 (2023) - [i6]Kolja Junginger, Ioannis Mantas, Evanthia Papadopoulou:
On selecting a fraction of leaves with disjoint neighborhoods in a plane tree. CoRR abs/2312.10245 (2023) - 2022
- [j23]Kolja Junginger, Ioannis Mantas, Evanthia Papadopoulou:
On selecting a fraction of leaves with disjoint neighborhoods in a plane tree. Discret. Appl. Math. 319: 141-148 (2022) - [c35]Ioannis Mantas, Evanthia Papadopoulou, Martin Suderland, Chee Yap:
Subdivision Methods for Sum-Of-Distances Problems: Fermat-Weber Point, n-Ellipses and the Min-Sum Cluster Voronoi Diagram (Media Exposition). SoCG 2022: 69:1-69:6 - 2021
- [c34]Carlos Alegría, Ioannis Mantas, Evanthia Papadopoulou, Marko Savic, Hendrik Schrezenmaier, Carlos Seara, Martin Suderland:
The Voronoi Diagram of Rotating Rays With applications to Floodlight Illumination. ESA 2021: 5:1-5:16 - [c33]Kolja Junginger, Ioannis Mantas, Evanthia Papadopoulou, Martin Suderland, Chee Yap:
Certified Approximation Algorithms for the Fermat Point and n-Ellipses. ESA 2021: 54:1-54:19 - [c32]Franz Aurenhammer, Evanthia Papadopoulou, Martin Suderland:
Piecewise-Linear Farthest-Site Voronoi Diagrams. ISAAC 2021: 30:1-30:11 - 2020
- [c31]Ioannis Mantas, Evanthia Papadopoulou, Vera Sacristán, Rodrigo I. Silveira:
Farthest Color Voronoi Diagrams: Complexity and Algorithms. LATIN 2020: 283-295
2010 – 2019
- 2019
- [j22]Elena Arseneva, Evanthia Papadopoulou:
Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended. J. Comb. Optim. 37(2): 579-600 (2019) - [c30]Kolja Junginger, Ioannis Mantas, Evanthia Papadopoulou:
On Selecting Leaves with Disjoint Neighborhoods in Embedded Trees. CALDAM 2019: 189-200 - [c29]Gill Barequet, Evanthia Papadopoulou, Martin Suderland:
Unbounded Regions of High-Order Voronoi Diagrams of Lines and Segments in Higher Dimensions. ISAAC 2019: 62:1-62:15 - 2018
- [j21]Mercè Claverol, Elena Khramtcova, Evanthia Papadopoulou, Maria Saumell, Carlos Seara:
Stabbing Circles for Sets of Segments in the Plane. Algorithmica 80(3): 849-884 (2018) - [c28]Kolja Junginger, Evanthia Papadopoulou:
Deletion in Abstract Voronoi Diagrams in Expected Linear Time. SoCG 2018: 50:1-50:14 - [i5]Kolja Junginger, Evanthia Papadopoulou:
Deletion in abstract Voronoi diagrams in expected linear time. CoRR abs/1803.05372 (2018) - 2017
- [c27]Elena Khramtcova, Evanthia Papadopoulou:
Randomized Incremental Construction for the Hausdorff Voronoi Diagram Revisited and Extended. COCOON 2017: 321-332 - 2016
- [j20]Evanthia Papadopoulou, Maksym Zavershynskyi:
The Higher-Order Voronoi Diagram of Line Segments. Algorithmica 74(1): 415-439 (2016) - [j19]Panagiotis Cheilaris, Elena Khramtcova, Stefan Langerman, Evanthia Papadopoulou:
A Randomized Incremental Algorithm for the Hausdorff Voronoi Diagram of Non-crossing Clusters. Algorithmica 76(4): 935-960 (2016) - [j18]Huck Bennett, Evanthia Papadopoulou, Chee Yap:
Planar Minimization Diagrams via Subdivision with Applications to Anisotropic Voronoi Diagrams. Comput. Graph. Forum 35(5): 229-247 (2016) - [j17]Cecilia Bohler, Chih-Hung Liu, Evanthia Papadopoulou, Maksym Zavershynskyi:
A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams. Comput. Geom. 59: 26-38 (2016) - [c26]Mercè Claverol, Elena Khramtcova, Evanthia Papadopoulou, Maria Saumell, Carlos Seara:
Stabbing Circles for Sets of Segments in the Plane. LATIN 2016: 290-305 - [i4]Elena Khramtcova, Evanthia Papadopoulou:
Randomized Incremental Construction for the Hausdorff Voronoi Diagram of point clusters. CoRR abs/1612.01335 (2016) - 2015
- [j16]Chih-Hung Liu, Evanthia Papadopoulou, Der-Tsai Lee:
The k-Nearest-Neighbor Voronoi Diagram Revisited. Algorithmica 71(2): 429-449 (2015) - [j15]Cecilia Bohler, Panagiotis Cheilaris, Rolf Klein, Chih-Hung Liu, Evanthia Papadopoulou, Maksym Zavershynskyi:
On the complexity of higher order abstract Voronoi diagrams. Comput. Geom. 48(8): 539-551 (2015) - [j14]Evanthia Papadopoulou, Jinhui Xu:
The L∞ Hausdorff Voronoi Diagram Revisited. Int. J. Comput. Geom. Appl. 25(2): 123-142 (2015) - [c25]Elena Khramtcova, Evanthia Papadopoulou:
Linear-Time Algorithms for the Farthest-Segment Voronoi Diagram and Related Tree Structures. ISAAC 2015: 404-414 - 2014
- [j13]Jinhui Xu, Lei Xu, Evanthia Papadopoulou:
Computing the Map of Geometric Minimal Cuts. Algorithmica 68(4): 805-834 (2014) - [c24]Panagiotis Cheilaris, Sandeep Kumar Dey, Maria Gabrani, Evanthia Papadopoulou:
Implementing the L ∞ Segment Voronoi Diagram in CGAL and Applying in VLSI Pattern Analysis. ICMS 2014: 198-205 - [c23]Cecilia Bohler, Chih-Hung Liu, Evanthia Papadopoulou, Maksym Zavershynskyi:
A Randomized Divide and Conquer Algorithm for Higher-Order Abstract Voronoi Diagrams. ISAAC 2014: 27-37 - [c22]Panagiotis Cheilaris, Elena Khramtcova, Stefan Langerman, Evanthia Papadopoulou:
A Randomized Incremental Approach for the Hausdorff Voronoi Diagram of Non-crossing Clusters. LATIN 2014: 96-107 - [i3]Evanthia Papadopoulou, Maksym Zavershynskyi:
The Higher-Order Voronoi Diagram of Line Segments. CoRR abs/1405.3806 (2014) - [i2]Elena Khramtcova, Sandeep K. Dey, Evanthia Papadopoulou:
Linear-Time Algorithms for the Farthest-Segment Voronoi Diagram and Related Tree Structures. CoRR abs/1411.2816 (2014) - 2013
- [j12]Evanthia Papadopoulou, Sandeep Kumar Dey:
On the Farthest Line-Segment Voronoi Diagram. Int. J. Comput. Geom. Appl. 23(6): 443-460 (2013) - [c21]Lei Xu, Evanthia Papadopoulou, Jinhui Xu:
Map of Geometric Minimal Cuts for General Planar Embedding. COCOA 2013: 238-249 - [c20]Cecilia Bohler, Panagiotis Cheilaris, Rolf Klein, Chih-Hung Liu, Evanthia Papadopoulou, Maksym Zavershynskyi:
On the Complexity of Higher Order Abstract Voronoi Diagrams. ICALP (1) 2013: 208-219 - [c19]Maksym Zavershynskyi, Evanthia Papadopoulou:
A Sweepline Algorithm for Higher Order Voronoi Diagrams. ISVD 2013: 16-22 - [c18]Gill Barequet, Evanthia Papadopoulou:
On the Farthest-Neighbor Voronoi Diagram of Segments in Three Dimensions. ISVD 2013: 31-36 - [i1]Panagiotis Cheilaris, Elena Khramtcova, Stefan Langerman, Evanthia Papadopoulou:
A Randomized Incremental Approach for the Hausdorff Voronoi Diagram of Non-crossing Clusters. CoRR abs/1312.3904 (2013) - 2012
- [c17]Evanthia Papadopoulou, Maksym Zavershynskyi:
On Higher Order Voronoi Diagrams of Line Segments. ISAAC 2012: 177-186 - [c16]Evanthia Papadopoulou, Sandeep K. Dey:
On the Farthest Line-Segment Voronoi Diagram. ISAAC 2012: 187-196 - [c15]Sandeep K. Dey, Evanthia Papadopoulou:
The L∞ (L1) Farthest Line-Segment Voronoi Diagram. ISVD 2012: 49-55 - 2011
- [j11]Evanthia Papadopoulou:
Net-Aware Critical Area Extraction for Opens in VLSI Circuits Via Higher-Order Voronoi Diagrams. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 30(5): 704-717 (2011) - [c14]Chih-Hung Liu, Evanthia Papadopoulou, D. T. Lee:
An Output-Sensitive Approach for the L 1/L ∞ k-Nearest-Neighbor Voronoi Diagram. ESA 2011: 70-81 - [c13]Evanthia Papadopoulou, Jinhui Xu:
The Linfty Hausdorff Voronoi Diagram Revisited. ISVD 2011: 67-74
2000 – 2009
- 2009
- [c12]Jinhui Xu, Lei Xu, Evanthia Papadopoulou:
Computing the Map of Geometric Minimal Cuts. ISAAC 2009: 244-254 - 2008
- [r1]Puneet Gupta, Evanthia Papadopoulou:
Yield Analysis and Optimization. Handbook of Algorithms for Physical Design Automation 2008 - 2007
- [c11]Evanthia Papadopoulou:
Higher Order Voronoi Diagrams of Segments for VLSI Critical Area Extraction. ISAAC 2007: 716-727 - 2006
- [j10]Zhenming Chen, Evanthia Papadopoulou, Jinhui Xu:
Robustness of k-gon Voronoi diagram construction. Inf. Process. Lett. 97(4): 138-145 (2006) - 2004
- [j9]Evanthia Papadopoulou:
The Hausdorff Voronoi Diagram of Point Clusters in the Plane. Algorithmica 40(2): 63-82 (2004) - [j8]Evanthia Papadopoulou, D. T. Lee:
The hausdorff voronoi diagram of polygonal objects: a divide and conquer approach. Int. J. Comput. Geom. Appl. 14(6): 421-452 (2004) - 2003
- [c10]Evanthia Papadopoulou:
On the Hausdorff Voronoi Diagram of Point Clusters in the Plane. WADS 2003: 439-450 - 2002
- [c9]Evanthia Papadopoulou, D. T. Lee:
The Min-Max Voronoi Diagram of Polygons and Applications in VLSI Manufacturing. ISAAC 2002: 511-522 - 2001
- [j7]Evanthia Papadopoulou, D. T. Lee:
The Linfty-Voronoi Diagram of Segments and VLSI Applications. Int. J. Comput. Geom. Appl. 11(5): 503-528 (2001) - [j6]Evanthia Papadopoulou:
Critical area computation for missing material defects in VLSIcircuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 20(5): 583-597 (2001) - 2000
- [c8]Evanthia Papadopoulou:
Critical area computation for missing material defects in VLSI circuits. ISPD 2000: 140-146
1990 – 1999
- 1999
- [j5]Oswin Aichholzer, Franz Aurenhammer, Danny Z. Chen, D. T. Lee, Evanthia Papadopoulou:
Skew Voronoi Diagrams. Int. J. Comput. Geom. Appl. 9(3): 235-248 (1999) - [j4]Evanthia Papadopoulou:
k-Pairs Non-Crossing Shortest Paths in a Simple Polygon. Int. J. Comput. Geom. Appl. 9(6): 533-552 (1999) - [j3]Evanthia Papadopoulou, D. T. Lee:
Critical area computation via Voronoi diagrams. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 18(4): 463-474 (1999) - 1998
- [j2]Evanthia Papadopoulou, D. T. Lee:
A New Approach for the Geodesic Voronoi Diagram of Points in a Simple Polygon and Other Restricted Polygonal Domains. Algorithmica 20(4): 319-352 (1998) - [c7]Evanthia Papadopoulou:
Linfinity Voronoi Diagrams and Applications to VLSI Layout and Manufacturing. ISAAC 1998: 9-18 - [c6]Evanthia Papadopoulou, D. T. Lee:
Critical area computation - a new approach. ISPD 1998: 89-94 - 1997
- [c5]Oswin Aichholzer, Franz Aurenhammer, Danny Z. Chen, D. T. Lee, Asish Mukhopadhyay, Evanthia Papadopoulou:
Voronoi Diagrams for Direction-Sensitive Distances. SCG 1997: 418-420 - 1996
- [c4]Evanthia Papadopoulou:
k-Pairs Non-Crossing Shortest Paths in a Simple Polygon. ISAAC 1996: 305-314 - 1995
- [c3]Evanthia Papadopoulou, D. T. Lee:
Efficient Computation of the Geodesic Voronoi Diagram of Points in a Simple Polygon (Extended Abstract). ESA 1995: 238-251 - 1994
- [c2]Evanthia Papadopoulou, D. T. Lee:
Shortest Paths in a Simple Polygon in the Presence of Forbidden Vertices. CCCG 1994: 110-115 - 1993
- [j1]D. T. Lee, Evanthia Papadopoulou:
The All-Pairs Quickest Path Problem. Inf. Process. Lett. 45(5): 261-267 (1993)
1980 – 1989
- 1987
- [c1]Evanthia Papadopoulou, Theodore S. Papatheodorou:
Least-Squares Iterative Solution on a Fixed-Size VLSI Architecture. ICS 1987: 914-925
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-05-08 20:58 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:
