Are two given maps homotopic? An algorithmic viewpoint
M. Filakovský, L. Vokínek, Foundations of Computational Mathematics 20 (2020) 311–330.

Intersection patterns of planar sets
G. Kalai, Z. Patakova, Discrete and Computational Geometry 64 (2020) 304–323.

Inserting one edge into a simple drawing is hard
A.M. Arroyo Guevara, F. Klute, I. Parada, R. Seidel, B. Vogtenhuber, T. Wiedera, in:, Graph-Theoretic Concepts in Computer Science, Springer Nature, 2020, pp. 325–338.

Reconfiguration problems
Z. Masárová, Reconfiguration Problems, Institute of Science and Technology Austria, 2020.

Combinatorial width parameters for 3-dimensional manifolds
K. Huszár, Combinatorial Width Parameters for 3-Dimensional Manifolds, Institute of Science and Technology Austria, 2020.

Topological methods in geometry and discrete mathematics
S. Avvakumov, Topological Methods in Geometry and Discrete Mathematics, Institute of Science and Technology Austria, 2020.

Disjoint tree-compatible plane perfect matchings
O. Aichholzer, J. Obmann, P. Patak, D. Perz, J. Tkadlec, in:, 36th European Workshop on Computational Geometry, 2020.

Z_2-Genus of graphs and minimum rank of partial symmetric matrices
R. Fulek, J. Kyncl, in:, 35th International Symposium on Computational Geometry (SoCG 2019), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.

Extending partial representations of circle graphs
S. Chaplick, R. Fulek, P. Klavík, Journal of Graph Theory 91 (2019) 365–394.

Thrackles: An improved upper bound
R. Fulek, J. Pach, Discrete Applied Mathematics 259 (2019) 266–231.

Graphs with at most one crossing
A. Silva, A.M. Arroyo Guevara, B. Richter, O. Lee, Discrete Mathematics 342 (2019) 3201–3207.

Counterexample to an extension of the Hanani-Tutte theorem on the surface of genus 4
R. Fulek, J. Kyndl, Combinatorica 39 (2019) 1267–1279.

Shellability is NP-complete
X. Goaoc, P. Patak, Z. Patakova, M. Tancer, U. Wagner, Journal of the ACM 66 (2019).

Extending simple drawings
A.M. Arroyo Guevara, M. Derka, I. Parada, in:, 27th International Symposium on Graph Drawing and Network Visualization, Springer Nature, 2019, pp. 230–243.

Algorithmic aspects of homotopy theory and embeddability
S.Y. Zhechev, Algorithmic Aspects of Homotopy Theory and Embeddability, Institute of Science and Technology Austria, 2019.

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

Envy-free division using mapping degree
S. Avvakumov, R. Karasev, ArXiv (n.d.).

A proof of the orbit conjecture for flipping edge-labelled triangulations
A. Lubiw, Z. Masárová, U. Wagner, Discrete &; Computational Geometry 61 (2019) 880–898.

3-manifold triangulations with small treewidth
K. Huszár, J. Spreer, in:, 35th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 44:1-44:20.

On the treewidth of triangulated 3-manifolds
K. Huszár, J. Spreer, U. Wagner, Journal of Computational Geometry 10 (2019) 70–98.