# Evanthia Papadopoulou

According to our database

Collaborative distances:

^{1}, Evanthia Papadopoulou authored at least 48 papers between 1987 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Homepages:

#### On csauthors.net:

## Bibliography

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

On Selecting Leaves with Disjoint Neighborhoods in Embedded Trees.

Proceedings of the Algorithms and Discrete Applied Mathematics, 2019

2018

Stabbing Circles for Sets of Segments in the Plane.

Algorithmica, 2018

Deletion in Abstract Voronoi Diagrams in Expected Linear Time.

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

The Higher-Order Voronoi Diagram of Line Segments.

Algorithmica, 2016

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

Algorithmica, 2016

2015

The L∞ Hausdorff Voronoi Diagram Revisited.

Int. J. Comput. Geom. Appl., 2015

On the complexity of higher order abstract Voronoi diagrams.

Comput. Geom., 2015

The k-Nearest-Neighbor Voronoi Diagram Revisited.

Algorithmica, 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

Computing the Map of Geometric Minimal Cuts.

Algorithmica, 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

On the Farthest Line-Segment Voronoi Diagram.

Int. J. Comput. Geom. Appl., 2013

A Sweepline Algorithm for Higher Order Voronoi Diagrams.

Proceedings of the 10th International Symposium on Voronoi Diagrams in Science and Engineering, 2013

On the Farthest-Neighbor Voronoi Diagram of Segments in Three Dimensions.

Proceedings of the 10th International Symposium on Voronoi Diagrams in Science and Engineering, 2013

Map of Geometric Minimal Cuts for General Planar Embedding.

Proceedings of the Combinatorial Optimization and Applications, 2013

2012

Proceedings of the Ninth International Symposium on Voronoi Diagrams in Science and Engineering, 2012

On Higher Order Voronoi Diagrams of Line Segments.

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. on CAD of Integrated Circuits and Systems, 2011

The L

_{infty}Hausdorff Voronoi Diagram Revisited.
Proceedings of the Eighth International Symposium on Voronoi Diagrams in Science and Engineering, 2011

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

Proceedings of the Algorithms - ESA 2011, 2011

2008

Yield Analysis and Optimization.

Proceedings of the Handbook of Algorithms for Physical Design Automation., 2008

2007

Higher Order Voronoi Diagrams of Segments for VLSI Critical Area Extraction.

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

2006

Robustness of

*k*-gon Voronoi diagram construction.
Inf. Process. Lett., 2006

2004

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

Int. J. Comput. Geom. Appl., 2004

The Hausdorff Voronoi Diagram of Point Clusters in the Plane.

Algorithmica, 2004

2002

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

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

2001

Critical area computation for missing material defects in VLSIcircuits.

IEEE Trans. on CAD of Integrated Circuits and Systems, 2001

The L

_{infty}-Voronoi Diagram of Segments and VLSI Applications.
Int. J. Comput. Geom. Appl., 2001

2000

Critical area computation for missing material defects in VLSI circuits.

Proceedings of the 2000 International Symposium on Physical Design, 2000

1999

Critical area computation via Voronoi diagrams.

IEEE Trans. on CAD of Integrated Circuits and Systems, 1999

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

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

Skew Voronoi Diagrams.

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

Critical area computation - a new approach.

Proceedings of the 1998 International Symposium on Physical Design, 1998

L

_{infinity}Voronoi Diagrams and Applications to VLSI Layout and Manufacturing.
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

1997

Voronoi Diagrams for Direction-Sensitive Distances.

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996

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

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

The All-Pairs Quickest Path Problem.

Inf. Process. Lett., 1993

1987

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

Proceedings of the Supercomputing, 1987