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

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

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

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

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

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

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

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

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

Biniaz A, Jain K, Lubiw A, Masárová Z, Miltzow T, Mondal D, Naredla AM, Tkadlec J, Turcotte A. Token swapping on trees. arXiv, 1903.06981.
LibreCat: https://research-explorer.ista.ac.at/record/7950
arXiv: 1903.06981

Fulek R, Kyndl J. 2018. Hanani-Tutte for approximating maps of graphs. SoCG: Symposium on Computational Geometry, Leibniz International Proceedings in Information, LIPIcs, vol. 99, 39.
LibreCat: https://research-explorer.ista.ac.at/record/185
DOI: 10.4230/LIPIcs.SoCG.2018.39

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

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

Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. 2018. Shellability is NP-complete. SoCG: Symposium on Computational Geometry, Leibniz International Proceedings in Information, LIPIcs, vol. 99, 41:1-41:16.
LibreCat: https://research-explorer.ista.ac.at/record/184
DOI: 10.4230/LIPIcs.SoCG.2018.41

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

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

Fulek R, Tóth CD. 2018. Crossing minimization in perturbed drawings. Graph Drawing and Network Visualization, LNCS, vol. 11282, 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

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

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

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

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

Dotterrer D, Kaufman T, Wagner U. 2018. On expansion and topological overlap. Geometriae Dedicata. 195(1), 307–317.
LibreCat: https://research-explorer.ista.ac.at/record/742
DOI: 10.1007/s10711-017-0291-4
WoS: 000437122700017

Fulek R, Pelsmajer M, Schaefer M. 2017. Hanani-Tutte for radial planarity. Journal of Graph Algorithms and Applications. 21(1), 135–154.
LibreCat: https://research-explorer.ista.ac.at/record/1113
DOI: 10.7155/jgaa.00408
arXiv: 1608.08662

Burton B, de Mesmay AN, Wagner U. 2017. Finding non-orientable surfaces in 3-Manifolds. Discrete &; Computational Geometry. 58(4), 871–888.
LibreCat: https://research-explorer.ista.ac.at/record/534
DOI: 10.1007/s00454-017-9900-0
arXiv: 1602.07907

Franek P, Krcál M. 2017. Persistence of zero sets. Homology, Homotopy and Applications. 19(2), 313–342.
LibreCat: https://research-explorer.ista.ac.at/record/568
DOI: 10.4310/HHA.2017.v19.n2.a16

Goaoc X, Mabillard I, Paták P, Patakova Z, Tancer M, Wagner U. 2017. On generalized Heawood inequalities for manifolds: A van Kampen–Flores type nonembeddability result. Israel Journal of Mathematics. 222(2), 841–866.
LibreCat: https://research-explorer.ista.ac.at/record/610
DOI: 10.1007/s11856-017-1607-7

Fulek R. 2017. Embedding graphs into embedded graphs. ISAAC: International Symposium on Algorithms and Computation vol. 92, 34.
LibreCat: https://research-explorer.ista.ac.at/record/6517
DOI: 10.4230/LIPICS.ISAAC.2017.34

Edelsbrunner H, Wagner H. 2017. Topological data analysis with Bregman divergences. Symposium on Computational Geometry, SoCG, LIPIcs, vol. 77, 391–3916.
LibreCat: https://research-explorer.ista.ac.at/record/688
DOI: 10.4230/LIPIcs.SoCG.2017.39

Kyndl J, Patakova Z. 2017. On the nonexistence of k reptile simplices in d^3 and d^4. The Electronic Journal of Combinatorics. 24(3), 1–44.
LibreCat: https://research-explorer.ista.ac.at/record/701

Fulek R, Kyndl J, Pálvölgyi D. 2017. Unified Hanani Tutte theorem. Electronic Journal of Combinatorics. 24(3), .18.
LibreCat: https://research-explorer.ista.ac.at/record/795
DOI: 10.37236/6663

Lubiw A, Masárová Z, Wagner U. 2017. A proof of the orbit conjecture for flipping edge labelled triangulations. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 77, 49.
LibreCat: https://research-explorer.ista.ac.at/record/683
DOI: 10.4230/LIPIcs.SoCG.2017.49

cadek M, Krcál M, Vokínek L. 2017. Algorithmic solvability of the lifting extension problem. Discrete &; Computational Geometry. 54(4), 915–965.
LibreCat: https://research-explorer.ista.ac.at/record/1073
DOI: 10.1007/s00454-016-9855-6
WoS: 000400072700008

Fulek R, Mojarrad H, Naszódi M, Solymosi J, Stich S, Szedlák M. 2017. On the existence of ordinary triangles. Computational Geometry: Theory and Applications. 66, 28–31.
LibreCat: https://research-explorer.ista.ac.at/record/793
DOI: 10.1016/j.comgeo.2017.07.002
WoS: 000412039700003

