Evanthia Papadopoulou

75 papers A* 4A 5B 14C 1Misc 1Journal 38Unranked 11

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	The Voronoi Diagram of Four Lines in ℝ CoRR Evanthia Papadopoulou, Zeyu Wang
2026	J	`jnl`	The Voronoi Diagram of Rotating Rays with Applications to Floodlight Illumination. Algorithmica Carlos Alegría, Ioannis Mantas, Evanthia Papadopoulou, Marko Savic, Carlos Seara, Martin Suderland
2025	A*	`conf`	Higher-Order Color Voronoi Diagrams and the Colorful Clarkson-Shor Framework. SoCG Sang Won Bae, Nicolau Oliver, Evanthia Papadopoulou
2025	J	`jnl`	Higher-Order Color Voronoi Diagrams and the Colorful Clarkson-Shor Framework. CoRR Sang Won Bae, Nicolau Oliver, Evanthia Papadopoulou
2025	J	`jnl`	The Farthest Color Voronoi Diagram in the Plane. Algorithmica Ioannis Mantas, Evanthia Papadopoulou, Rodrigo I. Silveira, Zeyu Wang
2025	J	`jnl`	Towards more Inclusive Museums Using AI: Guidance in Sign Language. ERCIM News Dimitrios I. Kosmopoulos, Evanthia Papadopoulou, Antonis A. Argyros
2024	J	`jnl`	Unbounded Regions of High-Order Voronoi Diagrams of Lines and Line Segments in Higher Dimensions. Discret. Comput. Geom. Gill Barequet, Evanthia Papadopoulou, Martin Suderland
2023	A*	`conf`	Abstract Voronoi-Like Graphs: Extending Delaunay's Theorem and Applications. SoCG Evanthia Papadopoulou
2023	J	`jnl`	Abstract Voronoi-like Graphs: Extending Delaunay's Theorem and Applications. CoRR Evanthia Papadopoulou
2023	J	`jnl`	Deletion in Abstract Voronoi Diagrams in Expected Linear Time and Related Problems. Discret. Comput. Geom. Kolja Junginger, Evanthia Papadopoulou
2023	J	`jnl`	On selecting a fraction of leaves with disjoint neighborhoods in a plane tree. CoRR Kolja Junginger, Ioannis Mantas, Evanthia Papadopoulou
2023	J	`jnl`	The Voronoi Diagram of Rotating Rays with applications to Floodlight Illumination. CoRR Carlos Alegría, Ioannis Mantas, Evanthia Papadopoulou, Marko Savic, Carlos Seara, Martin Suderland
2022	J	`jnl`	On selecting a fraction of leaves with disjoint neighborhoods in a plane tree. Discret. Appl. Math. Kolja Junginger, Ioannis Mantas, Evanthia Papadopoulou
2022	A*	`conf`	Subdivision Methods for Sum-Of-Distances Problems: Fermat-Weber Point, n-Ellipses and the Min-Sum Cluster Voronoi Diagram (Media Exposition). SoCG Ioannis Mantas, Evanthia Papadopoulou, Martin Suderland, Chee Yap
2021	A	`conf`	Certified Approximation Algorithms for the Fermat Point and n-Ellipses. ESA Kolja Junginger, Ioannis Mantas, Evanthia Papadopoulou, Martin Suderland, Chee Yap
2021	B	`conf`	Piecewise-Linear Farthest-Site Voronoi Diagrams. ISAAC Franz Aurenhammer, Evanthia Papadopoulou, Martin Suderland
2021	A	`conf`	The Voronoi Diagram of Rotating Rays With applications to Floodlight Illumination. ESA Carlos Alegría, Ioannis Mantas, Evanthia Papadopoulou, Marko Savic, Hendrik Schrezenmaier, Carlos Seara, Martin Suderland
2020	B	`conf`	Farthest Color Voronoi Diagrams: Complexity and Algorithms. LATIN Ioannis Mantas, Evanthia Papadopoulou, Vera Sacristán, Rodrigo I. Silveira
2019	—	`conf`	On Selecting Leaves with Disjoint Neighborhoods in Embedded Trees. CALDAM Kolja Junginger, Ioannis Mantas, Evanthia Papadopoulou
2019	J	`jnl`	Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended. J. Comb. Optim. Elena Arseneva, Evanthia Papadopoulou
2019	B	`conf`	Unbounded Regions of High-Order Voronoi Diagrams of Lines and Segments in Higher Dimensions. ISAAC Gill Barequet, Evanthia Papadopoulou, Martin Suderland
2018	A*	`conf`	Deletion in Abstract Voronoi Diagrams in Expected Linear Time. SoCG Kolja Junginger, Evanthia Papadopoulou
2018	J	`jnl`	Deletion in abstract Voronoi diagrams in expected linear time. CoRR Kolja Junginger, Evanthia Papadopoulou
2018	J	`jnl`	Stabbing Circles for Sets of Segments in the Plane. Algorithmica Mercè Claverol, Elena Khramtcova, Evanthia Papadopoulou, Maria Saumell, Carlos Seara
2017	Misc	`conf`	Randomized Incremental Construction for the Hausdorff Voronoi Diagram Revisited and Extended. COCOON Elena Khramtcova, Evanthia Papadopoulou
2016	J	`jnl`	A Randomized Incremental Algorithm for the Hausdorff Voronoi Diagram of Non-crossing Clusters. Algorithmica Panagiotis Cheilaris, Elena Khramtcova, Stefan Langerman, Evanthia Papadopoulou
2016	J	`jnl`	A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams. Comput. Geom. Cecilia Bohler, Chih-Hung Liu, Evanthia Papadopoulou, Maksym Zavershynskyi
2016	J	`jnl`	Planar Minimization Diagrams via Subdivision with Applications to Anisotropic Voronoi Diagrams. Comput. Graph. Forum Huck Bennett, Evanthia Papadopoulou, Chee Yap
2016	J	`jnl`	Randomized Incremental Construction for the Hausdorff Voronoi Diagram of point clusters. CoRR Elena Khramtcova, Evanthia Papadopoulou
2016	B	`conf`	Stabbing Circles for Sets of Segments in the Plane. LATIN Mercè Claverol, Elena Khramtcova, Evanthia Papadopoulou, Maria Saumell, Carlos Seara
2016	J	`jnl`	The Higher-Order Voronoi Diagram of Line Segments. Algorithmica Evanthia Papadopoulou, Maksym Zavershynskyi
2015	B	`conf`	Linear-Time Algorithms for the Farthest-Segment Voronoi Diagram and Related Tree Structures. ISAAC Elena Khramtcova, Evanthia Papadopoulou
2015	J	`jnl`	On the complexity of higher order abstract Voronoi diagrams. Comput. Geom. Cecilia Bohler, Panagiotis Cheilaris, Rolf Klein, Chih-Hung Liu, Evanthia Papadopoulou, Maksym Zavershynskyi
2015	J	`jnl`	The L∞ Hausdorff Voronoi Diagram Revisited. Int. J. Comput. Geom. Appl. Evanthia Papadopoulou, Jinhui Xu
2015	J	`jnl`	The k-Nearest-Neighbor Voronoi Diagram Revisited. Algorithmica Chih-Hung Liu, Evanthia Papadopoulou, Der-Tsai Lee
2014	B	`conf`	A Randomized Divide and Conquer Algorithm for Higher-Order Abstract Voronoi Diagrams. ISAAC Cecilia Bohler, Chih-Hung Liu, Evanthia Papadopoulou, Maksym Zavershynskyi
2014	B	`conf`	A Randomized Incremental Approach for the Hausdorff Voronoi Diagram of Non-crossing Clusters. LATIN Panagiotis Cheilaris, Elena Khramtcova, Stefan Langerman, Evanthia Papadopoulou
2014	J	`jnl`	Computing the Map of Geometric Minimal Cuts. Algorithmica Jinhui Xu, Lei Xu, Evanthia Papadopoulou
2014	—	`conf`	Implementing the L ∞ Segment Voronoi Diagram in CGAL and Applying in VLSI Pattern Analysis. ICMS Panagiotis Cheilaris, Sandeep Kumar Dey, Maria Gabrani, Evanthia Papadopoulou
2014	J	`jnl`	Linear-Time Algorithms for the Farthest-Segment Voronoi Diagram and Related Tree Structures. CoRR Elena Khramtcova, Sandeep K. Dey, Evanthia Papadopoulou
2014	J	`jnl`	The Higher-Order Voronoi Diagram of Line Segments. CoRR Evanthia Papadopoulou, Maksym Zavershynskyi
2013	J	`jnl`	A Randomized Incremental Approach for the Hausdorff Voronoi Diagram of Non-crossing Clusters. CoRR Panagiotis Cheilaris, Elena Khramtcova, Stefan Langerman, Evanthia Papadopoulou
2013	—	`conf`	A Sweepline Algorithm for Higher Order Voronoi Diagrams. ISVD Maksym Zavershynskyi, Evanthia Papadopoulou
2013	C	`conf`	Map of Geometric Minimal Cuts for General Planar Embedding. COCOA Lei Xu, Evanthia Papadopoulou, Jinhui Xu
2013	—	`conf`	On the Complexity of Higher Order Abstract Voronoi Diagrams. ICALP (1) Cecilia Bohler, Panagiotis Cheilaris, Rolf Klein, Chih-Hung Liu, Evanthia Papadopoulou, Maksym Zavershynskyi
2013	J	`jnl`	On the Farthest Line-Segment Voronoi Diagram. Int. J. Comput. Geom. Appl. Evanthia Papadopoulou, Sandeep Kumar Dey
2013	—	`conf`	On the Farthest-Neighbor Voronoi Diagram of Segments in Three Dimensions. ISVD Gill Barequet, Evanthia Papadopoulou
2012	B	`conf`	On Higher Order Voronoi Diagrams of Line Segments. ISAAC Evanthia Papadopoulou, Maksym Zavershynskyi
2012	B	`conf`	On the Farthest Line-Segment Voronoi Diagram. ISAAC Evanthia Papadopoulou, Sandeep K. Dey
2012	—	`conf`	The L ISVD Sandeep K. Dey, Evanthia Papadopoulou
2011	A	`conf`	An Output-Sensitive Approach for the L 1/L ∞ k-Nearest-Neighbor Voronoi Diagram. ESA Chih-Hung Liu, Evanthia Papadopoulou, D. T. Lee
2011	J	`jnl`	Net-Aware Critical Area Extraction for Opens in VLSI Circuits Via Higher-Order Voronoi Diagrams. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. Evanthia Papadopoulou
2011	—	`conf`	The L ISVD Evanthia Papadopoulou, Jinhui Xu
2009	B	`conf`	Computing the Map of Geometric Minimal Cuts. ISAAC Jinhui Xu, Lei Xu, Evanthia Papadopoulou
2008	—	`ch.`	Yield Analysis and Optimization. Handbook of Algorithms for Physical Design Automation Puneet Gupta, Evanthia Papadopoulou
2007	B	`conf`	Higher Order Voronoi Diagrams of Segments for VLSI Critical Area Extraction. ISAAC Evanthia Papadopoulou
2006	J	`jnl`	Robustness of Inf. Process. Lett. Zhenming Chen, Evanthia Papadopoulou, Jinhui Xu
2004	J	`jnl`	The Hausdorff Voronoi Diagram of Point Clusters in the Plane. Algorithmica Evanthia Papadopoulou
2004	J	`jnl`	The hausdorff voronoi diagram of polygonal objects: a divide and conquer approach. Int. J. Comput. Geom. Appl. Evanthia Papadopoulou, D. T. Lee
2003	B	`conf`	On the Hausdorff Voronoi Diagram of Point Clusters in the Plane. WADS Evanthia Papadopoulou
2002	B	`conf`	The Min-Max Voronoi Diagram of Polygons and Applications in VLSI Manufacturing. ISAAC Evanthia Papadopoulou, D. T. Lee
2001	J	`jnl`	Critical area computation for missing material defects in VLSIcircuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. Evanthia Papadopoulou
2001	J	`jnl`	The L Int. J. Comput. Geom. Appl. Evanthia Papadopoulou, D. T. Lee
2000	—	`conf`	Critical area computation for missing material defects in VLSI circuits. ISPD Evanthia Papadopoulou
1999	J	`jnl`	Critical area computation via Voronoi diagrams. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. Evanthia Papadopoulou, D. T. Lee
1999	J	`jnl`	Skew Voronoi Diagrams. Int. J. Comput. Geom. Appl. Oswin Aichholzer, Franz Aurenhammer, Danny Z. Chen, D. T. Lee, Evanthia Papadopoulou
1999	J	`jnl`	k-Pairs Non-Crossing Shortest Paths in a Simple Polygon. Int. J. Comput. Geom. Appl. Evanthia Papadopoulou
1998	J	`jnl`	A New Approach for the Geodesic Voronoi Diagram of Points in a Simple Polygon and Other Restricted Polygonal Domains. Algorithmica Evanthia Papadopoulou, D. T. Lee
1998	—	`conf`	Critical area computation - a new approach. ISPD Evanthia Papadopoulou, D. T. Lee
1998	B	`conf`	L ISAAC Evanthia Papadopoulou
1997	—	`conf`	Voronoi Diagrams for Direction-Sensitive Distances. SCG Oswin Aichholzer, Franz Aurenhammer, Danny Z. Chen, D. T. Lee, Asish Mukhopadhyay, Evanthia Papadopoulou
1995	A	`conf`	Efficient Computation of the Geodesic Voronoi Diagram of Points in a Simple Polygon (Extended Abstract). ESA Evanthia Papadopoulou, D. T. Lee
1994	—	`conf`	Shortest Paths in a Simple Polygon in the Presence of Forbidden Vertices. CCCG Evanthia Papadopoulou, D. T. Lee
1993	J	`jnl`	The All-Pairs Quickest Path Problem. Inf. Process. Lett. D. T. Lee, Evanthia Papadopoulou
1987	A	`conf`	Least-Squares Iterative Solution on a Fixed-Size VLSI Architecture. ICS Evanthia Papadopoulou, Theodore S. Papatheodorou