| Issue Date | Title | Author(s) | Relation | scopus | WOS | Fulltext/Archive link |
| 1998 | A New Approach for the Geodesic Voronoi Diagram of Points in a Simple Polygon and Other Restricted Polygonal Domains | Papadopoulou, E.; Lee, D. T. | Algorithmica 20, 319-352 | | | |
| 1999 | Critical area computation via Voronoi diagrams | Papadopoulou, E.; Lee, D. T. | IEEE Trans. Computer-Aided Design 18, 463-474 | | | |
| 1999 | Skew Voronoi Diagram | Aichholzer, O.; Aurenhammer, F.; Chen, D. Z.; Lee, D. T. ; Papadopoulou, E. | International Journal of Computational Geometry and Applications 9, 235-247 | | | |
| 1993 | The All-Pairs-Quickest Path Problem | Lee, D. T. ; Papadopoulou, E. | Info. Processing Letters 45, 261-267 | | | |
| 2004 | The Hausdorff Voronoi Diagram of Polygonal Objects: A Divide and Conquer Approach | Papadopoulou, E.; Lee, D. T. | International Journal of Computational Geometry and Applications 14, 421-452 | | | |
| 2001 | The L∞ Voronoi Diagram of Segments and VLSI Applications | Papadopoulou, E.; Lee, D. T. | International Journal of Computational Geometry & Applications 11(5), 503-528 | | | |
| 2002 | The Min-Max Voronoi Diagram of Polygons and Applications in VLSI Manufacturing | Papadopoulou, E.; Lee, D. T. | | | | |
