default search action
Elena Arseneva
Person information
- affiliation: St. Petersburg State University (SPbU), Department of Mathematics and Computer Science, Russia
- affiliation: Université libre de Bruxelles (ULB), Department of Mathematics and Computer Science, Brussels, Belgium
- affiliation (PhD 2016): University of Lugano (USI), Faculty of Informatics, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j11]Elena Arseneva
, Linda Kleist
Adjacency Graphs of Polyhedral Surfaces. Discret. Comput. Geom. 71(4): 1429-1455 (2024) - 2023
- [j10]Tamara Mchedlidze, Elena Arseneva:
Editorial. Comput. Geom. 110: 101962 (2023) - [j9]Elena Arseneva, Rahul Gangopadhyay, Aleksandra Istomina
Morphing tree drawings in a small 3D grid. J. Graph Algorithms Appl. 27(4): 241-279 (2023) - 2022
- [c16]Elena Arseneva, Erik D. Demaine, Tonan Kamata, Ryuhei Uehara:
Discretization to Prove the Nonexistence of "Small" Common Unfoldings Between Polyhedra. CCCG 2022: 9-23 - [c15]Aleksandra Istomina
Morphing Tree Drawings in a Small 3D Grid. WALCOM 2022: 85-96 - 2021
- [j8]Elena Arseneva
Rectilinear link diameter and radius in a rectilinear polygonal domain. Comput. Geom. 92: 101685 (2021) - [c14]Elena Arseneva, Linda Kleist
Adjacency Graphs of Polyhedral Surfaces. SoCG 2021: 11:1-11:17 - [c13]Elena Arseneva
Upward Point Set Embeddings of Paths and Trees. WALCOM 2021: 234-246 - [i15]Elena Arseneva, Linda Kleist, Boris Klemz, Maarten Löffler, André Schulz, Birgit Vogtenhuber, Alexander Wolff:
Adjacency Graphs of Polyhedral Surfaces. CoRR abs/2103.09803 (2021) - [i14]Elena Arseneva, Rahul Gangopadhyay, Aleksandra Istomina:
Morphing tree drawings in a small 3D grid. CoRR abs/2106.04289 (2021) - 2020
- [j7]Elena Arseneva, Stefan Langerman:
Which Convex Polyhedra Can Be Made by Gluing Regular Hexagons? Graphs Comb. 36(2): 339-345 (2020) - [j6]Elena Arseneva, John Iacono, Grigorios Koumoutsos, Stefan Langerman, Boris Zolotov:
Sublinear Explicit Incremental Planar Voronoi Diagrams. J. Inf. Process. 28: 766-774 (2020) - [j5]Elena Arseneva, Stefan Langerman, Boris Zolotov:
A Complete List of All Convex Polyhedra Made by Gluing Regular Pentagons. J. Inf. Process. 28: 791-799 (2020) - [c12]Elena Arseneva, Prosenjit Bose, Pilar Cano, Rodrigo I. Silveira:
Flips in Higher Order Delaunay Triangulations. LATIN 2020: 223-234 - [i13]Elena Arseneva, Stefan Langerman:
Which convex polyhedra can be made by gluing regular hexagons? CoRR abs/2002.02052 (2020) - [i12]Elena Arseneva, Yeganeh Bahoo, Ahmad Biniaz, Pilar Cano, Farah Chanchary, John Iacono, Kshitij Jain, Anna Lubiw, Debajyoti Mondal, Khadijeh Sheikhan, Csaba D. Tóth:
Compatible Paths on Labelled Point Sets. CoRR abs/2004.07996 (2020) - [i11]Elena Arseneva, John Iacono, Grigorios Koumoutsos, Stefan Langerman, Boris Zolotov:
Sublinear Explicit Incremental Planar Voronoi Diagrams. CoRR abs/2007.01686 (2020) - [i10]Elena Arseneva, Stefan Langerman, Boris Zolotov:
A Complete List of All Convex Polyhedra Made by Gluing Regular Pentagons. CoRR abs/2007.01753 (2020) - [i9]Elena Arseneva, Pilar Cano, Linda Kleist, Tamara Mchedlidze, Saeed Mehrabi, Irene Parada, Pavel Valtr:
Upward Point Set Embeddings of Paths and Trees. CoRR abs/2012.10525 (2020)
2010 – 2019
- 2019
- [j4]Elena Arseneva
Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended. J. Comb. Optim. 37(2): 579-600 (2019) - [j3]Elena Arseneva, Prosenjit Bose, Pilar Cano, Anthony D'Angelo, Vida Dujmovic, Fabrizio Frati
Pole Dancing: 3D Morphs for Tree Drawings. J. Graph Algorithms Appl. 23(3): 579-602 (2019) - [c11]Elena Arseneva, Prosenjit Bose, Jean-Lou De Carufel, Sander Verdonschot:
Reconstructing a Convex Polygon from Its \omega ω -cloud. CSR 2019: 25-37 - 2018
- [j2]Mercè Claverol
Stabbing Circles for Sets of Segments in the Plane. Algorithmica 80(3): 849-884 (2018) - [c10]Elena Arseneva, Yeganeh Bahoo, Ahmad Biniaz, Pilar Cano, Farah Chanchary, John Iacono, Kshitij Jain, Anna Lubiw, Debajyoti Mondal, Khadijeh Sheikhan, Csaba D. Tóth:
Compatible Paths on Labelled Point Sets. CCCG 2018: 54-60 - [c9]Ivor van der Hoog
Dynamic Smooth Compressed Quadtrees. SoCG 2018: 45:1-45:15 - [c8]Elena Arseneva, Prosenjit Bose, Pilar Cano, Anthony D'Angelo, Vida Dujmovic, Fabrizio Frati
Pole Dancing: 3D Morphs for Tree Drawings. GD 2018: 371-384 - [c7]Elena Arseneva, Man-Kwun Chiu, Matias Korman, Aleksandar Markovic, Yoshio Okamoto, Aurélien Ooms, André van Renssen, Marcel Roeloffzen:
Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain. ISAAC 2018: 58:1-58:13 - [i8]Prosenjit Bose, Jean-Lou De Carufel, Elena Khramtcova, Sander Verdonschot:
Reconstructing a convex polygon from its ω-cloud. CoRR abs/1801.02162 (2018) - [i7]Elena Arseneva, Prosenjit Bose, Pilar Cano, Anthony D'Angelo, Vida Dujmovic, Fabrizio Frati, Stefan Langerman, Alessandra Tappini:
Pole Dancing: 3D Morphs for Tree Drawings. CoRR abs/1808.10738 (2018) - 2017
- [c6]Elena Khramtcova, Evanthia Papadopoulou
Randomized Incremental Construction for the Hausdorff Voronoi Diagram Revisited and Extended. COCOON 2017: 321-332 - [c5]Elena Khramtcova, Maarten Löffler:
Dynamic Stabbing Queries with Sub-logarithmic Local Updates for Overlapping Intervals. CSR 2017: 176-190 - [c4]John Iacono
Searching Edges in the Overlap of Two Plane Graphs. WADS 2017: 473-484 - [i6]John Iacono
Searching edges in the overlap of two plane graphs. CoRR abs/1701.02229 (2017) - [i5]Man-Kwun Chiu, Elena Khramtcova, Matias Korman, Aleksandar Markovic, Yoshio Okamoto, Aurélien Ooms, André van Renssen, Marcel Roeloffzen:
Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain. CoRR abs/1712.05538 (2017) - [i4]Ivor van der Hoog, Elena Khramtcova, Maarten Löffler:
Dynamic smooth compressed quadtrees (Fullversion). CoRR abs/1712.05591 (2017) - 2016
- [j1]Panagiotis Cheilaris, Elena Khramtcova, Stefan Langerman, Evanthia Papadopoulou
A Randomized Incremental Algorithm for the Hausdorff Voronoi Diagram of Non-crossing Clusters. Algorithmica 76(4): 935-960 (2016) - [c3]Mercè Claverol
Stabbing Circles for Sets of Segments in the Plane. LATIN 2016: 290-305 - [i3]Elena Khramtcova, Evanthia Papadopoulou:
Randomized Incremental Construction for the Hausdorff Voronoi Diagram of point clusters. CoRR abs/1612.01335 (2016) - 2015
- [c2]Elena Khramtcova, Evanthia Papadopoulou
Linear-Time Algorithms for the Farthest-Segment Voronoi Diagram and Related Tree Structures. ISAAC 2015: 404-414 - 2014
- [c1]Panagiotis Cheilaris, Elena Khramtcova, Stefan Langerman
A Randomized Incremental Approach for the Hausdorff Voronoi Diagram of Non-crossing Clusters. LATIN 2014: 96-107 - [i2]Elena Khramtcova, Sandeep K. Dey, Evanthia Papadopoulou:
Linear-Time Algorithms for the Farthest-Segment Voronoi Diagram and Related Tree Structures. CoRR abs/1411.2816 (2014) - 2013
- [i1]Panagiotis Cheilaris, Elena Khramtcova, Stefan Langerman, Evanthia Papadopoulou:
A Randomized Incremental Approach for the Hausdorff Voronoi Diagram of Non-crossing Clusters. CoRR abs/1312.3904 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: