M. Filakovský, T. V. Nakajima, J. Oprsal, G. Tasinato, and U. Wagner, “Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs,” in 41st International Symposium on Theoretical Aspects of Computer Science, Clermont-Ferrand, France, 2024, vol. 289.
LibreCat: https://research-explorer.ista.ac.at/record/15168
DOI: 10.4230/LIPIcs.STACS.2024.34
arXiv: 2312.12981

R. Fulek, B. Gärtner, A. Kupavskii, P. Valtr, and U. Wagner, “The crossing Tverberg theorem,” Discrete and Computational Geometry. Springer Nature, 2023.
LibreCat: https://research-explorer.ista.ac.at/record/13974
DOI: 10.1007/s00454-023-00532-x
WoS: 001038546500001
arXiv: 1812.04911

U. Wagner and P. Wild, “Coboundary expansion, equivariant overlap, and crossing numbers of simplicial complexes,” Israel Journal of Mathematics, vol. 256, no. 2. Springer Nature, pp. 675–717, 2023.
LibreCat: https://research-explorer.ista.ac.at/record/14445
DOI: 10.1007/s11856-023-2521-9
WoS: 001081646400010

Z. Patakova, M. Tancer, and U. Wagner, “Barycentric cuts through a convex body,” Discrete and Computational Geometry, vol. 68. Springer Nature, pp. 1133–1154, 2022.
LibreCat: https://research-explorer.ista.ac.at/record/10776
DOI: 10.1007/s00454-021-00364-7
WoS: 000750681500001
arXiv: 2003.13536

U. Wagner and E. Welzl, “Connectivity of triangulation flip graphs in the plane,” Discrete &; Computational Geometry, vol. 68, no. 4. Springer Nature, pp. 1227–1284, 2022.
LibreCat: https://research-explorer.ista.ac.at/record/12129
DOI: 10.1007/s00454-022-00436-2
WoS: 000883222200003

U. Wagner, “High-dimensional expanders (after Gromov, Kaufman, Kazhdan, Lubotzky, and others),” Bulletin de la Societe Mathematique de France, vol. 438. Societe Mathematique de France, pp. 281–294, 2022.
LibreCat: https://research-explorer.ista.ac.at/record/14381
DOI: 10.24033/ast.1188

S. Avvakumov, I. Mabillard, A. B. Skopenkov, and U. Wagner, “Eliminating higher-multiplicity intersections. III. Codimension 2,” Israel Journal of Mathematics, vol. 245. Springer Nature, pp. 501–534, 2021.
LibreCat: https://research-explorer.ista.ac.at/record/10220
DOI: 10.1007/s11856-021-2216-z
WoS: 000712942100013
arXiv: 1511.03501

M. Filakovský, U. Wagner, and S. Y. Zhechev, “Embeddability of simplicial complexes is undecidable,” in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Salt Lake City, UT, United States, 2020, vol. 2020–January, pp. 767–785.
LibreCat: https://research-explorer.ista.ac.at/record/7806
DOI: 10.1137/1.9781611975994.47

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

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

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

S. Avvakumov, U. Wagner, I. Mabillard, and A. B. Skopenkov, “Eliminating higher-multiplicity intersections, III. Codimension 2,” Russian Mathematical Surveys, vol. 75, no. 6. IOP Publishing, pp. 1156–1158, 2020.
LibreCat: https://research-explorer.ista.ac.at/record/9308
DOI: 10.1070/RM9943
WoS: 000625983100001
arXiv: 1511.03501

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

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, 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

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

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

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

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

B. Burton, A. N. de Mesmay, and U. Wagner, “Finding non-orientable surfaces in 3-Manifolds,” Discrete &; Computational Geometry, vol. 58, no. 4. Springer, pp. 871–888, 2017.
LibreCat: https://research-explorer.ista.ac.at/record/534
DOI: 10.1007/s00454-017-9900-0
arXiv: 1602.07907

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

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

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

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

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

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

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

B. Burton, A. N. de Mesmay, and U. Wagner, “Finding non-orientable surfaces in 3-manifolds,” presented at the SoCG: Symposium on Computational Geometry, Medford, MA, USA, 2016, vol. 51, p. 24.1-24.15.
LibreCat: https://research-explorer.ista.ac.at/record/1379
DOI: 10.4230/LIPIcs.SoCG.2016.24

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

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

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

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

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

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

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

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

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

