Brunck, F. R. (2023). Iterated medial triangle subdivision in surfaces of constant curvature. Discrete and Computational Geometry. Springer Nature.https://doi.org/10.1007/s00454-023-00500-5 

Krokhin, A., &; Oprsal, J. (2022). An invitation to the promise constraint satisfaction problem. ACM SIGLOG News. Association for Computing Machinery.https://doi.org/10.1145/3559736.3559740 

Aichholzer, O., Arroyo Guevara, A. M., Masárová, Z., Parada, I., Perz, D., Pilz, A.,https://doi.org/10.7155/jgaa.00591__Vogtenhuber, B. (2022). On compatible matchings. Journal of Graph Algorithms and Applications. Brown University.https://doi.org/10.7155/jgaa.00591 

Wild, P. (2022). High-dimensional expansion and crossing numbers of simplicial complexes. Institute of Science and Technology.https://doi.org/10.15479/at:ista:11777 

Kaluza, V., &; Tancer, M. (2022). Even maps, the Colin de Verdière number and representations of graphs. Combinatorica. Springer Nature.https://doi.org/10.1007/s00493-021-4443-7 

Patakova, Z., Tancer, M., &; Wagner, U. (2022). Barycentric cuts through a convex body. Discrete and Computational Geometry. Springer Nature.https://doi.org/10.1007/s00454-021-00364-7 

Ivanov, G., &; Naszódi, M. (2022). Functional John ellipsoids. Journal of Functional Analysis. Elsevier.https://doi.org/10.1016/j.jfa.2022.109441 

Wagner, U., &; Welzl, E. (2022). Connectivity of triangulation flip graphs in the plane. Discrete &; Computational Geometry. Springer Nature.https://doi.org/10.1007/s00454-022-00436-2 

Fulek, R., &; Kyndl, J. (2022). The Z2-Genus of Kuratowski minors. Discrete and Computational Geometry. Springer Nature.https://doi.org/10.1007/s00454-022-00412-w 

Arroyo Guevara, A. M., &; Felsner, S. (2022). Approximating the bundled crossing number. In WALCOM 2022: Algorithms and Computation (Vol. 13174, pp. 383–395). Jember, Indonesia: Springer Nature.https://doi.org/10.1007/978-3-030-96731-4_31 

Wagner, U. (2022). High-dimensional expanders (after Gromov, Kaufman, Kazhdan, Lubotzky, and others). Bulletin de La Societe Mathematique de France. Societe Mathematique de France.https://doi.org/10.24033/ast.1188 

Ivanov, G., &; Naszodi, M. (2022). A quantitative Helly-type theorem: Containment in a homothet. SIAM Journal on Discrete Mathematics. Society for Industrial and Applied Mathematics.https://doi.org/10.1137/21M1403308 

Aichholzer, O., Arroyo Guevara, A. M., Masárová, Z., Parada, I., Perz, D., Pilz, A.,https://doi.org/10.1007/978-3-030-68211-8_18__Vogtenhuber, B. (2021). On compatible matchings. In 15th International Conference on Algorithms and Computation (Vol. 12635, pp. 221–233). Yangon, Myanmar: Springer Nature.https://doi.org/10.1007/978-3-030-68211-8_18 

Ivanov, G. (2021). No-dimension Tverberg’s theorem and its corollaries in Banach spaces of type p. Bulletin of the London Mathematical Society. London Mathematical Society.https://doi.org/10.1112/blms.12449 

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 

Ivanov, G., &; Lopushanski, M. S. (2021). Rectifiable curves in proximally smooth sets. Set-Valued and Variational Analysis. Springer Nature.https://doi.org/10.1007/s11228-021-00612-1 

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 

Avvakumov, S. (2020). Topological methods in geometry and discrete mathematics. Institute of Science and Technology Austria.https://doi.org/10.15479/AT:ISTA:8156 

Aichholzer, O., Obmann, J., Patak, P., Perz, D., &; Tkadlec, J. (2020). Disjoint tree-compatible plane perfect matchings. In 36th European Workshop on Computational Geometry. Würzburg, Germany, Virtual.

Fulek, R., &; Kyncl, J. (2019). Z_2-Genus of graphs and minimum rank of partial symmetric matrices. In 35th International Symposium on Computational Geometry (SoCG 2019) (Vol. 129). Portland, OR, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPICS.SOCG.2019.39 

Chaplick, S., Fulek, R., &; Klavík, P. (2019). Extending partial representations of circle graphs. Journal of Graph Theory. Wiley.https://doi.org/10.1002/jgt.22436 

Fulek, R., &; Pach, J. (2019). Thrackles: An improved upper bound. Discrete Applied Mathematics. Elsevier.https://doi.org/10.1016/j.dam.2018.12.025 