Fulek R. 2017. C-planarity of embedded cyclic c-graphs. Computational Geometry: Theory and Applications. 66, 1–13.
LibreCat: https://research-explorer.ista.ac.at/record/794
DOI: 10.1016/j.comgeo.2017.06.016
WoS: 000412039700001

Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. 2017.Bounding helly numbers via betti numbers. In: A Journey through Discrete Mathematics: A Tribute to Jiri Matousek. , 407–447.
LibreCat: https://research-explorer.ista.ac.at/record/424
DOI: 10.1007/978-3-319-44479-6_17

Krcál M, Pilarczyk P. 2016. Computation of cubical Steenrod squares. CTIC: Computational Topology in Image Context, LNCS, vol. 9667, 140–151.
LibreCat: https://research-explorer.ista.ac.at/record/1237
DOI: 10.1007/978-3-319-39441-1_13

Gundert A, Wagner U. 2016. On eigenvalues of random complexes. Israel Journal of Mathematics. 216(2), 545–582.
LibreCat: https://research-explorer.ista.ac.at/record/1282
DOI: 10.1007/s11856-016-1419-1

Fulek R. 2016. Bounded embeddings of graphs in the plane. IWOCA: International Workshop on Combinatorial Algorithms, LNCS, vol. 9843, 31–42.
LibreCat: https://research-explorer.ista.ac.at/record/1348
DOI: 10.1007/978-3-319-44543-4_3

Mabillard I, Wagner U. 2016. Eliminating higher-multiplicity intersections, II. The deleted product criterion in the r-metastable range. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 51, 51.1-51.12.
LibreCat: https://research-explorer.ista.ac.at/record/1381
DOI: 10.4230/LIPIcs.SoCG.2016.51

Franek P, Krcál M. 2016. On computability and triviality of well groups. Discrete &; Computational Geometry. 56(1), 126–164.
LibreCat: https://research-explorer.ista.ac.at/record/1408
DOI: 10.1007/s00454-016-9794-2

Avvakumov S. 2016. The classification of certain linked 3-manifolds in 6-space. Moscow Mathematical Journal. 16(1), 1–25.
LibreCat: https://research-explorer.ista.ac.at/record/1522
DOI: 10.17323/1609-4514-2016-16-1-1-25
arXiv: 1408.3918

Gundert A, Wagner U. 2016. On topological minors in random simplicial complexes. Proceedings of the American Mathematical Society. 144(4), 1815–1828.
LibreCat: https://research-explorer.ista.ac.at/record/1523
DOI: 10.1090/proc/12824

Fulek R, Pelsmajer M, Schaefer M. 2016. Hanani-Tutte for radial planarity II. GD: Graph Drawing and Network Visualization, LNCS, vol. 9801, 468–481.
LibreCat: https://research-explorer.ista.ac.at/record/1164
DOI: 10.1007/978-3-319-50106-2_36
arXiv: 1608.08662

Matousek J, Sedgwick E, Tancer M, Wagner U. 2016. Untangling two systems of noncrossing curves. Israel Journal of Mathematics. 212(1), 37–79.
LibreCat: https://research-explorer.ista.ac.at/record/1411
DOI: 10.1007/s11856-016-1294-9

Burton B, de Mesmay AN, Wagner U. 2016. Finding non-orientable surfaces in 3-manifolds. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 51, 24.1-24.15.
LibreCat: https://research-explorer.ista.ac.at/record/1379
DOI: 10.4230/LIPIcs.SoCG.2016.24

Mabillard I. 2016. Eliminating higher-multiplicity intersections: an r-fold Whitney trick for the topological Tverberg conjecture. Institute of Science and Technology Austria.
LibreCat: https://research-explorer.ista.ac.at/record/1123

Fulek R. 2016. C-planarity of embedded cyclic c-graphs. GD: Graph Drawing and Network Visualization, LNCS, vol. 9801, 94–106.
LibreCat: https://research-explorer.ista.ac.at/record/1165
DOI: 10.1007/978-3-319-50106-2_8

Dotterrer D, Kaufman T, Wagner U. 2016. On expansion and topological overlap. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 51, 35.1-35.10.
LibreCat: https://research-explorer.ista.ac.at/record/1378
DOI: 10.4230/LIPIcs.SoCG.2016.35

Franek P, Krcál M. 2015. On computability and triviality of well groups. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 34, 842–856.
LibreCat: https://research-explorer.ista.ac.at/record/1510
DOI: 10.4230/LIPIcs.SOCG.2015.842

Fulek R, Pelsmajer M, Schaefer M. 2015. Hanani-Tutte for radial planarity. GD: Graph Drawing and Network Visualization, LNCS, vol. 9411, 99–110.
LibreCat: https://research-explorer.ista.ac.at/record/1595
DOI: 10.1007/978-3-319-27261-0_9

Fulek R, Radoidi R. 2015.Vertical visibility among parallel polygons in three dimensions. In: Graph Drawing and Network Visualization. LNCS, vol. 9411, 373–379.
LibreCat: https://research-explorer.ista.ac.at/record/1596
DOI: 10.1007/978-3-319-27261-0_31

