| 2007 |
|---|
| 21 | EE | Evanthia Papadopoulou:
Higher Order Voronoi Diagrams of Segments for VLSI Critical Area Extraction.
ISAAC 2007: 716-727 |
| 2006 |
|---|
| 20 | EE | Zhenming Chen,
Evanthia Papadopoulou,
Jinhui Xu:
Robustness of k-gon Voronoi diagram construction.
Inf. Process. Lett. 97(4): 138-145 (2006) |
| 2004 |
|---|
| 19 | EE | Evanthia Papadopoulou:
The Hausdorff Voronoi Diagram of Point Clusters in the Plane.
Algorithmica 40(2): 63-82 (2004) |
| 18 | EE | Evanthia Papadopoulou,
D. T. Lee:
The hausdorff voronoi diagram of polygonal objects: a divide and conquer approach.
Int. J. Comput. Geometry Appl. 14(6): 421-452 (2004) |
| 2003 |
|---|
| 17 | EE | Evanthia Papadopoulou:
On the Hausdorff Voronoi Diagram of Point Clusters in the Plane.
WADS 2003: 439-450 |
| 2002 |
|---|
| 16 | EE | Evanthia Papadopoulou,
D. T. Lee:
The Min-Max Voronoi Diagram of Polygons and Applications in VLSI Manufacturing.
ISAAC 2002: 511-522 |
| 2001 |
|---|
| 15 | EE | Evanthia Papadopoulou:
Critical area computation for missing material defects in VLSIcircuits.
IEEE Trans. on CAD of Integrated Circuits and Systems 20(5): 583-597 (2001) |
| 14 | | Evanthia Papadopoulou,
D. T. Lee:
The Linfty-Voronoi Diagram of Segments and VLSI Applications.
Int. J. Comput. Geometry Appl. 11(5): 503-528 (2001) |
| 2000 |
|---|
| 13 | EE | Evanthia Papadopoulou:
Critical area computation for missing material defects in VLSI circuits.
ISPD 2000: 140-146 |
| 1999 |
|---|
| 12 | EE | Evanthia Papadopoulou,
D. T. Lee:
Critical area computation via Voronoi diagrams.
IEEE Trans. on CAD of Integrated Circuits and Systems 18(4): 463-474 (1999) |
| 11 | | Oswin Aichholzer,
Franz Aurenhammer,
Danny Z. Chen,
D. T. Lee,
Evanthia Papadopoulou:
Skew Voronoi Diagrams.
Int. J. Comput. Geometry Appl. 9(3): 235- (1999) |
| 10 | | Evanthia Papadopoulou:
k-Pairs Non-Crossing Shortest Paths in a Simple Polygon.
Int. J. Comput. Geometry Appl. 9(6): 533- (1999) |
| 1998 |
|---|
| 9 | EE | Evanthia Papadopoulou:
Linfinity Voronoi Diagrams and Applications to VLSI Layout and Manufacturing.
ISAAC 1998: 9-18 |
| 8 | EE | Evanthia Papadopoulou,
D. T. Lee:
Critical area computation - a new approach.
ISPD 1998: 89-94 |
| 7 | | 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) |
| 1997 |
|---|
| 6 | EE | Oswin Aichholzer,
Franz Aurenhammer,
Danny Z. Chen,
D. T. Lee,
Asish Mukhopadhyay,
Evanthia Papadopoulou:
Voronoi Diagrams for Direction-Sensitive Distances.
Symposium on Computational Geometry 1997: 418-420 |
| 1996 |
|---|
| 5 | | Evanthia Papadopoulou:
k-Pairs Non-Crossing Shortest Paths in a Simple Polygon.
ISAAC 1996: 305-314 |
| 1995 |
|---|
| 4 | | 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 |
|---|
| 3 | | Evanthia Papadopoulou,
D. T. Lee:
Shortest Paths in a Simple Polygon in the Presence of Forbidden Vertices.
CCCG 1994: 110-115 |
| 1993 |
|---|
| 2 | | D. T. Lee,
Evanthia Papadopoulou:
The All-Pairs Quickest Path Problem.
Inf. Process. Lett. 45(5): 261-267 (1993) |
| 1987 |
|---|
| 1 | | Evanthia Papadopoulou,
Theodore S. Papatheodorou:
Least-Squares Iterative Solution on a Fixed-Size VLSI Architecture.
ICS 1987: 914-925 |