Silva, A., Arroyo Guevara, A. M., Richter, B., &; Lee, O. (2019). Graphs with at most one crossing. Discrete Mathematics. Elsevier.https://doi.org/10.1016/j.disc.2019.06.031 

Fulek, R., &; Kyndl, J. (2019). Counterexample to an extension of the Hanani-Tutte theorem on the surface of genus 4. Combinatorica. Springer Nature.https://doi.org/10.1007/s00493-019-3905-7 

Goaoc, X., Patak, P., Patakova, Z., Tancer, M., &; Wagner, U. (2019). Shellability is NP-complete. Journal of the ACM. ACM.https://doi.org/10.1145/3314024 

Arroyo Guevara, A. M., Derka, M., &; Parada, I. (2019). Extending simple drawings. In 27th International Symposium on Graph Drawing and Network Visualization (Vol. 11904, pp. 230–243). Prague, Czech Republic: Springer Nature.https://doi.org/10.1007/978-3-030-35802-0_18 

Zhechev, S. Y. (2019). Algorithmic aspects of homotopy theory and embeddability. Institute of Science and Technology Austria.https://doi.org/10.15479/AT:ISTA:6681 

Avvakumov, S., &; Kudrya, S. (n.d.). Vanishing of all equivariant obstructions and the mapping degree. arXiv. arXiv.

Avvakumov, S., &; Karasev, R. (n.d.). Envy-free division using mapping degree. arXiv.https://doi.org/10.48550/arXiv.1907.11183 

Lubiw, A., Masárová, Z., &; Wagner, U. (2019). A proof of the orbit conjecture for flipping edge-labelled triangulations. Discrete &; Computational Geometry. Springer Nature.https://doi.org/10.1007/s00454-018-0035-8 

Huszár, K., &; Spreer, J. (2019). 3-manifold triangulations with small treewidth. In 35th International Symposium on Computational Geometry (Vol. 129, p. 44:1-44:20). Portland, Oregon, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.SoCG.2019.44 

Huszár, K., Spreer, J., &; Wagner, U. (2019). On the treewidth of triangulated 3-manifolds. Journal of Computational Geometry. Computational Geometry Laborartoy.https://doi.org/10.20382/JOGC.V10I2A5 

Avvakumov, S., Karasev, R., &; Skopenkov, A. (n.d.). Stronger counterexamples to the topological Tverberg conjecture. arXiv. arXiv.

Akitaya, H., Fulek, R., &; Tóth, C. (2019). Recognizing weak embeddings of graphs. ACM Transactions on Algorithms. ACM.https://doi.org/10.1145/3344549 

Fulek, R., Gärtner, B., Kupavskii, A., Valtr, P., &; Wagner, U. (2019). The crossing Tverberg theorem. In 35th International Symposium on Computational Geometry (Vol. 129, p. 38:1-38:13). Portland, OR, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPICS.SOCG.2019.38 

Biniaz, A., Jain, K., Lubiw, A., Masárová, Z., Miltzow, T., Mondal, D.,  Turcotte, A. (n.d.). Token swapping on trees. arXiv.

Fulek, R., &; Kyndl, J. (2018). Hanani-Tutte for approximating maps of graphs (Vol. 99). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.SoCG.2018.39 

Fulek, R., &; Kyndl, J. (2018). The 2-Genus of Kuratowski minors (Vol. 99, p. 40.1-40.14). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.SoCG.2018.40 

Fulek, R., &; Pach, J. (2018). Thrackles: An improved upper bound (Vol. 10692, pp. 160–166). Presented at the GD 2017: Graph Drawing and Network Visualization, Boston, MA, United States: Springer.https://doi.org/10.1007/978-3-319-73915-1_14 

Goaoc, X., Paták, P., Patakova, Z., Tancer, M., &; Wagner, U. (2018). Shellability is NP-complete (Vol. 99, p. 41:1-41:16). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.SoCG.2018.41 

Huszár, K., Spreer, J., &; Wagner, U. (2018). On the treewidth of triangulated 3-manifolds (Vol. 99). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.SoCG.2018.46 

Filakovský, M., Franek, P., Wagner, U., &; Zhechev, S. Y. (2018). Computing simplicial representatives of homotopy group elements. Journal of Applied and Computational Topology. Springer.https://doi.org/10.1007/s41468-018-0021-5 

Fulek, R., &; Tóth, C. D. (2018). Crossing minimization in perturbed drawings (Vol. 11282, pp. 229–241). Presented at the Graph Drawing and Network Visualization, Barcelona, Spain: Springer.https://doi.org/10.1007/978-3-030-04414-5_16 

