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.

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

Recognizing weak embeddings of graphs
H. Akitaya, R. Fulek, C. Tóth, ACM Transactions on Algorithms 15 (2019).

The crossing Tverberg theorem
R. Fulek, B. Gärtner, A. Kupavskii, P. Valtr, U. Wagner, in:, 35th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 38:1-38:13.

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

Hanani-Tutte for approximating maps of graphs
R. Fulek, J. Kyndl, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.

The 2-Genus of Kuratowski minors
R. Fulek, J. Kyndl, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 40.1-40.14.

Thrackles: An improved upper bound
R. Fulek, J. Pach, in:, Springer, 2018, pp. 160–166.

Shellability is NP-complete
X. Goaoc, P. Paták, Z. Patakova, M. Tancer, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 41:1-41:16.

On the treewidth of triangulated 3-manifolds
K. Huszár, J. Spreer, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.

Computing simplicial representatives of homotopy group elements
M. Filakovský, P. Franek, U. Wagner, S.Y. Zhechev, Journal of Applied and Computational Topology 2 (2018) 177–231.

Crossing minimization in perturbed drawings
R. Fulek, C.D. Tóth, in:, Springer, 2018, pp. 229–241.

Embeddability in the 3-Sphere is decidable
J. Matousek, E. Sedgwick, M. Tancer, U. Wagner, Journal of the ACM 65 (2018).

Recognizing weak embeddings of graphs
H. Akitaya, R. Fulek, C. Tóth, in:, ACM, 2018, pp. 274–292.

Proving the existence of loops in robot trajectories
S. Rohou, P. Franek, C. Aubry, L. Jaulin, The International Journal of Robotics Research 37 (2018) 1500–1516.

Any cyclic quadrilateral can be inscribed in any closed convex smooth curve
A. Akopyan, S. Avvakumov, Forum of Mathematics, Sigma 6 (2018).