S. Avvakumov and S. Kudrya, “Vanishing of all equivariant obstructions and the mapping degree,” arXiv. arXiv.
LibreCat: https://research-explorer.ista.ac.at/record/8182
arXiv: 1910.12628

S. Avvakumov and R. Karasev, “Envy-free division using mapping degree,” arXiv. .
LibreCat: https://research-explorer.ista.ac.at/record/8185
DOI: 10.48550/arXiv.1907.11183
arXiv: 1907.11183

A. Lubiw, Z. Masárová, and U. Wagner, “A proof of the orbit conjecture for flipping edge-labelled triangulations,” Discrete &; Computational Geometry, vol. 61, no. 4. Springer Nature, pp. 880–898, 2019.
LibreCat: https://research-explorer.ista.ac.at/record/5986
DOI: 10.1007/s00454-018-0035-8
WoS: 000466130000009
arXiv: 1710.02741

K. Huszár and J. Spreer, “-manifold triangulations with small treewidth,” in 35th International Symposium on Computational Geometry, Portland, Oregon, United States, 2019, vol. 129, p. 44:1-44:20.
LibreCat: https://research-explorer.ista.ac.at/record/6556
DOI: 10.4230/LIPIcs.SoCG.2019.44
arXiv: 1812.05528

K. Huszár, J. Spreer, and U. Wagner, “On the treewidth of triangulated 3-manifolds,” Journal of Computational Geometry, vol. 10, no. 2. Computational Geometry Laborartoy, pp. 70–98, 2019.
LibreCat: https://research-explorer.ista.ac.at/record/7093
DOI: 10.20382/JOGC.V10I2A5
arXiv: 1712.00434

S. Avvakumov, R. Karasev, and A. Skopenkov, “Stronger counterexamples to the topological Tverberg conjecture,” arXiv. arXiv.
LibreCat: https://research-explorer.ista.ac.at/record/8184
WoS: 000986519600004
arXiv: 1908.08731

H. Akitaya, R. Fulek, and C. Tóth, “Recognizing weak embeddings of graphs,” ACM Transactions on Algorithms, vol. 15, no. 4. ACM, 2019.
LibreCat: https://research-explorer.ista.ac.at/record/6982
DOI: 10.1145/3344549
arXiv: 1709.09209

R. Fulek, B. Gärtner, A. Kupavskii, P. Valtr, and U. Wagner, “The crossing Tverberg theorem,” in 35th International Symposium on Computational Geometry, Portland, OR, United States, 2019, vol. 129, p. 38:1-38:13.
LibreCat: https://research-explorer.ista.ac.at/record/6647
DOI: 10.4230/LIPICS.SOCG.2019.38
arXiv: 1812.04911

A. Biniaz et al., “Token swapping on trees,” arXiv. .
LibreCat: https://research-explorer.ista.ac.at/record/7950
arXiv: 1903.06981

R. Fulek and J. Kyndl, “Hanani-Tutte for approximating maps of graphs,” presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99.
LibreCat: https://research-explorer.ista.ac.at/record/185
DOI: 10.4230/LIPIcs.SoCG.2018.39

R. Fulek and J. Kyndl, “The 2-Genus of Kuratowski minors,” presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99, p. 40.1-40.14.
LibreCat: https://research-explorer.ista.ac.at/record/186
DOI: 10.4230/LIPIcs.SoCG.2018.40
arXiv: 1803.05085

R. Fulek and J. Pach, “Thrackles: An improved upper bound,” presented at the GD 2017: Graph Drawing and Network Visualization, Boston, MA, United States, 2018, vol. 10692, pp. 160–166.
LibreCat: https://research-explorer.ista.ac.at/record/433
DOI: 10.1007/978-3-319-73915-1_14
arXiv: 1708.08037

X. Goaoc, P. Paták, Z. Patakova, M. Tancer, and U. Wagner, “Shellability is NP-complete,” presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99, p. 41:1-41:16.
LibreCat: https://research-explorer.ista.ac.at/record/184
DOI: 10.4230/LIPIcs.SoCG.2018.41

K. Huszár, J. Spreer, and U. Wagner, “On the treewidth of triangulated 3-manifolds,” presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99.
LibreCat: https://research-explorer.ista.ac.at/record/285
DOI: 10.4230/LIPIcs.SoCG.2018.46
arXiv: 1712.00434

M. Filakovský, P. Franek, U. Wagner, and S. Y. Zhechev, “Computing simplicial representatives of homotopy group elements,” Journal of Applied and Computational Topology, vol. 2, no. 3–4. Springer, pp. 177–231, 2018.
LibreCat: https://research-explorer.ista.ac.at/record/6774
DOI: 10.1007/s41468-018-0021-5

R. Fulek and C. D. Tóth, “Crossing minimization in perturbed drawings,” presented at the Graph Drawing and Network Visualization, Barcelona, Spain, 2018, vol. 11282, pp. 229–241.
LibreCat: https://research-explorer.ista.ac.at/record/5791
DOI: 10.1007/978-3-030-04414-5_16
WoS: 000672802500016
arXiv: 1808.07608

J. Matousek, E. Sedgwick, M. Tancer, and U. Wagner, “Embeddability in the 3-Sphere is decidable,” Journal of the ACM, vol. 65, no. 1. ACM, 2018.
LibreCat: https://research-explorer.ista.ac.at/record/425
DOI: 10.1145/3078632
WoS: 000425685900006
arXiv: 1402.0815

H. Akitaya, R. Fulek, and C. Tóth, “Recognizing weak embeddings of graphs,” presented at the SODA: Symposium on Discrete Algorithms, New Orleans, LA, USA, 2018, pp. 274–292.
LibreCat: https://research-explorer.ista.ac.at/record/309
DOI: 10.1137/1.9781611975031.20
WoS: 000483921200021
arXiv: 1709.09209

S. Rohou, P. Franek, C. Aubry, and L. Jaulin, “Proving the existence of loops in robot trajectories,” The International Journal of Robotics Research, vol. 37, no. 12. SAGE Publications, pp. 1500–1516, 2018.
LibreCat: https://research-explorer.ista.ac.at/record/5960
DOI: 10.1177/0278364918808367
WoS: 000456881100004
arXiv: 1712.01341

A. Akopyan and S. Avvakumov, “Any cyclic quadrilateral can be inscribed in any closed convex smooth curve,” Forum of Mathematics, Sigma, vol. 6. Cambridge University Press, 2018.
LibreCat: https://research-explorer.ista.ac.at/record/6355
DOI: 10.1017/fms.2018.7
WoS: 000433915500001
arXiv: 1712.10205