Matousek, J., Sedgwick, E., Tancer, M., &; Wagner, U. (2018). Embeddability in the 3-Sphere is decidable. Journal of the ACM. ACM.https://doi.org/10.1145/3078632 

Akitaya, H., Fulek, R., &; Tóth, C. (2018). Recognizing weak embeddings of graphs (pp. 274–292). Presented at the SODA: Symposium on Discrete Algorithms, New Orleans, LA, USA: ACM.https://doi.org/10.1137/1.9781611975031.20 

Rohou, S., Franek, P., Aubry, C., &; Jaulin, L. (2018). Proving the existence of loops in robot trajectories. The International Journal of Robotics Research. SAGE Publications.https://doi.org/10.1177/0278364918808367 

Akopyan, A., &; Avvakumov, S. (2018). Any cyclic quadrilateral can be inscribed in any closed convex smooth curve. Forum of Mathematics, Sigma. Cambridge University Press.https://doi.org/10.1017/fms.2018.7 

Dotterrer, D., Kaufman, T., &; Wagner, U. (2018). On expansion and topological overlap. Geometriae Dedicata. Springer.https://doi.org/10.1007/s10711-017-0291-4 

Fulek, R., Pelsmajer, M., &; Schaefer, M. (2017). Hanani-Tutte for radial planarity. Journal of Graph Algorithms and Applications. Brown University.https://doi.org/10.7155/jgaa.00408 

Burton, B., de Mesmay, A. N., &; Wagner, U. (2017). Finding non-orientable surfaces in 3-Manifolds. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/s00454-017-9900-0 

Franek, P., &; Krcál, M. (2017). Persistence of zero sets. Homology, Homotopy and Applications. International Press.https://doi.org/10.4310/HHA.2017.v19.n2.a16 

Goaoc, X., Mabillard, I., Paták, P., Patakova, Z., Tancer, M., &; Wagner, U. (2017). On generalized Heawood inequalities for manifolds: A van Kampen–Flores type nonembeddability result. Israel Journal of Mathematics. Springer.https://doi.org/10.1007/s11856-017-1607-7 

Fulek, R. (2017). Embedding graphs into embedded graphs (Vol. 92). Presented at the ISAAC: International Symposium on Algorithms and Computation, Phuket, Thailand: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPICS.ISAAC.2017.34 

Edelsbrunner, H., &; Wagner, H. (2017). Topological data analysis with Bregman divergences (Vol. 77, pp. 391–3916). Presented at the Symposium on Computational Geometry, SoCG, Brisbane, Australia: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.SoCG.2017.39 

Kyndl, J., &; Patakova, Z. (2017). On the nonexistence of k reptile simplices in d^3 and d^4. The Electronic Journal of Combinatorics. International Press.

Fulek, R., Kyndl, J., &; Pálvölgyi, D. (2017). Unified Hanani Tutte theorem. Electronic Journal of Combinatorics. International Press.https://doi.org/10.37236/6663 

Lubiw, A., Masárová, Z., &; Wagner, U. (2017). A proof of the orbit conjecture for flipping edge labelled triangulations (Vol. 77). Presented at the SoCG: Symposium on Computational Geometry, Brisbane, Australia: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.SoCG.2017.49 

cadek, M., Krcál, M., &; Vokínek, L. (2017). Algorithmic solvability of the lifting extension problem. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/s00454-016-9855-6 

Fulek, R., Mojarrad, H., Naszódi, M., Solymosi, J., Stich, S., &; Szedlák, M. (2017). On the existence of ordinary triangles. Computational Geometry: Theory and Applications. Elsevier.https://doi.org/10.1016/j.comgeo.2017.07.002 

Fulek, R. (2017). C-planarity of embedded cyclic c-graphs. Computational Geometry: Theory and Applications. Elsevier.https://doi.org/10.1016/j.comgeo.2017.06.016 

Goaoc, X., Paták, P., Patakova, Z., Tancer, M., &; Wagner, U. (2017). Bounding helly numbers via betti numbers. In M. Loebl, J. Nesetil, &; R. Thomas (Eds.), A Journey through Discrete Mathematics: A Tribute to Jiri Matousek (pp. 407–447). Springer.https://doi.org/10.1007/978-3-319-44479-6_17 

Krcál, M., &; Pilarczyk, P. (2016). Computation of cubical Steenrod squares (Vol. 9667, pp. 140–151). Presented at the CTIC: Computational Topology in Image Context, Marseille, France: Springer.https://doi.org/10.1007/978-3-319-39441-1_13 

Gundert, A., &; Wagner, U. (2016). On eigenvalues of random complexes. Israel Journal of Mathematics. Springer.https://doi.org/10.1007/s11856-016-1419-1 

