Elena A. Arseneva

Assistant Professor

29 Line 14th (Vasilyevsky Island), 199178 Saint Petersburg, Russia

By appointment

06.2016 — Ph.D. in Informatics

**Institution:** Università della Svizzera italiana (Lugano, Switzerland)

**Thesis title:** On the Hausdorff and Other Cluster Voronoi Diagrams

**Advisor:** E. Papadopoulou

06.2010 — Specialist Degree («Mathematics and Software Engineering»)

**Intitution: **St. Petersburg State University

- algorithms and data structures
- computational and discrete geometry
- geometric data structures
- graph drawing

- E. Arseneva, P. Bose, P. Cano, A. D'Angelo, V. Dujmovic, F. Frati, S. Langerman and A. Tappini. Pole dancing: 3D morphs for tree drawings. In: Proc. GD 2018: The 26th International Symposium on Graph Drawing and Network Visualization, pp. 371–384.
- I. van der Hoog, E. Khramtcova and M. Löffler. Dynamic smooth compressed quadtrees. In: Proc. SOCG 2018: The 34th International Symposium on Computational Geometry, 2018, pp. 45:1–45:15.
- M. Claverol, E. Khramtcova, E. Papadopoulou, M. Saumell and C. Seara. Stabbing circles for sets of segments in the plane. Algorithmica 80:3 (2018), 849–884.
- J. Iacono, E. Khramtcova and S. Langerman. Searching edges in the overlap of two plane graphs. In: Proc. WADS 2017: Algorithms and Data Structures 15th International Symposium, 2017, pp. 473–484.
- P. Cheilaris, E. Khramtcova, S. Langerman and E. Papadopoulou. A randomized incremental algorithm for the Hausdorff Voronoi diagram of non-crossing clusters. Algorithmica 76:4 (2016), 935–960.

See my curriculum vitae and my list of publications (in English).