Avvakumov, Sergey. Topological Methods in Geometry and Discrete Mathematics. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8156.
LibreCat: https://research-explorer.ista.ac.at/record/8156
DOI: 10.15479/AT:ISTA:8156

Aichholzer, Oswin, et al. “Disjoint Tree-Compatible Plane Perfect Matchings.” 36th European Workshop on Computational Geometry, 56, 2020.
LibreCat: https://research-explorer.ista.ac.at/record/15082

Fulek, Radoslav, and Jan Kyncl. “Z_2-Genus of Graphs and Minimum Rank of Partial Symmetric Matrices.”10.4230/LIPICS.SOCG.2019.39__35th International Symposium on Computational Geometry (SoCG 2019), vol. 129, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.SOCG.2019.39.
LibreCat: https://research-explorer.ista.ac.at/record/7401
DOI: 10.4230/LIPICS.SOCG.2019.39
arXiv: 1903.08637

Chaplick, Steven, et al. “Extending Partial Representations of Circle Graphs.”10.1002/jgt.22436__Journal of Graph Theory, vol. 91, no. 4, Wiley, 2019, pp. 365–94, doi:10.1002/jgt.22436.
LibreCat: https://research-explorer.ista.ac.at/record/5790
DOI: 10.1002/jgt.22436
WoS: 000485392800004
arXiv: 1309.2399

Fulek, Radoslav, and János Pach. “Thrackles: An Improved Upper Bound.”10.1016/j.dam.2018.12.025__Discrete Applied Mathematics, vol. 259, no. 4, Elsevier, 2019, pp. 266–231, doi:10.1016/j.dam.2018.12.025.
LibreCat: https://research-explorer.ista.ac.at/record/5857
DOI: 10.1016/j.dam.2018.12.025
WoS: 000466061100020
arXiv: 1708.08037

Silva, André, et al. “Graphs with at Most One Crossing.”10.1016/j.disc.2019.06.031__Discrete Mathematics, vol. 342, no. 11, Elsevier, 2019, pp. 3201–07, doi:10.1016/j.disc.2019.06.031.
LibreCat: https://research-explorer.ista.ac.at/record/6638
DOI: 10.1016/j.disc.2019.06.031
WoS: 000486358100025
arXiv: 1901.09955

Fulek, Radoslav, and Jan Kyndl. “Counterexample to an Extension of the Hanani-Tutte Theorem on the Surface of Genus 4.”10.1007/s00493-019-3905-7__Combinatorica, vol. 39, no. 6, Springer Nature, 2019, pp. 1267–79, doi:10.1007/s00493-019-3905-7.
LibreCat: https://research-explorer.ista.ac.at/record/7034
DOI: 10.1007/s00493-019-3905-7
WoS: 000493267200003
arXiv: 1709.00508

Goaoc, Xavier, et al. “Shellability Is NP-Complete.”10.1145/3314024__Journal of the ACM, vol. 66, no. 3, 21, ACM, 2019, doi:10.1145/3314024.
LibreCat: https://research-explorer.ista.ac.at/record/7108
DOI: 10.1145/3314024
WoS: 000495406300007
arXiv: 1711.08436

Arroyo Guevara, Alan M., et al. “Extending Simple Drawings.”10.1007/978-3-030-35802-0_18__27th International Symposium on Graph Drawing and Network Visualization, vol. 11904, Springer Nature, 2019, pp. 230–43, doi:10.1007/978-3-030-35802-0_18.
LibreCat: https://research-explorer.ista.ac.at/record/7230
DOI: 10.1007/978-3-030-35802-0_18
WoS: 000612918800018
arXiv: 1908.08129

Zhechev, Stephan Y. Algorithmic Aspects of Homotopy Theory and Embeddability. Institute of Science and Technology Austria, 2019, doi:10.15479/AT:ISTA:6681.
LibreCat: https://research-explorer.ista.ac.at/record/6681
DOI: 10.15479/AT:ISTA:6681

Avvakumov, Sergey, and Sergey Kudrya. “Vanishing of All Equivariant Obstructions and the Mapping Degree.” ArXiv, 1910.12628, arXiv.
LibreCat: https://research-explorer.ista.ac.at/record/8182
arXiv: 1910.12628

Avvakumov, Sergey, and Roman Karasev. “Envy-Free Division Using Mapping Degree.”10.48550/arXiv.1907.11183__ArXiv, 1907.11183, doi:10.48550/arXiv.1907.11183.
LibreCat: https://research-explorer.ista.ac.at/record/8185
DOI: 10.48550/arXiv.1907.11183
arXiv: 1907.11183

Lubiw, Anna, et al. “A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations.”10.1007/s00454-018-0035-8__Discrete &; Computational Geometry, vol. 61, no. 4, Springer Nature, 2019, pp. 880–98, doi:10.1007/s00454-018-0035-8.
LibreCat: https://research-explorer.ista.ac.at/record/5986
DOI: 10.1007/s00454-018-0035-8
WoS: 000466130000009
arXiv: 1710.02741

Huszár, Kristóf, and Jonathan Spreer. “-Manifold Triangulations with Small Treewidth.”10.4230/LIPIcs.SoCG.2019.44__35th International Symposium on Computational Geometry, vol. 129, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 44:1-44:20, doi:10.4230/LIPIcs.SoCG.2019.44.
LibreCat: https://research-explorer.ista.ac.at/record/6556
DOI: 10.4230/LIPIcs.SoCG.2019.44
arXiv: 1812.05528

Huszár, Kristóf, et al. “On the Treewidth of Triangulated 3-Manifolds.”10.20382/JOGC.V10I2A5__Journal of Computational Geometry, vol. 10, no. 2, Computational Geometry Laborartoy, 2019, pp. 70–98, doi:10.20382/JOGC.V10I2A5.
LibreCat: https://research-explorer.ista.ac.at/record/7093
DOI: 10.20382/JOGC.V10I2A5
arXiv: 1712.00434

Avvakumov, Sergey, et al. “Stronger Counterexamples to the Topological Tverberg Conjecture.” ArXiv, 1908.08731, arXiv.
LibreCat: https://research-explorer.ista.ac.at/record/8184
WoS: 000986519600004
arXiv: 1908.08731

Akitaya, Hugo, et al. “Recognizing Weak Embeddings of Graphs.”10.1145/3344549__ACM Transactions on Algorithms, vol. 15, no. 4, 50, ACM, 2019, doi:10.1145/3344549.
LibreCat: https://research-explorer.ista.ac.at/record/6982
DOI: 10.1145/3344549
arXiv: 1709.09209

Fulek, Radoslav, et al. “The Crossing Tverberg Theorem.”10.4230/LIPICS.SOCG.2019.38__35th International Symposium on Computational Geometry, vol. 129, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 38:1-38:13, doi:10.4230/LIPICS.SOCG.2019.38.
LibreCat: https://research-explorer.ista.ac.at/record/6647
DOI: 10.4230/LIPICS.SOCG.2019.38
arXiv: 1812.04911

Biniaz, Ahmad, et al. “Token Swapping on Trees.” ArXiv, 1903.06981.
LibreCat: https://research-explorer.ista.ac.at/record/7950
arXiv: 1903.06981

Fulek, Radoslav, and Jan Kyndl. Hanani-Tutte for Approximating Maps of Graphs. Vol. 99, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPIcs.SoCG.2018.39.
LibreCat: https://research-explorer.ista.ac.at/record/185
DOI: 10.4230/LIPIcs.SoCG.2018.39