Patakova Z, Tancer M, Wagner U. 2020. Barycentric cuts through a convex body. 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164, 62:1-62:16.
LibreCat: https://research-explorer.ista.ac.at/record/7992
DOI: 10.4230/LIPIcs.SoCG.2020.62
arXiv: 2003.13536

Arroyo Guevara AM, Bensmail J, Bruce Richter R. 2020. Extending drawings of graphs to arrangements of pseudolines. 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164, 9:1-9:14.
LibreCat: https://research-explorer.ista.ac.at/record/7994
DOI: 10.4230/LIPIcs.SoCG.2020.9
arXiv: 1804.09317

Wagner U, Welzl E. 2020. Connectivity of triangulation flip graphs in the plane (Part II: Bistellar flips). 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164, 67:1-67:16.
LibreCat: https://research-explorer.ista.ac.at/record/7990
DOI: 10.4230/LIPIcs.SoCG.2020.67
arXiv: 2003.13557

Wagner U, Welzl E. 2020. Connectivity of triangulation flip graphs in the plane (Part I: Edge flips). Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms vol. 2020–January, 2823–2841.
LibreCat: https://research-explorer.ista.ac.at/record/7807
DOI: 10.1137/1.9781611975994.172
arXiv: 2003.13557

Avvakumov S, Wagner U, Mabillard I, Skopenkov AB. 2020. Eliminating higher-multiplicity intersections, III. Codimension 2. Russian Mathematical Surveys. 75(6), 1156–1158.
LibreCat: https://research-explorer.ista.ac.at/record/9308
DOI: 10.1070/RM9943
WoS: 000625983100001
arXiv: 1511.03501

Filakovský M, Vokínek L. 2020. Are two given maps homotopic? An algorithmic viewpoint. Foundations of Computational Mathematics. 20, 311–330.
LibreCat: https://research-explorer.ista.ac.at/record/6563
DOI: 10.1007/s10208-019-09419-x
WoS: 000522437400004
arXiv: 1312.2337

Kalai G, Patakova Z. 2020. Intersection patterns of planar sets. Discrete and Computational Geometry. 64, 304–323.
LibreCat: https://research-explorer.ista.ac.at/record/7960
DOI: 10.1007/s00454-020-00205-z
WoS: 000537329400001
arXiv: 1907.00885

Arroyo Guevara AM, Klute F, Parada I, Seidel R, Vogtenhuber B, Wiedera T. 2020. Inserting one edge into a simple drawing is hard. Graph-Theoretic Concepts in Computer Science. WG: Workshop on Graph-Theoretic Concepts in Computer Science, LNCS, vol. 12301, 325–338.
LibreCat: https://research-explorer.ista.ac.at/record/8732
DOI: 10.1007/978-3-030-60440-0_26

Masárová Z. 2020. Reconfiguration problems. Institute of Science and Technology Austria.
LibreCat: https://research-explorer.ista.ac.at/record/7944
DOI: 10.15479/AT:ISTA:7944

Huszár K. 2020. Combinatorial width parameters for 3-dimensional manifolds. Institute of Science and Technology Austria.
LibreCat: https://research-explorer.ista.ac.at/record/8032
DOI: 10.15479/AT:ISTA:8032

Avvakumov S. 2020. Topological methods in geometry and discrete mathematics. Institute of Science and Technology Austria.
LibreCat: https://research-explorer.ista.ac.at/record/8156
DOI: 10.15479/AT:ISTA:8156

Aichholzer O, Obmann J, Patak P, Perz D, Tkadlec J. 2020. Disjoint tree-compatible plane perfect matchings. 36th European Workshop on Computational Geometry. EuroCG: European Workshop on Computational Geometry, 56.
LibreCat: https://research-explorer.ista.ac.at/record/15082

Fulek R, Kyncl J. 2019. Z_2-Genus of graphs and minimum rank of partial symmetric matrices. 35th International Symposium on Computational Geometry (SoCG 2019). SoCG: Symposium on Computational Geometry, LIPIcs, vol. 129, 39.
LibreCat: https://research-explorer.ista.ac.at/record/7401
DOI: 10.4230/LIPICS.SOCG.2019.39
arXiv: 1903.08637

Chaplick S, Fulek R, Klavík P. 2019. Extending partial representations of circle graphs. Journal of Graph Theory. 91(4), 365–394.
LibreCat: https://research-explorer.ista.ac.at/record/5790
DOI: 10.1002/jgt.22436
WoS: 000485392800004
arXiv: 1309.2399

Fulek R, Pach J. 2019. Thrackles: An improved upper bound. Discrete Applied Mathematics. 259(4), 266–231.
LibreCat: https://research-explorer.ista.ac.at/record/5857
DOI: 10.1016/j.dam.2018.12.025
WoS: 000466061100020
arXiv: 1708.08037

Silva A, Arroyo Guevara AM, Richter B, Lee O. 2019. Graphs with at most one crossing. Discrete Mathematics. 342(11), 3201–3207.
LibreCat: https://research-explorer.ista.ac.at/record/6638
DOI: 10.1016/j.disc.2019.06.031
WoS: 000486358100025
arXiv: 1901.09955

Fulek R, Kyndl J. 2019. Counterexample to an extension of the Hanani-Tutte theorem on the surface of genus 4. Combinatorica. 39(6), 1267–1279.
LibreCat: https://research-explorer.ista.ac.at/record/7034
DOI: 10.1007/s00493-019-3905-7
WoS: 000493267200003
arXiv: 1709.00508

Goaoc X, Patak P, Patakova Z, Tancer M, Wagner U. 2019. Shellability is NP-complete. Journal of the ACM. 66(3), 21.
LibreCat: https://research-explorer.ista.ac.at/record/7108
DOI: 10.1145/3314024
WoS: 000495406300007
arXiv: 1711.08436

Arroyo Guevara AM, Derka M, Parada I. 2019. Extending simple drawings. 27th International Symposium on Graph Drawing and Network Visualization. GD: Graph Drawing and Network Visualization, LNCS, vol. 11904, 230–243.
LibreCat: https://research-explorer.ista.ac.at/record/7230
DOI: 10.1007/978-3-030-35802-0_18
WoS: 000612918800018
arXiv: 1908.08129

Zhechev SY. 2019. Algorithmic aspects of homotopy theory and embeddability. Institute of Science and Technology Austria.
LibreCat: https://research-explorer.ista.ac.at/record/6681
DOI: 10.15479/AT:ISTA:6681