Least-Squares Iterative Solution on a Fixed-Size VLSI Architecture. - Evanthia Papadopoulou; Theodore S. Papatheodorou (ICS, 1987)

The All-Pairs Quickest Path Problem. - D. T. Lee; Evanthia Papadopoulou (Inf. Process. Lett., 1993)

Shortest Paths in a Simple Polygon in the Presence of Forbidden Vertices. - Evanthia Papadopoulou; D. T. Lee (CCCG, 1994)

Efficient Computation of the Geodesic Voronoi Diagram of Points in a Simple Polygon (Extended Abstract). - Evanthia Papadopoulou; D. T. Lee (ESA, 1995)

k-Pairs Non-Crossing Shortest Paths in a Simple Polygon. - Evanthia Papadopoulou (ISAAC, 1996)

Voronoi Diagrams for Direction-Sensitive Distances. - Oswin Aichholzer; Franz Aurenhammer; Danny Z. Chen; D. T. Lee; Asish Mukhopadhyay; Evanthia Papadopoulou (SCG, 1997)

Linfinity Voronoi Diagrams and Applications to VLSI Layout and Manufacturing. - Evanthia Papadopoulou (ISAAC, 1998)

Critical area computation - a new approach. - Evanthia Papadopoulou; D. T. Lee (ISPD, 1998)

A New Approach for the Geodesic Voronoi Diagram of Points in a Simple Polygon and Other Restricted Polygonal Domains. - Evanthia Papadopoulou; D. T. Lee (Algorithmica, 1998)

Skew Voronoi Diagrams. - Oswin Aichholzer; Franz Aurenhammer; Danny Z. Chen; D. T. Lee; Evanthia Papadopoulou (Int. J. Comput. Geom. Appl., 1999)

k-Pairs Non-Crossing Shortest Paths in a Simple Polygon. - Evanthia Papadopoulou (Int. J. Comput. Geom. Appl., 1999)

Critical area computation via Voronoi diagrams. - Evanthia Papadopoulou; D. T. Lee (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1999)

Critical area computation for missing material defects in VLSI circuits. - Evanthia Papadopoulou (ISPD, 2000)

The Linfty-Voronoi Diagram of Segments and VLSI Applications. - Evanthia Papadopoulou; D. T. Lee (Int. J. Comput. Geom. Appl., 2001)

Critical area computation for missing material defects in VLSIcircuits. - Evanthia Papadopoulou (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2001)

The Min-Max Voronoi Diagram of Polygons and Applications in VLSI Manufacturing. - Evanthia Papadopoulou; D. T. Lee (ISAAC, 2002)

The Hausdorff Voronoi Diagram of Point Clusters in the Plane. - Evanthia Papadopoulou (Algorithmica, 2004)

The hausdorff voronoi diagram of polygonal objects: a divide and conquer approach. - Evanthia Papadopoulou; D. T. Lee (Int. J. Comput. Geom. Appl., 2004)

Robustness of k-gon Voronoi diagram construction. - Zhenming Chen; Evanthia Papadopoulou; Jinhui Xu 001 (Inf. Process. Lett., 2006)

Higher Order Voronoi Diagrams of Segments for VLSI Critical Area Extraction. - Evanthia Papadopoulou (ISAAC, 2007)

Yield Analysis and Optimization. - Puneet Gupta; Evanthia Papadopoulou (Handbook of Algorithms for Physical Design Automation, 2008)

An Output-Sensitive Approach for the L 1/L ∞ k-Nearest-Neighbor Voronoi Diagram. - Chih-Hung Liu 001; Evanthia Papadopoulou; D. T. Lee (ESA, 2011)

The Linfty Hausdorff Voronoi Diagram Revisited. - Evanthia Papadopoulou; Jinhui Xu 001 (ISVD, 2011)

Net-Aware Critical Area Extraction for Opens in VLSI Circuits Via Higher-Order Voronoi Diagrams. - Evanthia Papadopoulou (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2011)

On Higher Order Voronoi Diagrams of Line Segments. - Evanthia Papadopoulou; Maksym Zavershynskyi (ISAAC, 2012)

The L∞ (L1) Farthest Line-Segment Voronoi Diagram. - Sandeep K. Dey; Evanthia Papadopoulou (ISVD, 2012)

Map of Geometric Minimal Cuts for General Planar Embedding. - Lei Xu 006; Evanthia Papadopoulou; Jinhui Xu 001 (COCOA, 2013)

On the Farthest-Neighbor Voronoi Diagram of Segments in Three Dimensions. - Gill Barequet; Evanthia Papadopoulou (ISVD, 2013)

A Sweepline Algorithm for Higher Order Voronoi Diagrams. - Maksym Zavershynskyi; Evanthia Papadopoulou (ISVD, 2013)

On the Farthest Line-Segment Voronoi Diagram. - Evanthia Papadopoulou; Sandeep Kumar Dey (Int. J. Comput. Geom. Appl., 2013)

Implementing the L ∞ Segment Voronoi Diagram in CGAL and Applying in VLSI Pattern Analysis. - Panagiotis Cheilaris; Sandeep Kumar Dey; Maria Gabrani; Evanthia Papadopoulou (ICMS, 2014)

A Randomized Incremental Approach for the Hausdorff Voronoi Diagram of Non-crossing Clusters. - Panagiotis Cheilaris; Elena Khramtcova; Stefan Langerman; Evanthia Papadopoulou (LATIN, 2014)

Computing the Map of Geometric Minimal Cuts. - Jinhui Xu 001; Lei Xu 006; Evanthia Papadopoulou (Algorithmica, 2014)

