1 - 10 out of 17Page size: 10
  1. 2022

  2. Morphing Tree Drawings in a Small 3D Grid

    Истомина, А. А., Арсеньева, Е. А. & Гангопадхай, Р., 23 Mar 2022, WALCOM: Algorithms and Computation - 16th International Conference and Workshops, WALCOM 2022, Proceedings. Mutzel, P., Rahman, M. S. & Slamin (eds.). Springer Nature, p. 85-96 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13174 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  3. 2020

  4. Which Convex Polyhedra Can Be Made by Gluing Regular Hexagons?

    Arseneva, E. & Langerman, S., 1 Mar 2020, In: Graphs and Combinatorics. 36, 2, p. 339-345 7 p.

    Research output: Contribution to journal › Article › peer-review

  5. 2019

  6. Reconstructing a convex polygon from its ω -cloud

    Arseneva, E., Bose, P., De Carufel, J. L. & Verdonschot, S., 1 Jan 2019, Computer Science – Theory and Applications - 14th International Computer Science Symposium in Russia, CSR 2019, Proceedings. van Bevern, R. & Kucherov, G. (eds.). Springer Nature, p. 25-37 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11532 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  7. Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended

    Arseneva, E. & Papadopoulou, E., 2019, In: Journal of Combinatorial Optimization. 37, 2, p. 579-600

    Research output: Contribution to journal › Article › peer-review

  8. 2018

  9. Rectilinear link diameter and radius in a rectilinear polygonal domain

    Arseneva, E., Chiu, M. K., Korman, M., Markovic, A., Okamoto, Y., Ooms, A., Van Renssen, A. & Roeloffzen, M., 1 Dec 2018, 29th International Symposium on Algorithms and Computation, ISAAC 2018. Liao, C-S., Hsu, W-L. & Lee, D-T. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 58:1-58:13 (Leibniz International Proceedings in Informatics, LIPIcs; vol. 123).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  10. Dynamic smooth compressed quadtrees

    Ivor Hoog, V. D., Khramtcova, E. & Löffler, M., 1 Jun 2018, 34th International Symposium on Computational Geometry, SoCG 2018. Toth, C. D. & Speckmann, B. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 99. p. 45:1-45:15 15 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  11. Stabbing Circles for Sets of Segments in the Plane

    Claverol, M., Khramtcova, E., Papadopoulou, E., Saumell, M. & Seara, C., 1 Mar 2018, In: Algorithmica. 80, 3, p. 849-884 36 p.

    Research output: Contribution to journal › Article › peer-review

  12. Pole dancing: 3D morphs for tree drawings

    Arseneva, E., Bose, P., Cano, P., D’Angelo, A., Dujmović, V., Frati, F., Langerman, S. & Tappini, A., 1 Jan 2018, Graph Drawing and Network Visualization - 26th International Symposium, GD 2018, Proceedings. Biedl, T. & Kerren, A. (eds.). Springer Nature, p. 371-384 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11282 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  13. 2017

  14. Dynamic stabbing queries with sub-logarithmic local updates for overlapping intervals

    Khramtcova, E. & Löffler, M., 1 Jan 2017, Computer Science - Theory and Applications - 12th International Computer Science Symposium in Russia, CSR 2017, Proceedings. Weil, P. (ed.). Springer Nature, p. 176-190 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10304 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  15. Randomized incremental construction for the hausdorff voronoi diagram revisited and extended

    Khramtcova, E. & Papadopoulou, E., 1 Jan 2017, Computing and Combinatorics - 23rd International Conference, COCOON 2017, Proceedings. Cao, Y. & Chen, J. (eds.). Springer Nature, p. 321-332 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10392 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

Previous 1 2 Next

ID: 32590225