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