M. cadek, M. Krcál, J. Matousek, L. Vokínek, and U. Wagner, “Extending continuous maps: Polynomiality and undecidability,” in 45th Annual ACM Symposium on theory of computing, Palo Alto, CA, United States, 2013, pp. 595–604.
LibreCat: https://research-explorer.ista.ac.at/record/2807
DOI: 10.1145/2488608.2488683

M. cadek, M. Krcál, J. Matousek, F. Sergeraert, L. Vokínek, and U. Wagner, “Computing all maps into a sphere,” presented at the SODA: Symposium on Discrete Algorithms, 2012, pp. 1–10.
LibreCat: https://research-explorer.ista.ac.at/record/2440

J. Matousek, M. Tancer, and U. Wagner, “A geometric proof of the colored Tverberg theorem,” Discrete &; Computational Geometry, vol. 47, no. 2. Springer, pp. 245–265, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/2438
DOI: 10.1007/s00454-011-9368-2

D. Chen, P. Morin, and U. Wagner, “Absolute approximation of Tukey depth: Theory and experiments,” Computational Geometry: Theory and Applications, vol. 46, no. 5. Elsevier, pp. 566–573, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/2439
DOI: 10.1016/j.comgeo.2012.03.001

A. Gundert and U. Wagner, “On Laplacians of random complexes,” presented at the SGC: Symposuim on Computational Geometry, 2012, pp. 151–160.
LibreCat: https://research-explorer.ista.ac.at/record/2441
DOI: 10.1145/2261250.2261272

J. Matousek, M. Tancer, and U. Wagner, “Hardness of embedding simplicial complexes in Rd,” Journal of the European Mathematical Society, vol. 13, no. 2. European Mathematical Society, pp. 259–295, 2011.
LibreCat: https://research-explorer.ista.ac.at/record/2436
DOI: 10.4171/JEMS/252

U. Wagner, “Minors in random and expanding hypergraphs,” presented at the SGC: Symposuim on Computational Geometry, 2011, pp. 351–360.
LibreCat: https://research-explorer.ista.ac.at/record/2437
DOI: 10.1145/1998196.1998256

E. Nevo and U. Wagner, “On the embeddability of skeleta of spheres,” Israel Journal of Mathematics, vol. 174, no. 1. Springer, pp. 381–402, 2010.
LibreCat: https://research-explorer.ista.ac.at/record/2435
DOI: 10.1007/s11856-009-0119-5

K. Buchin, A. Razen, T. Uno, and U. Wagner, “Transforming spanning trees: A lower bound,” Computational Geometry: Theory and Applications, vol. 42, no. 8. Elsevier, pp. 724–730, 2009.
LibreCat: https://research-explorer.ista.ac.at/record/2434
DOI: 10.1016/j.comgeo.2008.03.005

J. Matousek, M. Tancer, and U. Wagner, “Hardness of embedding simplicial complexes in dd,” presented at the SODA: Symposium on Discrete Algorithms, 2009, pp. 855–864.
LibreCat: https://research-explorer.ista.ac.at/record/2433

U. Wagner, “k-Sets and k-facets,” in Surveys on Discrete and Computational Geometry: Twenty Years Later, vol. 453, J. Goodman, J. Pach, and R. Pollack, Eds. American Mathematical Society, 2008, pp. 443–514.
LibreCat: https://research-explorer.ista.ac.at/record/2415
DOI: 10.1090/conm/453

S. Smorodinsky, M. Sulovský, and U. Wagner, “On center regions and balls containing many points,” presented at the COCOON: Conference on Computing and Combinatorics, 2008, vol. 5092, pp. 363–373.
LibreCat: https://research-explorer.ista.ac.at/record/2432
DOI: 10.1007/978-3-540-69733-6_36

J. Bang Jensen, B. Reed, B. Schacht, R. Sámal, B. Toft, and U. Wagner, “On six problems posed by Jarik Nesetil,” in Topics in Discrete Mathematics, vol. 26, Springer, 2006, pp. 613–627.
LibreCat: https://research-explorer.ista.ac.at/record/2416
DOI: 10.1007/3-540-33700-8_30

K. Chent et al., “Online conflict-free coloring for intervals,” SIAM Journal on Computing, vol. 36, no. 5. SIAM, pp. 1342–1359, 2006.
LibreCat: https://research-explorer.ista.ac.at/record/2430
DOI: 10.1137/S0097539704446682