Fulek R, Kyndl J, Malinovid I, Pálvölgyi D. 2015. Clustered planarity testing revisited. Electronic Journal of Combinatorics. 22(4), .24.
LibreCat: https://research-explorer.ista.ac.at/record/1642
DOI: 10.37236/5002
arXiv: 1305.4519

Cohen Addad V, de Mesmay AN. 2015. A fixed parameter tractable approximation scheme for the optimal cut graph of a surface. ESA: European Symposium on Algorithms, LNCS, vol. 9294, 386–398.
LibreCat: https://research-explorer.ista.ac.at/record/1685
DOI: 10.1007/978-3-662-48350-3_33

Karasev R, Kyndl J, Paták P, Patakova Z, Tancer M. 2015. Bounds for Pach’s selection theorem and for the minimum solid angle in a simplex. Discrete &; Computational Geometry. 54(3), 610–636.
LibreCat: https://research-explorer.ista.ac.at/record/1688
DOI: 10.1007/s00454-015-9720-z

Franek P, Krcál M. 2015. Robust satisfiability of systems of equations. Journal of the ACM. 62(4), 26.
LibreCat: https://research-explorer.ista.ac.at/record/1682
DOI: 10.1145/2751524

Colin De Verdière É, Hubard A, de Mesmay AN. 2015. Discrete systolic inequalities and decompositions of triangulated surfaces. Discrete &; Computational Geometry. 53(3), 587–620.
LibreCat: https://research-explorer.ista.ac.at/record/1730
DOI: 10.1007/s00454-015-9679-9

Goaoc X, Mabillard I, Paták P, Patakova Z, Tancer M, Wagner U. 2015. On generalized Heawood inequalities for manifolds: A Van Kampen–Flores-type nonembeddability result. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 34, 476–490.
LibreCat: https://research-explorer.ista.ac.at/record/1511
DOI: 10.4230/LIPIcs.SOCG.2015.476

Avvakumov S, Mabillard I, Skopenkov A, Wagner U. Eliminating higher-multiplicity intersections, III. Codimension 2. arXiv, 1511.03501.
LibreCat: https://research-explorer.ista.ac.at/record/8183
arXiv: 1511.03501

Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. 2015. Bounding Helly numbers via Betti numbers. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 34, 507–521.
LibreCat: https://research-explorer.ista.ac.at/record/1512
DOI: 10.4230/LIPIcs.SOCG.2015.507

Fulek R, Kyndl J, Malinovi I, Pálvölgyi D. 2014. Clustered planarity testing revisited. International Symposium on Graph Drawing. , LNCS, vol. 8871, 428–436.
LibreCat: https://research-explorer.ista.ac.at/record/10793
DOI: 10.1007/978-3-662-45803-7_36
arXiv: 1305.4519

Cibulka J, Gao P, Krcál M, Valla T, Valtr P. 2014. On the geometric ramsey number of outerplanar graphs. Discrete &; Computational Geometry. 53(1), 64–79.
LibreCat: https://research-explorer.ista.ac.at/record/1842
DOI: 10.1007/s00454-014-9646-x

Matousek J, Wagner U. 2014. On Gromov’s method of selecting heavily covered points. Discrete &; Computational Geometry. 52(1), 1–33.
LibreCat: https://research-explorer.ista.ac.at/record/2154
DOI: 10.1007/s00454-014-9584-7

cadek M, Krcál M, Matousek J, Sergeraert F, Vokínek L, Wagner U. 2014. Computing all maps into a sphere. Journal of the ACM. 61(3), 17.
LibreCat: https://research-explorer.ista.ac.at/record/2184
DOI: 10.1145/2597629

Huszár K, Rolinek M. Playful Math - An introduction to mathematical games, IST Austria, 5p.
LibreCat: https://research-explorer.ista.ac.at/record/7038

Mabillard I, Wagner U. 2014. Eliminating Tverberg points, I. An analogue of the Whitney trick. Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 171–180.
LibreCat: https://research-explorer.ista.ac.at/record/2159
DOI: 10.1145/2582112.2582134

Matousek J, Sedgwick E, Tancer M, Wagner U. 2014. Embeddability in the 3 sphere is decidable. Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 78–84.
LibreCat: https://research-explorer.ista.ac.at/record/2157
DOI: 10.1145/2582112.2582137

Matousek J, Sedgwick E, Tancer M, Wagner U. 2013. Untangling two systems of noncrossing curves. 8242, 472–483.
LibreCat: https://research-explorer.ista.ac.at/record/2244
DOI: 10.1007/978-3-319-03841-4_41
arXiv: 1302.6475

cadek M, Krcál M, Matousek J, Vokínek L, Wagner U. 2013. Extending continuous maps: Polynomiality and undecidability. 45th Annual ACM Symposium on theory of computing. STOC: Symposium on the Theory of Computing, 595–604.
LibreCat: https://research-explorer.ista.ac.at/record/2807
DOI: 10.1145/2488608.2488683