Fulek, R. (2016). Bounded embeddings of graphs in the plane (Vol. 9843, pp. 31–42). Presented at the IWOCA: International Workshop on Combinatorial Algorithms, Helsinki, Finland: Springer.https://doi.org/10.1007/978-3-319-44543-4_3 

Mabillard, I., &; Wagner, U. (2016). Eliminating higher-multiplicity intersections, II. The deleted product criterion in the r-metastable range (Vol. 51, p. 51.1-51.12). Presented at the SoCG: Symposium on Computational Geometry, Medford, MA, USA: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH.https://doi.org/10.4230/LIPIcs.SoCG.2016.51 

Franek, P., &; Krcál, M. (2016). On computability and triviality of well groups. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/s00454-016-9794-2 

Avvakumov, S. (2016). The classification of certain linked 3-manifolds in 6-space. Moscow Mathematical Journal. Independent University of Moscow.https://doi.org/10.17323/1609-4514-2016-16-1-1-25 

Gundert, A., &; Wagner, U. (2016). On topological minors in random simplicial complexes. Proceedings of the American Mathematical Society. American Mathematical Society.https://doi.org/10.1090/proc/12824 

Fulek, R., Pelsmajer, M., &; Schaefer, M. (2016). Hanani-Tutte for radial planarity II (Vol. 9801, pp. 468–481). Presented at the GD: Graph Drawing and Network Visualization, Athens, Greece: Springer.https://doi.org/10.1007/978-3-319-50106-2_36 

Matousek, J., Sedgwick, E., Tancer, M., &; Wagner, U. (2016). Untangling two systems of noncrossing curves. Israel Journal of Mathematics. Springer.https://doi.org/10.1007/s11856-016-1294-9 

Burton, B., de Mesmay, A. N., &; Wagner, U. (2016). Finding non-orientable surfaces in 3-manifolds (Vol. 51, p. 24.1-24.15). Presented at the SoCG: Symposium on Computational Geometry, Medford, MA, USA: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing.https://doi.org/10.4230/LIPIcs.SoCG.2016.24 

Mabillard, I. (2016). Eliminating higher-multiplicity intersections: an r-fold Whitney trick for the topological Tverberg conjecture. Institute of Science and Technology Austria.

Fulek, R. (2016). C-planarity of embedded cyclic c-graphs (Vol. 9801, pp. 94–106). Presented at the GD: Graph Drawing and Network Visualization, Athens, Greece: Springer.https://doi.org/10.1007/978-3-319-50106-2_8 

Dotterrer, D., Kaufman, T., &; Wagner, U. (2016). On expansion and topological overlap (Vol. 51, p. 35.1-35.10). Presented at the SoCG: Symposium on Computational Geometry, Medford, MA, USA: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing.https://doi.org/10.4230/LIPIcs.SoCG.2016.35 

Franek, P., &; Krcál, M. (2015). On computability and triviality of well groups (Vol. 34, pp. 842–856). Presented at the SoCG: Symposium on Computational Geometry, Eindhoven, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.SOCG.2015.842 

Fulek, R., Pelsmajer, M., &; Schaefer, M. (2015). Hanani-Tutte for radial planarity (Vol. 9411, pp. 99–110). Presented at the GD: Graph Drawing and Network Visualization, Los Angeles, CA, USA: Springer.https://doi.org/10.1007/978-3-319-27261-0_9 

Fulek, R., &; Radoidi, R. (2015). Vertical visibility among parallel polygons in three dimensions. In Graph Drawing and Network Visualization (Vol. 9411, pp. 373–379). Los Angeles, CA, United States: Springer Nature.https://doi.org/10.1007/978-3-319-27261-0_31 

Fulek, R., Kyndl, J., Malinovid, I., &; Pálvölgyi, D. (2015). Clustered planarity testing revisited. Electronic Journal of Combinatorics. Electronic Journal of Combinatorics.https://doi.org/10.37236/5002 

Cohen Addad, V., &; de Mesmay, A. N. (2015). A fixed parameter tractable approximation scheme for the optimal cut graph of a surface (Vol. 9294, pp. 386–398). Presented at the ESA: European Symposium on Algorithms, Patras, Greece: Springer.https://doi.org/10.1007/978-3-662-48350-3_33 

Karasev, R., Kyndl, J., Paták, P., Patakova, Z., &; Tancer, M. (2015). Bounds for Pach’s selection theorem and for the minimum solid angle in a simplex. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/s00454-015-9720-z 

Franek, P., &; Krcál, M. (2015). Robust satisfiability of systems of equations. Journal of the ACM. ACM.https://doi.org/10.1145/2751524 

Colin De Verdière, É., Hubard, A., &; de Mesmay, A. N. (2015). Discrete systolic inequalities and decompositions of triangulated surfaces. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/s00454-015-9679-9