Ivanov, G. (2021). On the volume of projections of the cross-polytope. Discrete Mathematics. Elsevier.https://doi.org/10.1016/j.disc.2021.112312 

Arroyo Guevara, A. M., Mcquillan, D., Richter, R. B., Salazar, G., &; Sullivan, M. (2021). Drawings of complete graphs in the projective plane. Journal of Graph Theory. Wiley.https://doi.org/10.1002/jgt.22665 

Arroyo Guevara, A. M., Richter, R. B., &; Sunohara, M. (2021). Extending drawings of complete graphs into arrangements of pseudocircles. SIAM Journal on Discrete Mathematics. Society for Industrial and Applied Mathematics.https://doi.org/10.1137/20M1313234 

Ivanov, G., &; Tsiutsiurupa, I. (2021). Functional Löwner ellipsoids. Journal of Geometric Analysis. Springer.https://doi.org/10.1007/s12220-021-00691-4 

Avvakumov, S., Mabillard, I., Skopenkov, A. B., &; Wagner, U. (2021). Eliminating higher-multiplicity intersections. III. Codimension 2. Israel Journal of Mathematics. Springer Nature.https://doi.org/10.1007/s11856-021-2216-z 

Ivanov, G., &; Tsiutsiurupa, I. (2021). On the volume of sections of the cube. Analysis and Geometry in Metric Spaces. De Gruyter.https://doi.org/10.1515/agms-2020-0103 

Ivanov, G. (2021). Tight frames and related geometric problems. Canadian Mathematical Bulletin. Canadian Mathematical Society.https://doi.org/10.4153/s000843952000096x 

Filakovský, M., Wagner, U., &; Zhechev, S. Y. (2020). Embeddability of simplicial complexes is undecidable. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. 2020–January, pp. 767–785). Salt Lake City, UT, United States: SIAM.https://doi.org/10.1137/1.9781611975994.47 

Avvakumov, S., &; Nivasch, G. (2020). Homotopic curve shortening and the affine curve-shortening flow. In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.SoCG.2020.12 

Patakova, Z. (2020). Bounding radon number via Betti numbers. In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.SoCG.2020.61 

Patakova, Z., Tancer, M., &; Wagner, U. (2020). Barycentric cuts through a convex body. In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.SoCG.2020.62 

Arroyo Guevara, A. M., Bensmail, J., &; Bruce Richter, R. (2020). Extending drawings of graphs to arrangements of pseudolines. In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.SoCG.2020.9 

Wagner, U., &; Welzl, E. (2020). Connectivity of triangulation flip graphs in the plane (Part II: Bistellar flips). In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.SoCG.2020.67 

Wagner, U., &; Welzl, E. (2020). Connectivity of triangulation flip graphs in the plane (Part I: Edge flips). In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. 2020–January, pp. 2823–2841). Salt Lake City, UT, United States: SIAM.https://doi.org/10.1137/1.9781611975994.172 

Avvakumov, S., Wagner, U., Mabillard, I., &; Skopenkov, A. B. (2020). Eliminating higher-multiplicity intersections, III. Codimension 2. Russian Mathematical Surveys. IOP Publishing.https://doi.org/10.1070/RM9943 

Filakovský, M., &; Vokínek, L. (2020). Are two given maps homotopic? An algorithmic viewpoint. Foundations of Computational Mathematics. Springer Nature.https://doi.org/10.1007/s10208-019-09419-x 

Kalai, G., &; Patakova, Z. (2020). Intersection patterns of planar sets. Discrete and Computational Geometry. Springer Nature.https://doi.org/10.1007/s00454-020-00205-z 

Arroyo Guevara, A. M., Klute, F., Parada, I., Seidel, R., Vogtenhuber, B., &; Wiedera, T. (2020). Inserting one edge into a simple drawing is hard. In Graph-Theoretic Concepts in Computer Science (Vol. 12301, pp. 325–338). Leeds, United Kingdom: Springer Nature.https://doi.org/10.1007/978-3-030-60440-0_26 

Masárová, Z. (2020). Reconfiguration problems. Institute of Science and Technology Austria.https://doi.org/10.15479/AT:ISTA:7944 

Huszár, K. (2020). Combinatorial width parameters for 3-dimensional manifolds. Institute of Science and Technology Austria.https://doi.org/10.15479/AT:ISTA:8032