Linear-Time Algorithms for the Farthest-Segment Voronoi Diagram and Related Tree Structures. - Elena Khramtcova; Sandeep K. Dey; Evanthia Papadopoulou (CoRR, 2014)

Linear-Time Algorithms for the Farthest-Segment Voronoi Diagram and Related Tree Structures. - Elena Khramtcova; Evanthia Papadopoulou (ISAAC, 2015)

The k-Nearest-Neighbor Voronoi Diagram Revisited. - Chih-Hung Liu 001; Evanthia Papadopoulou; Der-Tsai Lee (Algorithmica, 2015)

On the complexity of higher order abstract Voronoi diagrams. - Cecilia Bohler; Panagiotis Cheilaris; Rolf Klein; Chih-Hung Liu 001; Evanthia Papadopoulou; Maksym Zavershynskyi (Comput. Geom., 2015)

The L∞ Hausdorff Voronoi Diagram Revisited. - Evanthia Papadopoulou; Jinhui Xu 001 (Int. J. Comput. Geom. Appl., 2015)

A Randomized Incremental Algorithm for the Hausdorff Voronoi Diagram of Non-crossing Clusters. - Panagiotis Cheilaris; Elena Khramtcova; Stefan Langerman; Evanthia Papadopoulou (Algorithmica, 2016)

The Higher-Order Voronoi Diagram of Line Segments. - Evanthia Papadopoulou; Maksym Zavershynskyi (Algorithmica, 2016)

Planar Minimization Diagrams via Subdivision with Applications to Anisotropic Voronoi Diagrams. - Huck Bennett; Evanthia Papadopoulou; Chee Yap (Comput. Graph. Forum, 2016)

A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams. - Cecilia Bohler; Chih-Hung Liu 001; Evanthia Papadopoulou; Maksym Zavershynskyi (Comput. Geom., 2016)

Randomized Incremental Construction for the Hausdorff Voronoi Diagram of point clusters. - Elena Khramtcova; Evanthia Papadopoulou (CoRR, 2016)

Deletion in Abstract Voronoi Diagrams in Expected Linear Time. - Kolja Junginger; Evanthia Papadopoulou (SoCG, 2018)

Stabbing Circles for Sets of Segments in the Plane. - Mercè Claverol; Elena Khramtcova; Evanthia Papadopoulou; Maria Saumell; Carlos Seara (Algorithmica, 2018)

On Selecting Leaves with Disjoint Neighborhoods in Embedded Trees. - Kolja Junginger; Ioannis Mantas; Evanthia Papadopoulou (CALDAM, 2019)

Unbounded Regions of High-Order Voronoi Diagrams of Lines and Segments in Higher Dimensions. - Gill Barequet; Evanthia Papadopoulou; Martin Suderland (ISAAC, 2019)

Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended. - Elena Arseneva; Evanthia Papadopoulou (J. Comb. Optim., 2019)

Farthest Color Voronoi Diagrams: Complexity and Algorithms. - Ioannis Mantas; Evanthia Papadopoulou; Vera Sacristán; Rodrigo I. Silveira (LATIN, 2020)

The Voronoi Diagram of Rotating Rays With applications to Floodlight Illumination. - Carlos Alegría; Ioannis Mantas; Evanthia Papadopoulou; Marko Savic; Hendrik Schrezenmaier; Carlos Seara; Martin Suderland (ESA, 2021)

Certified Approximation Algorithms for the Fermat Point and n-Ellipses. - Kolja Junginger; Ioannis Mantas; Evanthia Papadopoulou; Martin Suderland; Chee Yap (ESA, 2021)

Piecewise-Linear Farthest-Site Voronoi Diagrams. - Franz Aurenhammer; Evanthia Papadopoulou; Martin Suderland (ISAAC, 2021)

Subdivision Methods for Sum-Of-Distances Problems: Fermat-Weber Point, n-Ellipses and the Min-Sum Cluster Voronoi Diagram (Media Exposition). - Ioannis Mantas; Evanthia Papadopoulou; Martin Suderland; Chee Yap (SoCG, 2022)

On selecting a fraction of leaves with disjoint neighborhoods in a plane tree. - Kolja Junginger; Ioannis Mantas; Evanthia Papadopoulou (Discret. Appl. Math., 2022)

Abstract Voronoi-Like Graphs: Extending Delaunay's Theorem and Applications. - Evanthia Papadopoulou (SoCG, 2023)

The Voronoi Diagram of Rotating Rays with applications to Floodlight Illumination. - Carlos Alegría; Ioannis Mantas; Evanthia Papadopoulou; Marko Savic; Carlos Seara; Martin Suderland (CoRR, 2023)

Deletion in Abstract Voronoi Diagrams in Expected Linear Time and Related Problems. - Kolja Junginger; Evanthia Papadopoulou (Discret. Comput. Geom., 2023)

Unbounded Regions of High-Order Voronoi Diagrams of Lines and Line Segments in Higher Dimensions. - Gill Barequet; Evanthia Papadopoulou; Martin Suderland (Discret. Comput. Geom., 2024)

Higher-Order Color Voronoi Diagrams and the Colorful Clarkson-Shor Framework. - Sang Won Bae 001; Nicolau Oliver; Evanthia Papadopoulou (SoCG, 2025)

Towards more Inclusive Museums Using AI: Guidance in Sign Language. - Dimitrios I. Kosmopoulos; Evanthia Papadopoulou; Antonis A. Argyros (ERCIM News, 2025)

The Farthest Color Voronoi Diagram in the Plane. - Ioannis Mantas; Evanthia Papadopoulou; Rodrigo I. Silveira; Zeyu Wang (Algorithmica, 2025)