( en | de | ru )

 

Disambiguation of "Papadopoulou, Evanthia"

Author of the publication

copydeleteadd this publication to your clipboard
Critical area computation for missing material defects in VLSIcircuits.

. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 20 (5): 583-597 (2001)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Evanthia Kigitsidou

Konstadia Papadopoulou

Simira Papadopoulou

Evanthia Nitsiota

Evanthia Mergia

 

Other publications of authors with the same name

On the Hausdorff Voronoi Diagram of Point Clusters in the Plane.. WADS, volume 2748 of Lecture Notes in Computer Science, page 439-450. Springer, (2003)Map of Geometric Minimal Cuts for General Planar Embedding., , and . COCOA, volume 8287 of Lecture Notes in Computer Science, page 238-249. Springer, (2013)Critical area computation for missing material defects in VLSIcircuits.. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 20 (5): 583-597 (2001)Net-Aware Critical Area Extraction for Opens in VLSI Circuits Via Higher-Order Voronoi Diagrams.. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 30 (5): 704-717 (2011)Piecewise-Linear Farthest-Site Voronoi Diagrams., , and . ISAAC, volume 212 of LIPIcs, page 30:1-30:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Unbounded Regions of High-Order Voronoi Diagrams of Lines and Segments in Higher Dimensions., , and . ISAAC, volume 149 of LIPIcs, page 62:1-62:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)The L∞ (L1) Farthest Line-Segment Voronoi Diagram., and . ISVD, page 49-55. IEEE Computer Society, (2012)Farthest Color Voronoi Diagrams: Complexity and Algorithms., , , and . LATIN, volume 12118 of Lecture Notes in Computer Science, page 283-295. Springer, (2020)Stabbing Circles for Sets of Segments in the Plane., , , , and . LATIN, volume 9644 of Lecture Notes in Computer Science, page 290-305. Springer, (2016)k-Pairs Non-Crossing Shortest Paths in a Simple Polygon.. ISAAC, volume 1178 of Lecture Notes in Computer Science, page 305-314. Springer, (1996)