| Stabbing circles for sets of segments in the plane M Claverol, E Khramtcova, E Papadopoulou, M Saumell, C Seara Algorithmica 80, 849-884, 2018 | 19 | 2018 |
| Pole dancing: 3D morphs for tree drawings E Arseneva, P Bose, P Cano, A D'Angelo, V Dujmović, F Frati, ... Journal of Graph Algorithms and Applications 23 (3), 579-602, 2019 | 16 | 2019 |
| 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 | 13 | 2015 |
| 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 | 10 | 2014 |
| A randomized incremental algorithm for the Hausdorff Voronoi diagram of non-crossing clusters P Cheilaris, E Khramtcova, S Langerman, E Papadopoulou Algorithmica 76, 935-960, 2016 | 9 | 2016 |
| Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended E Arseneva, E Papadopoulou Journal of Combinatorial Optimization 37, 579-600, 2019 | 7 | 2019 |
| A complete list of all convex polyhedra made by gluing regular pentagons E Arseneva, S Langerman, B Zolotov Journal of Information Processing 28, 791-799, 2020 | 5 | 2020 |
| Searching edges in the overlap of two plane graphs J Iacono, E Khramtcova, S Langerman Workshop on Algorithms and Data Structures, 473-484, 2017 | 5 | 2017 |
| Which convex polyhedra can be made by gluing regular hexagons? E Arseneva, S Langerman Graphs and Combinatorics 36, 339-345, 2020 | 4 | 2020 |
| 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 | 4 | 2017 |
| Adjacency graphs of polyhedral surfaces E Arseneva, L Kleist, B Klemz, M Löffler, A Schulz, B Vogtenhuber, A Wolff Discrete & Computational Geometry 71 (4), 1429-1455, 2024 | 3 | 2024 |
| Upward point set embeddings of paths and trees E Arseneva, P Cano, L Kleist, T Mchedlidze, S Mehrabi, I Parada, P Valtr WALCOM: Algorithms and Computation: 15th International Conference and …, 2021 | 3 | 2021 |
| Flips in higher order Delaunay triangulations E Arseneva, P Bose, P Cano, RI Silveira Latin American Symposium on Theoretical Informatics, 223-234, 2020 | 3 | 2020 |
| 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 | 3 | 2020 |
| Sublinear explicit incremental planar voronoi diagrams E Arseneva, J Iacono, G Koumoutsos, S Langerman, B Zolotov Journal of Information Processing 28, 766-774, 2020 | 3 | 2020 |
| Dynamic smooth compressed quadtrees I van der Hoog, E Khramtcova, M Löffler 34th International Symposium on Computational Geometry (SoCG 2018), 45: 1-45: 15, 2018 | 3 | 2018 |
| Stabbing circles for some sets of Delaunay segments M Claverol, E Khramtcova, E Papadopoulou, M Saumell, C Seara 32th European Workshop on Computational Geometry (EuroCGâ AZ16), 2016 | 3 | 2016 |
| Randomized incremental construction of the Hausdorff Voronoi diagram of non-crossing clusters P Cheilaris, E Khramtcova, E Papadopoulou arXiv preprint arXiv:1306.5838, 2013 | 3 | 2013 |
| Representing graphs by polygons with edge contacts in 3d E Arseneva, L Kleist, B Klemz, M Löffler, A Schulz, B Vogtenhuber, A Wolff Steven Chaplick, Philipp Kindermann und Alexander Wolff (Herausgeber): Proc …, 0 | 3 | |
| Morphing tree drawings in a small 3d grid A Istomina, E Arseneva, R Gangopadhyay International Conference and Workshops on Algorithms and Computation, 85-96, 2022 | 2 | 2022 |
Evanthia PapadopoulouFaculty of Informatics, Università della Svizzera italiana, Lugano, SwitzerlandVerified email at usi.ch
