Evanthia Papadopoulou

发表

The L∞ Hausdorff Voronoi Diagram Revisited

Jinhui Xu, Evanthia Papadopoulou, Jinhui Xu, 2015, Int. J. Comput. Geom. Appl..

Implementing the L ∞ Segment Voronoi Diagram in CGAL and Applying in VLSI Pattern Analysis

Evanthia Papadopoulou, Panagiotis Cheilaris, Maria Gabrani, 2014, ICMS.

The All-Pairs Quickest Path Problem

D. T. Lee, Evanthia Papadopoulou, Evanthia Papadopoulou, 1993, Inf. Process. Lett..

Critical area computation via Voronoi diagrams

D. T. Lee, Evanthia Papadopoulou, Evanthia Papadopoulou, 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

The L_infinity (L_1) Farthest Line-Segment Voronoi Diagram

Evanthia Papadopoulou, Sandeep K. Dey, 2012, 2012 Ninth International Symposium on Voronoi Diagrams in Science and Engineering.

A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams

Cecilia Bohler, Chih-Hung Liu, Evanthia Papadopoulou, 2014, Comput. Geom..

Layout pattern analysis using the Voronoi diagram of line segments

Evanthia Papadopoulou, Panagiotis Cheilaris, Maria Gabrani, 2016 .

Higher Order Voronoi Diagrams of Segments for VLSI Critical Area Extraction

Evanthia Papadopoulou, Evanthia Papadopoulou, 2007, ISAAC.

Stabbing Circles for Sets of Segments in the Plane

Evanthia Papadopoulou, Mercè Claverol, Carlos Seara, 2017, Algorithmica.

Yield Analysis and Optimization

Puneet Gupta, Evanthia Papadopoulou, Puneet Gupta, 2008, Handbook of Algorithms for Physical Design Automation.

On the Complexity of Higher Order Abstract Voronoi Diagrams

Cecilia Bohler, Rolf Klein, Chih-Hung Liu, 2013, ICALP.

A Sweepline Algorithm for Higher Order Voronoi Diagrams

Evanthia Papadopoulou, Maksym Zavershynskyi, 2013, 2013 10th International Symposium on Voronoi Diagrams in Science and Engineering.

On Selecting Leaves with Disjoint Neighborhoods in Embedded Trees

Evanthia Papadopoulou, Ioannis Mantas, Kolja Junginger, 2019, CALDAM.

Efficient Computation of the Geodesic Voronoi Diagram of Points in a Simple Polygon (Extended Abstract)

D. T. Lee, Evanthia Papadopoulou, Evanthia Papadopoulou, 1995, ESA.

Net-Aware Critical Area Extraction for Opens in VLSI Circuits Via Higher-Order Voronoi Diagrams

Evanthia Papadopoulou, Evanthia Papadopoulou, 2011, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

On the Complexity of Higher Order Abstract Voronoi Diagrams

Cecilia Bohler, Rolf Klein, Chih-Hung Liu, 2013, ICALP.

Shortest Paths in a Simple Polygon in the Presence of Forbidden Vertices

D. T. Lee, Evanthia Papadopoulou, 1994, CCCG.

Map of Geometric Minimal Cuts for General Planar Embedding

Lei Xu, Jinhui Xu, Evanthia Papadopoulou, 2013, COCOA.

A subdivision approach to weighted voronoi diagrams

Evanthia Papadopoulou, Chee Yap, Huck Bennett, 2014 .

Voronoi diagrams for direction-sensitive distances

Franz Aurenhammer, Asish Mukhopadhyay, D. T. Lee, 1997, SCG '97.

Deletion in Abstract Voronoi Diagrams in Expected Linear Time and Related Problems

Evanthia Papadopoulou, Kolja Junginger, Evanthia Papadopoulou, 2018, Discrete & Computational Geometry.

Map of Geometric Minimal Cuts with Applications

Lei Xu, Evanthia Papadopoulou, Jinhui Xu, 2013 .

On the Hausdorff Voronoi Diagram of Point Clusters in the Plane

Evanthia Papadopoulou, 2003, WADS.

The hausdorff voronoi diagram of polygonal objects: a divide and conquer approach

D. T. Lee, Evanthia Papadopoulou, Evanthia Papadopoulou, 2004, Int. J. Comput. Geom. Appl..

Planar Minimization Diagrams via Subdivision with Applications to Anisotropic Voronoi Diagrams

Chee-Keng Yap, Evanthia Papadopoulou, Huck Bennett, 2016, Comput. Graph. Forum.

A Randomized Incremental Approach for the Hausdorff Voronoi Diagram of Non-crossing Clusters pdf

Stefan Langerman, Evanthia Papadopoulou, Panagiotis Cheilaris, 2013, LATIN.

The $L_\infty$ Hausdorff Voronoi Diagram Revisited

Jinhui Xu, Evanthia Papadopoulou, Jinhui Xu, 2011, 2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering.

Critical area computation—a new approach

D. T. Lee, Evanthia Papadopoulou, 1998, ISPD '98.

k-Pairs Non-Crossing Shortest Paths in a Simple Polygon

Evanthia Papadopoulou, 1999, Int. J. Comput. Geom. Appl..

Critical area computation for missing material defects in VLSIcircuits

Evanthia Papadopoulou, 2001, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

Critical Area Computation via

Evanthia Papadopoulou, Der-Tsai Lee, 1999 .