U. Wagner, “On a geometric generalization of the Upper Bound Theorem,” presented at the FOCS: Foundations of Computer Science, 2006, pp. 635–645.
LibreCat: https://research-explorer.ista.ac.at/record/2431
DOI: 10.1109/FOCS.2006.53

J. Matousek, M. Sharir, S. Smorodinsky, and U. Wagner, “K-sets in four dimensions,” Discrete &; Computational Geometry, vol. 35, no. 2. Springer, pp. 177–191, 2006.
LibreCat: https://research-explorer.ista.ac.at/record/2429
DOI: 10.1007/s00454-005-1200-4

A. Fiat et al., “Online conflict-free coloring for intervals,” presented at the SODA: Symposium on Discrete Algorithms, 2005, pp. 545–554.
LibreCat: https://research-explorer.ista.ac.at/record/2428
DOI: 10.1137/S0097539704446682

C. Ambühl and U. Wagner, “The Clique problem in intersection graphs of ellipses and triangles,” Theory of Computing Systems, vol. 38, no. 3. Springer, pp. 279–292, 2005.
LibreCat: https://research-explorer.ista.ac.at/record/2427
DOI: 10.1007/s00224-005-1141-6

L. Lovász, K. Vesztergombi, U. Wagner, and E. Welzl, “Convex quadrilaterals and k-sets ,” in Towards a Theory of Geometric Graphs, vol. 342, J. Pach, Ed. American Mathematical Society, 2004, pp. 139–148.
LibreCat: https://research-explorer.ista.ac.at/record/2417
DOI: 10.1090/conm/342

J. Giesen and U. Wagner, “Shape dimension and intrinsic metric from samples of manifolds,” Discrete &; Computational Geometry, vol. 32, no. 2. Springer, pp. 245–267, 2004.
LibreCat: https://research-explorer.ista.ac.at/record/2426
DOI: 10.1007/s00454-004-1120-8

J. Matousek and U. Wagner, “New constructions of weak ;5-nets,” Discrete &; Computational Geometry, vol. 32, no. 2. Springer, pp. 195–206, 2004.
LibreCat: https://research-explorer.ista.ac.at/record/2425
DOI: 10.1007/s00454-004-1116-4

U. Wagner, “On k-Sets and Their Applications,” ETH Zurich, 2003.
LibreCat: https://research-explorer.ista.ac.at/record/2414
DOI: 10.3929/ethz-a-004708408

J. Giesen and U. Wagner, “Shape dimension and intrinsic metric from samples of manifolds with high co-dimension,” presented at the SoCG: Symposium on Computational Geometry, 2003, pp. 329–337.
LibreCat: https://research-explorer.ista.ac.at/record/2424
DOI: 10.1145/777792.777841

J. Matousek and U. Wagner, “New constructions of weak epsilon-nets,” presented at the SoCG: Symposium on Computational Geometry, 2003, pp. 129–135.
LibreCat: https://research-explorer.ista.ac.at/record/2423
DOI: 10.1145/777792.777813

U. Wagner, “On the rectilinear crossing number of complete graphs,” presented at the SODA: Symposium on Discrete Algorithms, 2003, pp. 583–588.
LibreCat: https://research-explorer.ista.ac.at/record/2422

C. Ambühl and U. Wagner, “On the Clique problem in intersection graphs of ellipses,” in Proceedings of the 13th International Symposium on Algorithms and Computation, Vancouver, Canada, 2002, vol. 2518, pp. 489–500.
LibreCat: https://research-explorer.ista.ac.at/record/2421
DOI: 10.1007/3-540-36136-7_43

U. Wagner, “On the number of corner cuts,” Advances in Applied Mathematics, vol. 29, no. 2. ACM, pp. 152–161, 2002.
LibreCat: https://research-explorer.ista.ac.at/record/2420
DOI: 10.1016/S0196-8858(02)00014-3

U. Wagner and E. Welzl, “A continuous analogue of the Upper Bound Theorem,” Discrete &; Computational Geometry, vol. 26, no. 2. Springer, pp. 205–219, 2001.
LibreCat: https://research-explorer.ista.ac.at/record/2419
DOI: 10.1007/s00454-001-0028-9

U. Wagner and E. Welzl, “Origin-embracing distributions or a continuous analogue of the Upper Bound Theorem,” in Proceedings of the 16th annual symposium on Computational geometry, Clear Water Bay Kowloon, Hong Kong, 2000, pp. 50–56.
LibreCat: https://research-explorer.ista.ac.at/record/2418
DOI: 10.1145/336154.336176