A Randomized Incremental Approach for the Hausdorff Voronoi Diagram of Non-crossing Clusters. - Panagiotis Cheilaris; Elena Khramtcova; Stefan Langerman; Evanthia Papadopoulou (LATIN, 2014)

Linear-Time Algorithms for the Farthest-Segment Voronoi Diagram and Related Tree Structures. - Elena Khramtcova; Sandeep K. Dey; Evanthia Papadopoulou (CoRR, 2014)

Linear-Time Algorithms for the Farthest-Segment Voronoi Diagram and Related Tree Structures. - Elena Khramtcova; Evanthia Papadopoulou (ISAAC, 2015)

A Randomized Incremental Algorithm for the Hausdorff Voronoi Diagram of Non-crossing Clusters. - Panagiotis Cheilaris; Elena Khramtcova; Stefan Langerman; Evanthia Papadopoulou (Algorithmica, 2016)

Randomized Incremental Construction for the Hausdorff Voronoi Diagram of point clusters. - Elena Khramtcova; Evanthia Papadopoulou (CoRR, 2016)

Dynamic Stabbing Queries with Sub-logarithmic Local Updates for Overlapping Intervals. - Elena Khramtcova; Maarten Löffler (CSR, 2017)

Searching Edges in the Overlap of Two Plane Graphs. - John Iacono; Elena Khramtcova; Stefan Langerman (WADS, 2017)

Dynamic smooth compressed quadtrees (Fullversion). - Ivor van der Hoog; Elena Khramtcova; Maarten Löffler (CoRR, 2017)

Compatible Paths on Labelled Point Sets. - Elena Arseneva; Yeganeh Bahoo; Ahmad Biniaz; Pilar Cano; Farah Chanchary; John Iacono; Kshitij Jain 001; Anna Lubiw; Debajyoti Mondal; Khadijeh Sheikhan; Csaba D. Tóth (CCCG, 2018)

Dynamic Smooth Compressed Quadtrees. - Ivor van der Hoog; Elena Khramtcova; Maarten Löffler (SoCG, 2018)

Stabbing Circles for Sets of Segments in the Plane. - Mercè Claverol; Elena Khramtcova; Evanthia Papadopoulou; Maria Saumell; Carlos Seara (Algorithmica, 2018)

Reconstructing a convex polygon from its ω-cloud. - Prosenjit Bose; Jean-Lou De Carufel; Elena Khramtcova; Sander Verdonschot (CoRR, 2018)

Reconstructing a Convex Polygon from Its omega ω -cloud. - Elena Arseneva; Prosenjit Bose; Jean-Lou De Carufel; Sander Verdonschot (CSR, 2019)

Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended. - Elena Arseneva; Evanthia Papadopoulou (J. Comb. Optim., 2019)

Pole Dancing: 3D Morphs for Tree Drawings. - Elena Arseneva; Prosenjit Bose; Pilar Cano; Anthony D'Angelo; Vida Dujmovic; Fabrizio Frati; Stefan Langerman; Alessandra Tappini (J. Graph Algorithms Appl., 2019)

Flips in Higher Order Delaunay Triangulations. - Elena Arseneva; Prosenjit Bose; Pilar Cano; Rodrigo I. Silveira (LATIN, 2020)

Upward Point Set Embeddings of Paths and Trees. - Elena Arseneva; Pilar Cano; Linda Kleist; Tamara Mchedlidze; Saeed Mehrabi 004; Irene Parada; Pavel Valtr 001 (CoRR, 2020)

Which Convex Polyhedra Can Be Made by Gluing Regular Hexagons? - Elena Arseneva; Stefan Langerman (Graphs Comb., 2020)

Sublinear Explicit Incremental Planar Voronoi Diagrams. - Elena Arseneva; John Iacono; Grigorios Koumoutsos; Stefan Langerman; Boris Zolotov (J. Inf. Process., 2020)

A Complete List of All Convex Polyhedra Made by Gluing Regular Pentagons. - Elena Arseneva; Stefan Langerman; Boris Zolotov (J. Inf. Process., 2020)

Upward Point Set Embeddings of Paths and Trees. - Elena Arseneva; Pilar Cano; Linda Kleist; Tamara Mchedlidze; Saeed Mehrabi 001; Irene Parada; Pavel Valtr 001 (WALCOM, 2021)

Rectilinear link diameter and radius in a rectilinear polygonal domain. - Elena Arseneva; Man-Kwun Chiu; Matias Korman; Aleksandar Markovic 001; Yoshio Okamoto; Aurélien Ooms; André van Renssen; Marcel Roeloffzen (Comput. Geom., 2021)

Discretization to Prove the Nonexistence of "Small" Common Unfoldings Between Polyhedra. - Elena Arseneva; Erik D. Demaine; Tonan Kamata; Ryuhei Uehara (CCCG, 2022)

Editorial. - Tamara Mchedlidze; Elena Arseneva (Comput. Geom., 2023)

Morphing tree drawings in a small 3D grid. - Elena Arseneva; Rahul Gangopadhyay; Aleksandra Istomina (J. Graph Algorithms Appl., 2023)

Adjacency Graphs of Polyhedral Surfaces. - Elena Arseneva; Linda Kleist; Boris Klemz; Maarten Löffler; André Schulz 001; Birgit Vogtenhuber; Alexander Wolff 001 (Discret. Comput. Geom., 2024)