Computing the Map of Geometric Minimal Cuts

Lei Xu, Jinhui Xu, Evanthia Papadopoulou, 2009, Algorithmica.

A New Approach for the Geodesic Voronoi Diagram of Points in a Simple Polygon and Other Restricted Polygonal Domains

D. T. Lee, Evanthia Papadopoulou, Der-Tsai Lee, 1998, Algorithmica.

Skew Voronoi Diagrams

Franz Aurenhammer, D. T. Lee, Evanthia Papadopoulou, 1999, Int. J. Comput. Geom. Appl..

Randomized incremental construction of the Hausdorff Voronoi diagram of non-crossing clusters pdf

Evanthia Papadopoulou, Panagiotis Cheilaris, Elena Khramtcova, 2013, ArXiv.

k-Pairs Non-Crossing Shortest Paths in a Simple Polygon

Evanthia Papadopoulou, Evanthia Papadopoulou, 1996, Int. J. Comput. Geom. Appl..

The k-Nearest-Neighbor Voronoi Diagram Revisited

D. T. Lee, Chih-Hung Liu, Evanthia Papadopoulou, 2013, Algorithmica.

Randomized Incremental Construction for the Hausdorff Voronoi Diagram Revisited and Extended

Evanthia Papadopoulou, Elena Khramtcova, 2017, COCOON.

The Min-Max Voronoi Diagram of Polygons and Applications in VLSI Manufacturing

D. T. Lee, Evanthia Papadopoulou, Evanthia Papadopoulou, 2002, ISAAC.

A Randomized Incremental Algorithm for the Hausdorff Voronoi Diagram of Non-crossing Clusters

Stefan Langerman, Evanthia Papadopoulou, Panagiotis Cheilaris, 2013, Algorithmica.

An Output-Sensitive Approach for the L 1/L ∞ k-Nearest-Neighbor Voronoi Diagram

D. T. Lee, Chih-Hung Liu, Evanthia Papadopoulou, 2011, ESA.

On the Farthest Line-Segment Voronoi Diagram

Evanthia Papadopoulou, Sandeep Kumar Dey, 2013, Int. J. Comput. Geom. Appl..

Critical area computation for missing material defects in VLSI circuits

Evanthia Papadopoulou, 2000, ISPD '00.

Stabbing Circles for Sets of Segments in the Plane

Evanthia Papadopoulou, Mercè Claverol, Carlos Seara, 2016, LATIN.

Least-Squares Iterative Solution on a Fixed-Size VLSI Architecture

Evanthia Papadopoulou, Theodore S. Papatheodorou, 1987, ICS.

A Randomized Divide and Conquer Algorithm for Higher-Order Abstract Voronoi Diagrams

Cecilia Bohler, Chih-Hung Liu, Evanthia Papadopoulou, 2014, ISAAC.

Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended

Evanthia Papadopoulou, Elena Arseneva, 2019, J. Comb. Optim..

Robustness of k-gon Voronoi diagram construction

Jinhui Xu, Evanthia Papadopoulou, Zhenming Chen, 2006, Inf. Process. Lett..

The Higher-Order Voronoi Diagram of Line Segments

Evanthia Papadopoulou, Maksym Zavershynskyi, Evanthia Papadopoulou, 2014, Algorithmica.

Linfinity Voronoi Diagrams and Applications to VLSI Layout and Manufacturing

Evanthia Papadopoulou, Evanthia Papadopoulou, 1998, ISAAC.

On Higher Order Voronoi Diagrams of Line Segments

Evanthia Papadopoulou, Maksym Zavershynskyi, Evanthia Papadopoulou, 2012, ISAAC.

Computing the Map of Geometric Minimal Cuts

Lei Xu, Jinhui Xu, Evanthia Papadopoulou, 2009, ISAAC.

On the Farthest Line-Segment Voronoi Diagram

Evanthia Papadopoulou, Sandeep K. Dey, 2012, ISAAC.

The Hausdorff Voronoi Diagram of Point Clusters in the Plane

Evanthia Papadopoulou, Evanthia Papadopoulou, 2003, Algorithmica.

Certified Approximation Algorithms for the Fermat Point and n-Ellipses

Chee-Keng Yap, Evanthia Papadopoulou, Kolja Junginger, 2021, ESA.

The Voronoi Diagram of Rotating Rays With applications to Floodlight Illumination

Evanthia Papadopoulou, Carlos Seara, Hendrik Schrezenmaier, 2021, ESA.

On selecting a fraction of leaves with disjoint neighborhoods in a plane tree

Evanthia Papadopoulou, Kolja Junginger, Ioannis Mantas, 2021 .

Piecewise-Linear Farthest-Site Voronoi Diagrams

Franz Aurenhammer, Evanthia Papadopoulou, Martin Suderland, 2021, ISAAC.

Label-Free Detection of Single-Base Mismatches in DNA by Surface-Enhanced Raman Spectroscopy

Evanthia Papadopoulou, S. Bell, Evanthia Papadopoulou, 2011, Angewandte Chemie.

The L ∞ (L 1 ) Farthest Line-Segment Voronoi Diagram.

Evanthia Papadopoulou, Sandeep Kumar Dey, 2012 .

Label-free detection of nanomolar unmodified single- and double-stranded DNA by using surface-enhanced Raman spectroscopy on Ag and Au colloids.

Evanthia Papadopoulou, S. Bell, Evanthia Papadopoulou, 2012, Chemistry.