Elena Arseneva (Khramtcova)
Elena Arseneva (Khramtcova)
SPbU Saint-Petersburg
Verified email at ulb.ac.be
Title
Cited by
Cited by
Year
Stabbing circles for sets of segments in the plane
M Claverol, E Khramtcova, E Papadopoulou, M Saumell, C Seara
Algorithmica 80 (3), 849-884, 2018
122018
A randomized incremental approach for the Hausdorff Voronoi diagram of non-crossing clusters
P Cheilaris, E Khramtcova, S Langerman, E Papadopoulou
Latin American Symposium on Theoretical Informatics, 96-107, 2014
102014
Linear-time algorithms for the farthest-segment Voronoi diagram and related tree structures
E Khramtcova, E Papadopoulou
International Symposium on Algorithms and Computation, 404-414, 2015
92015
A randomized incremental algorithm for the Hausdorff Voronoi diagram of non-crossing clusters
P Cheilaris, E Khramtcova, S Langerman, E Papadopoulou
Algorithmica 76 (4), 935-960, 2016
82016
Stabbing circles for some sets of Delaunay segments
M Claverol, E Khramtcova, E Papadopoulou, M Saumell, C Seara
32th Eur. Workshop on Comput. Geom.(EuroCG), 139-143, 2016
32016
Randomized incremental construction of the Hausdorff Voronoi diagram of non-crossing clusters
P Cheilaris, E Khramtcova, E Papadopoulou
Technical Report 2012/03, University of Lugano, 2012
32012
Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended
E Arseneva, E Papadopoulou
Journal of Combinatorial Optimization 37 (2), 579-600, 2019
22019
Pole dancing: 3D morphs for tree drawings
E Arseneva, P Bose, P Cano, A D’Angelo, V Dujmović, F Frati, ...
International Symposium on Graph Drawing and Network Visualization, 371-384, 2018
22018
Searching edges in the overlap of two plane graphs
J Iacono, E Khramtcova, S Langerman
Workshop on Algorithms and Data Structures, 473-484, 2017
22017
Dynamic stabbing queries with sub-logarithmic local updates for overlapping intervals
E Khramtcova, M Löffler
International Computer Science Symposium in Russia, 176-190, 2017
22017
A simple RIC for the Hausdorff Voronoi diagram of non-crossing clusters
E Khramtcova, E Papadopoulou
30th European Workshop on Computational Geometry (EuroCG), 2014
22014
Representing Graphs by Polygons with Side Contacts in 3D
E Arseneva, L Kleist, B Klemz, M Löffler, A Schulz, B Vogtenhuber, A Wolff
2
Sublinear Explicit Incremental Planar Voronoi Diagrams
E Arseneva, J Iacono, G Koumoutsos, S Langerman, B Zolotov
arXiv preprint arXiv:2007.01686, 2020
12020
Compatible paths on labelled point sets
E Arseneva, Y Bahoo, A Biniaz, P Cano, F Chanchary, J Iacono, K Jain, ...
arXiv preprint arXiv:2004.07996, 2020
12020
Flips in higher order Delaunay triangulations
E Arseneva, P Bose, P Cano, RI Silveira
Proceedings of the 14th Latin American Theoretical Informatics Symposium …, 2020
12020
Which convex polyhedra can be made by gluing regular hexagons?
E Arseneva, S Langerman
Graphs and Combinatorics, 1-7, 2019
12019
Dynamic smooth compressed quadtrees
I van der Hoog, E Khramtcova, M Löffler
34th International Symposium on Computational Geometry (SoCG 2018), 2018
12018
Randomized incremental construction for the hausdorff voronoi diagram revisited and extended
E Khramtcova, E Papadopoulou
International Computing and Combinatorics Conference, 321-332, 2017
12017
Which convex polyhedra can be made by gluing regular hexagons?
E Khramtcova, S Langerman
Abstracts of the Japan Conference on Discrete and Computational Geometry and …, 2017
12017
A Complete List of All Convex Polyhedra Made by Gluing Regular Pentagons
E Arseneva, S Langerman, B Zolotov
arXiv preprint arXiv:2007.01753, 2020
2020
The system can't perform the operation now. Try again later.
Articles 1–20