Ivanov, Grigory. “On the Volume of Projections of the Cross-Polytope.”10.1016/j.disc.2021.112312__Discrete Mathematics, vol. 344, no. 5, 112312, Elsevier, 2021, doi:10.1016/j.disc.2021.112312.

Arroyo Guevara, Alan M., et al. “Drawings of Complete Graphs in the Projective Plane.”10.1002/jgt.22665__Journal of Graph Theory, vol. 97, no. 3, Wiley, 2021, pp. 426–40, doi:10.1002/jgt.22665.

Arroyo Guevara, Alan M., et al. “Extending Drawings of Complete Graphs into Arrangements of Pseudocircles.”10.1137/20M1313234__SIAM Journal on Discrete Mathematics, vol. 35, no. 2, Society for Industrial and Applied Mathematics, 2021, pp. 1050–76, doi:10.1137/20M1313234.

Ivanov, Grigory, and Igor Tsiutsiurupa. “Functional Löwner Ellipsoids.”10.1007/s12220-021-00691-4__Journal of Geometric Analysis, vol. 31, Springer, 2021, pp. 11493–528, doi:10.1007/s12220-021-00691-4.

Avvakumov, Sergey, et al. “Eliminating Higher-Multiplicity Intersections. III. Codimension 2.”10.1007/s11856-021-2216-z__Israel Journal of Mathematics, vol. 245, Springer Nature, 2021, pp. 501–534, doi:10.1007/s11856-021-2216-z.

Ivanov, Grigory, and Igor Tsiutsiurupa. “On the Volume of Sections of the Cube.”10.1515/agms-2020-0103__Analysis and Geometry in Metric Spaces, vol. 9, no. 1, De Gruyter, 2021, pp. 1–18, doi:10.1515/agms-2020-0103.

Ivanov, Grigory. “Tight Frames and Related Geometric Problems.”10.4153/s000843952000096x__Canadian Mathematical Bulletin, vol. 64, no. 4, Canadian Mathematical Society, 2021, pp. 942–63, doi:10.4153/s000843952000096x.

Filakovský, Marek, et al. “Embeddability of Simplicial Complexes Is Undecidable.”10.1137/1.9781611975994.47__Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 2020–January, SIAM, 2020, pp. 767–85, doi:10.1137/1.9781611975994.47.

Avvakumov, Sergey, and Gabriel Nivasch. “Homotopic Curve Shortening and the Affine Curve-Shortening Flow.”10.4230/LIPIcs.SoCG.2020.12__36th International Symposium on Computational Geometry, vol. 164, 12:1-12:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.12.

Patakova, Zuzana. “Bounding Radon Number via Betti Numbers.”10.4230/LIPIcs.SoCG.2020.61__36th International Symposium on Computational Geometry, vol. 164, 61:1-61:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.61.

Patakova, Zuzana, et al. “Barycentric Cuts through a Convex Body.”10.4230/LIPIcs.SoCG.2020.62__36th International Symposium on Computational Geometry, vol. 164, 62:1-62:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.62.

Arroyo Guevara, Alan M., et al. “Extending Drawings of Graphs to Arrangements of Pseudolines.”10.4230/LIPIcs.SoCG.2020.9__36th International Symposium on Computational Geometry, vol. 164, 9:1-9:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.9.

Wagner, Uli, and Emo Welzl. “Connectivity of Triangulation Flip Graphs in the Plane (Part II: Bistellar Flips).”10.4230/LIPIcs.SoCG.2020.67__36th International Symposium on Computational Geometry, vol. 164, 67:1-67:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.67.

Wagner, Uli, and Emo Welzl. “Connectivity of Triangulation Flip Graphs in the Plane (Part I: Edge Flips).”10.1137/1.9781611975994.172__Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 2020–January, SIAM, 2020, pp. 2823–41, doi:10.1137/1.9781611975994.172.

Avvakumov, Sergey, et al. “Eliminating Higher-Multiplicity Intersections, III. Codimension 2.”10.1070/RM9943__Russian Mathematical Surveys, vol. 75, no. 6, IOP Publishing, 2020, pp. 1156–58, doi:10.1070/RM9943.

Filakovský, Marek, and Lukas Vokínek. “Are Two given Maps Homotopic? An Algorithmic Viewpoint.”10.1007/s10208-019-09419-x__Foundations of Computational Mathematics, vol. 20, Springer Nature, 2020, pp. 311–30, doi:10.1007/s10208-019-09419-x.

Kalai, Gil, and Zuzana Patakova. “Intersection Patterns of Planar Sets.”10.1007/s00454-020-00205-z__Discrete and Computational Geometry, vol. 64, Springer Nature, 2020, pp. 304–23, doi:10.1007/s00454-020-00205-z.

Arroyo Guevara, Alan M., et al. “Inserting One Edge into a Simple Drawing Is Hard.”10.1007/978-3-030-60440-0_26__Graph-Theoretic Concepts in Computer Science, vol. 12301, Springer Nature, 2020, pp. 325–38, doi:10.1007/978-3-030-60440-0_26.

Masárová, Zuzana. Reconfiguration Problems. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:7944.

Huszár, Kristóf. Combinatorial Width Parameters for 3-Dimensional Manifolds. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8032.