Uli Wagner

72 Publications

Mark all

[72]
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19860 | OA
Aronov B, Basit A, Ramesh I, Tasinato G, Wagner U. 2025. Eight-partitioning points in 3D, and efficiently too. Discrete and Computational Geometry.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 
[71]
2025 | Published | Conference Paper | IST-REx-ID: 20008 | OA
Avvakumov S, Filakovský M, Opršal J, Tasinato G, Wagner U. 2025. Hardness of 4-colouring G-colourable graphs. Proceedings of the 57th Annual ACM Symposium on Theory of Computing. STOC: Symposium on Theory of Computing, 72–83.
[Published Version] View | Files available | DOI
 
[70]
2025 | Published | Conference Paper | IST-REx-ID: 20004 | OA
Streltsova E, Wagner U. 2025. Levels in arrangements: Linear relations, the g-matrix, and applications to crossing numbers. 41st International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 332, 75.
[Published Version] View | Files available | DOI | arXiv
 
[69]
2024 | Published | Journal Article | IST-REx-ID: 13974 | OA
Fulek R, Gärtner B, Kupavskii A, Valtr P, Wagner U. 2024. The crossing Tverberg theorem. Discrete and Computational Geometry. 72, 831–848.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[68]
2024 | Published | Conference Paper | IST-REx-ID: 15168 | OA
Filakovský M, Nakajima TV, Opršal J, Tasinato G, Wagner U. 2024. Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs. 41st International Symposium on Theoretical Aspects of Computer Science. STACS: Symposium on Theoretical Aspects of Computer Science, LIPIcs, vol. 289, 34.
[Published Version] View | Files available | DOI | arXiv
 
[67]
2024 | Published | Conference Paper | IST-REx-ID: 18917 | OA
Aronov B, Basit A, Ramesh I, Tasinato G, Wagner U. 2024. Eight-partitioning points in 3D, and efficiently too. 40th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry vol. 293, 8:1-8:15.
[Published Version] View | Files available | DOI | arXiv
 
[66]
2023 | Published | Journal Article | IST-REx-ID: 14445 | OA
Wagner U, Wild P. 2023. Coboundary expansion, equivariant overlap, and crossing numbers of simplicial complexes. Israel Journal of Mathematics. 256(2), 675–717.
[Published Version] View | Files available | DOI | WoS
 
[65]
2022 | Published | Journal Article | IST-REx-ID: 14381
Wagner U. 2022. High-dimensional expanders (after Gromov, Kaufman, Kazhdan, Lubotzky, and others). Bulletin de la Societe Mathematique de France. 438, 281–294.
View | DOI
 
[64]
2022 | Published | Journal Article | IST-REx-ID: 10776 | OA
Patakova Z, Tancer M, Wagner U. 2022. Barycentric cuts through a convex body. Discrete and Computational Geometry. 68, 1133–1154.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[63]
2022 | Published | Journal Article | IST-REx-ID: 12129 | OA
Wagner U, Welzl E. 2022. Connectivity of triangulation flip graphs in the plane. Discrete & Computational Geometry. 68(4), 1227–1284.
[Published Version] View | Files available | DOI | WoS
 
[62]
2021 | Published | Journal Article | IST-REx-ID: 10220 | OA
Avvakumov S, Mabillard I, Skopenkov AB, Wagner U. 2021. Eliminating higher-multiplicity intersections. III. Codimension 2. Israel Journal of Mathematics. 245, 501–534.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[61]
2020 | Published | Conference Paper | IST-REx-ID: 7807 | OA
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.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | arXiv
 
[60]
2020 | Published | Conference Paper | IST-REx-ID: 7806 | OA
Filakovský M, Wagner U, Zhechev SY. 2020. Embeddability of simplicial complexes is undecidable. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms vol. 2020–January, 767–785.
[Published Version] View | DOI | Download Published Version (ext.)
 
[59]
2020 | Published | Journal Article | IST-REx-ID: 9308 | OA
Avvakumov S, Wagner U, Mabillard I, Skopenkov AB. 2020. Eliminating higher-multiplicity intersections, III. Codimension 2. Russian Mathematical Surveys. 75(6), 1156–1158.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[58]
2020 | Published | Conference Paper | IST-REx-ID: 7990 | OA
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.
[Published Version] View | Files available | DOI | arXiv
 
[57]
2020 | Published | Conference Paper | IST-REx-ID: 7992 | OA
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.
[Published Version] View | Files available | DOI | arXiv
 
[56]
2019 | Published | Conference Paper | IST-REx-ID: 6647 | OA
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.
[Published Version] View | Files available | DOI | arXiv
 
[55]
2019 | Published | Journal Article | IST-REx-ID: 5986 | OA
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.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[54]
2019 | Published | Journal Article | IST-REx-ID: 7108 | OA
Goaoc X, Patak P, Patakova Z, Tancer M, Wagner U. 2019. Shellability is NP-complete. Journal of the ACM. 66(3), 21.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[53]
2019 | Published | Journal Article | IST-REx-ID: 7093 | OA
Huszár K, Spreer J, Wagner U. 2019. On the treewidth of triangulated 3-manifolds. Journal of Computational Geometry. 10(2), 70–98.
[Published Version] View | Files available | DOI | arXiv
 
[52]
2018 | Published | Journal Article | IST-REx-ID: 742 | OA
Dotterrer D, Kaufman T, Wagner U. 2018. On expansion and topological overlap. Geometriae Dedicata. 195(1), 307–317.
[Published Version] View | Files available | DOI | WoS
 
[51]
2018 | Published | Conference Paper | IST-REx-ID: 184 | OA
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.
[Published Version] View | Files available | DOI
 
[50]
2018 | Published | Journal Article | IST-REx-ID: 425 | OA
Matoušek J, Sedgwick E, Tancer M, Wagner U. 2018. Embeddability in the 3-Sphere is decidable. Journal of the ACM. 65(1), 5.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[49]
2018 | Published | Conference Paper | IST-REx-ID: 285 | OA
Huszár K, Spreer J, Wagner U. 2018. On the treewidth of triangulated 3-manifolds. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 99, 46.
[Submitted Version] View | Files available | DOI | arXiv
 
[48]
2018 | Published | Journal Article | IST-REx-ID: 6774 | OA
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.
[Published Version] View | Files available | DOI
 
[47]
2017 | Published | Conference Paper | IST-REx-ID: 683 | OA
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.
[Published Version] View | Files available | DOI
 
[46]
2017 | Published | Journal Article | IST-REx-ID: 534 | OA
Burton B, de Mesmay AN, Wagner U. 2017. Finding non-orientable surfaces in 3-Manifolds. Discrete & Computational Geometry. 58(4), 871–888.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[45]
2017 | Published | Book Chapter | IST-REx-ID: 424 | OA
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.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 
[44]
2017 | Published | Journal Article | IST-REx-ID: 610 | OA
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.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[43]
2016 | Published | Conference Paper | IST-REx-ID: 1381 | OA
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.
[Published Version] View | Files available | DOI
 
[42]
2016 | Published | Conference Paper | IST-REx-ID: 1378 | OA
Dotterrer D, Kaufman T, Wagner U. 2016. On expansion and topological overlap. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 51, 35.1-35.10.
[Published Version] View | Files available | DOI
 
[41]
2016 | Published | Conference Paper | IST-REx-ID: 1379 | OA
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.
[Published Version] View | Files available | DOI
 
[40]
2016 | Published | Journal Article | IST-REx-ID: 1523 | OA
Gundert A, Wagner U. 2016. On topological minors in random simplicial complexes. Proceedings of the American Mathematical Society. 144(4), 1815–1828.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[39]
2016 | Published | Journal Article | IST-REx-ID: 1411 | OA
Matoušek J, Sedgwick E, Tancer M, Wagner U. 2016. Untangling two systems of noncrossing curves. Israel Journal of Mathematics. 212(1), 37–79.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[38]
2016 | Published | Journal Article | IST-REx-ID: 1282 | OA
Gundert A, Wagner U. 2016. On eigenvalues of random complexes. Israel Journal of Mathematics. 216(2), 545–582.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[37]
2015 | Published | Conference Paper | IST-REx-ID: 1512 | OA
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.
[Submitted Version] View | Files available | DOI
 
[36]
2015 | Published | Conference Paper | IST-REx-ID: 1511 | OA
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.
[Published Version] View | Files available | DOI
 
[35]
2015 | Draft | Preprint | IST-REx-ID: 8183 | OA
Avvakumov S, Mabillard I, Skopenkov A, Wagner U. Eliminating higher-multiplicity intersections, III. Codimension 2. arXiv, 1511.03501.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[34]
2014 | Published | Conference Paper | IST-REx-ID: 2159 | OA
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.
[Submitted Version] View | Files available | DOI
 
[33]
2014 | Published | Journal Article | IST-REx-ID: 2154 | OA
Matoušek J, Wagner U. 2014. On Gromov’s method of selecting heavily covered points. Discrete & Computational Geometry. 52(1), 1–33.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | arXiv
 
[32]
2014 | Published | Conference Paper | IST-REx-ID: 2157 | OA
Matoušek 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.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | arXiv
 
[31]
2014 | Published | Journal Article | IST-REx-ID: 2184 | OA
Čadek M, Krcál M, Matoušek J, Sergeraert F, Vokřínek L, Wagner U. 2014. Computing all maps into a sphere. Journal of the ACM. 61(3), 17.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[30]
2013 | Published | Conference Paper | IST-REx-ID: 2807 | OA
Čadek M, Krcál M, Matoušek 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.
[Submitted Version] View | Files available | DOI
 
[29]
2013 | Published | Conference Paper | IST-REx-ID: 2244 | OA
Matoušek J, Sedgwick E, Tancer M, Wagner U. 2013. Untangling two systems of noncrossing curves. 8242, 472–483.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[28]
2012 | Published | Journal Article | IST-REx-ID: 2438
Matoušek J, Tancer M, Wagner U. 2012. A geometric proof of the colored Tverberg theorem. Discrete & Computational Geometry. 47(2), 245–265.
View | DOI
 
[27]
2012 | Published | Journal Article | IST-REx-ID: 2439
Chen D, Morin P, Wagner U. 2012. Absolute approximation of Tukey depth: Theory and experiments. Computational Geometry: Theory and Applications. 46(5), 566–573.
View | DOI
 
[26]
2012 | Published | Conference Paper | IST-REx-ID: 2440
Čadek M, Krcál M, Matoušek J, Sergeraert F, Vokřínek L, Wagner U. 2012. Computing all maps into a sphere. SODA: Symposium on Discrete Algorithms, 1–10.
View | Download (ext.)
 
[25]
2012 | Published | Conference Paper | IST-REx-ID: 2441
Gundert A, Wagner U. 2012. On Laplacians of random complexes. SGC: Symposuim on Computational Geometry, 151–160.
View | DOI
 
[24]
2011 | Published | Journal Article | IST-REx-ID: 2436
Matoušek J, Tancer M, Wagner U. 2011. Hardness of embedding simplicial complexes in Rd. Journal of the European Mathematical Society. 13(2), 259–295.
View | DOI
 
[23]
2011 | Published | Conference Paper | IST-REx-ID: 2437
Wagner U. 2011. Minors in random and expanding hypergraphs. SGC: Symposuim on Computational Geometry, 351–360.
View | DOI
 
[22]
2010 | Published | Journal Article | IST-REx-ID: 2435
Nevo E, Wagner U. 2010. On the embeddability of skeleta of spheres. Israel Journal of Mathematics. 174(1), 381–402.
View | DOI
 
[21]
2009 | Published | Conference Paper | IST-REx-ID: 2433 | OA
Matoušek J, Tancer M, Wagner U. 2009. Hardness of embedding simplicial complexes in ℝd. SODA: Symposium on Discrete Algorithms, 855–864.
View | Download (ext.)
 
[20]
2009 | Published | Journal Article | IST-REx-ID: 2434
Buchin K, Razen A, Uno T, Wagner U. 2009. Transforming spanning trees: A lower bound. Computational Geometry: Theory and Applications. 42(8), 724–730.
View | DOI
 
[19]
2008 | Published | Book Chapter | IST-REx-ID: 2415
Wagner U. 2008.k-Sets and k-facets. In: Surveys on Discrete and Computational Geometry: Twenty Years Later. Contemporary Mathematics, vol. 453, 443–514.
View | DOI
 
[18]
2008 | Published | Conference Paper | IST-REx-ID: 2432
Smorodinsky S, Sulovský M, Wagner U. 2008. On center regions and balls containing many points. COCOON: Conference on Computing and Combinatorics, LNCS, vol. 5092, 363–373.
View | DOI
 
[17]
2006 | Published | Book Chapter | IST-REx-ID: 2416
Bang Jensen J, Reed B, Schacht B, Šámal R, Toft B, Wagner U. 2006.On six problems posed by Jarik Nešetřil. In: Topics in Discrete Mathematics. Algorithms and Combinatorics, vol. 26, 613–627.
View | DOI
 
[16]
2006 | Published | Journal Article | IST-REx-ID: 2429
Matoušek J, Sharir M, Smorodinsky S, Wagner U. 2006. K-sets in four dimensions. Discrete & Computational Geometry. 35(2), 177–191.
View | DOI
 
[15]
2006 | Published | Journal Article | IST-REx-ID: 2430
Chent K, Fiat A, Kaplan H, Levy M, Matoušek J, Mossel E, Pach J, Sharir M, Smorodinsky S, Wagner U, Welzl E. 2006. Online conflict-free coloring for intervals. SIAM Journal on Computing. 36(5), 1342–1359.
View | DOI
 
[14]
2006 | Published | Conference Paper | IST-REx-ID: 2431
Wagner U. 2006. On a geometric generalization of the Upper Bound Theorem. FOCS: Foundations of Computer Science, IEEE Conference Proceedings, , 635–645.
View | DOI
 
[13]
2005 | Published | Journal Article | IST-REx-ID: 2427
Ambühl C, Wagner U. 2005. The Clique problem in intersection graphs of ellipses and triangles. Theory of Computing Systems. 38(3), 279–292.
View | DOI
 
[12]
2005 | Published | Conference Paper | IST-REx-ID: 2428
Fiat A, Levy M, Matoušek J, Pach E, Sharir M, Smorodinsky S, Wagner U, Welzl E. 2005. Online conflict-free coloring for intervals. SODA: Symposium on Discrete Algorithms, 545–554.
View | DOI
 
[11]
2004 | Published | Book Chapter | IST-REx-ID: 2417
Lovász L, Vesztergombi K, Wagner U, Welzl E. 2004.Convex quadrilaterals and k-sets . In: Towards a Theory of Geometric Graphs. Contemporary Mathematics , vol. 342, 139–148.
View | DOI
 
[10]
2004 | Published | Journal Article | IST-REx-ID: 2425
Matoušek J, Wagner U. 2004. New constructions of weak ε-nets. Discrete & Computational Geometry. 32(2), 195–206.
View | DOI
 
[9]
2004 | Published | Journal Article | IST-REx-ID: 2426
Giesen J, Wagner U. 2004. Shape dimension and intrinsic metric from samples of manifolds. Discrete & Computational Geometry. 32(2), 245–267.
View | DOI
 
[8]
2003 | Published | Thesis | IST-REx-ID: 2414
Wagner U. 2003. On k-Sets and Their Applications. ETH Zurich.
View | DOI
 
[7]
2003 | Published | Conference Paper | IST-REx-ID: 2422
Wagner U. 2003. On the rectilinear crossing number of complete graphs. SODA: Symposium on Discrete Algorithms, 583–588.
View | Download (ext.)
 
[6]
2003 | Published | Conference Paper | IST-REx-ID: 2423
Matoušek J, Wagner U. 2003. New constructions of weak epsilon-nets. SoCG: Symposium on Computational Geometry, 129–135.
View | DOI
 
[5]
2003 | Published | Conference Paper | IST-REx-ID: 2424
Giesen J, Wagner U. 2003. Shape dimension and intrinsic metric from samples of manifolds with high co-dimension. SoCG: Symposium on Computational Geometry, 329–337.
View | DOI
 
[4]
2002 | Published | Journal Article | IST-REx-ID: 2420
Wagner U. 2002. On the number of corner cuts. Advances in Applied Mathematics. 29(2), 152–161.
View | DOI
 
[3]
2002 | Published | Conference Paper | IST-REx-ID: 2421
Ambühl C, Wagner U. 2002. On the Clique problem in intersection graphs of ellipses. Proceedings of the 13th International Symposium on Algorithms and Computation. ISAAC: International Symposium on Algorithms and Computation, LNCS, vol. 2518, 489–500.
View | DOI
 
[2]
2001 | Published | Journal Article | IST-REx-ID: 2419
Wagner U, Welzl E. 2001. A continuous analogue of the Upper Bound Theorem. Discrete & Computational Geometry. 26(2), 205–219.
View | DOI
 
[1]
2000 | Published | Conference Paper | IST-REx-ID: 2418
Wagner U, Welzl E. 2000. Origin-embracing distributions or a continuous analogue of the Upper Bound Theorem. Proceedings of the 16th annual symposium on Computational geometry. SCG: Symposium on Computational Geometry, 50–56.
View | DOI
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: ISTA Annual Report

Export / Embed

2 Grants


Embeddings in Higher Dimensions: Algorithms and Combinatorics

2013-03-01 – 2016-06-30
Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung

Algorithms for Embeddings and Homotopy Theory

2018-05-01 – 2022-04-30
Austrian Science Fund

72 Publications

Mark all

[72]
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19860 | OA
Aronov B, Basit A, Ramesh I, Tasinato G, Wagner U. 2025. Eight-partitioning points in 3D, and efficiently too. Discrete and Computational Geometry.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 
[71]
2025 | Published | Conference Paper | IST-REx-ID: 20008 | OA
Avvakumov S, Filakovský M, Opršal J, Tasinato G, Wagner U. 2025. Hardness of 4-colouring G-colourable graphs. Proceedings of the 57th Annual ACM Symposium on Theory of Computing. STOC: Symposium on Theory of Computing, 72–83.
[Published Version] View | Files available | DOI
 
[70]
2025 | Published | Conference Paper | IST-REx-ID: 20004 | OA
Streltsova E, Wagner U. 2025. Levels in arrangements: Linear relations, the g-matrix, and applications to crossing numbers. 41st International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 332, 75.
[Published Version] View | Files available | DOI | arXiv
 
[69]
2024 | Published | Journal Article | IST-REx-ID: 13974 | OA
Fulek R, Gärtner B, Kupavskii A, Valtr P, Wagner U. 2024. The crossing Tverberg theorem. Discrete and Computational Geometry. 72, 831–848.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[68]
2024 | Published | Conference Paper | IST-REx-ID: 15168 | OA
Filakovský M, Nakajima TV, Opršal J, Tasinato G, Wagner U. 2024. Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs. 41st International Symposium on Theoretical Aspects of Computer Science. STACS: Symposium on Theoretical Aspects of Computer Science, LIPIcs, vol. 289, 34.
[Published Version] View | Files available | DOI | arXiv
 
[67]
2024 | Published | Conference Paper | IST-REx-ID: 18917 | OA
Aronov B, Basit A, Ramesh I, Tasinato G, Wagner U. 2024. Eight-partitioning points in 3D, and efficiently too. 40th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry vol. 293, 8:1-8:15.
[Published Version] View | Files available | DOI | arXiv
 
[66]
2023 | Published | Journal Article | IST-REx-ID: 14445 | OA
Wagner U, Wild P. 2023. Coboundary expansion, equivariant overlap, and crossing numbers of simplicial complexes. Israel Journal of Mathematics. 256(2), 675–717.
[Published Version] View | Files available | DOI | WoS
 
[65]
2022 | Published | Journal Article | IST-REx-ID: 14381
Wagner U. 2022. High-dimensional expanders (after Gromov, Kaufman, Kazhdan, Lubotzky, and others). Bulletin de la Societe Mathematique de France. 438, 281–294.
View | DOI
 
[64]
2022 | Published | Journal Article | IST-REx-ID: 10776 | OA
Patakova Z, Tancer M, Wagner U. 2022. Barycentric cuts through a convex body. Discrete and Computational Geometry. 68, 1133–1154.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[63]
2022 | Published | Journal Article | IST-REx-ID: 12129 | OA
Wagner U, Welzl E. 2022. Connectivity of triangulation flip graphs in the plane. Discrete & Computational Geometry. 68(4), 1227–1284.
[Published Version] View | Files available | DOI | WoS
 
[62]
2021 | Published | Journal Article | IST-REx-ID: 10220 | OA
Avvakumov S, Mabillard I, Skopenkov AB, Wagner U. 2021. Eliminating higher-multiplicity intersections. III. Codimension 2. Israel Journal of Mathematics. 245, 501–534.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[61]
2020 | Published | Conference Paper | IST-REx-ID: 7807 | OA
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.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | arXiv
 
[60]
2020 | Published | Conference Paper | IST-REx-ID: 7806 | OA
Filakovský M, Wagner U, Zhechev SY. 2020. Embeddability of simplicial complexes is undecidable. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms vol. 2020–January, 767–785.
[Published Version] View | DOI | Download Published Version (ext.)
 
[59]
2020 | Published | Journal Article | IST-REx-ID: 9308 | OA
Avvakumov S, Wagner U, Mabillard I, Skopenkov AB. 2020. Eliminating higher-multiplicity intersections, III. Codimension 2. Russian Mathematical Surveys. 75(6), 1156–1158.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[58]
2020 | Published | Conference Paper | IST-REx-ID: 7990 | OA
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.
[Published Version] View | Files available | DOI | arXiv
 
[57]
2020 | Published | Conference Paper | IST-REx-ID: 7992 | OA
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.
[Published Version] View | Files available | DOI | arXiv
 
[56]
2019 | Published | Conference Paper | IST-REx-ID: 6647 | OA
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.
[Published Version] View | Files available | DOI | arXiv
 
[55]
2019 | Published | Journal Article | IST-REx-ID: 5986 | OA
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.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[54]
2019 | Published | Journal Article | IST-REx-ID: 7108 | OA
Goaoc X, Patak P, Patakova Z, Tancer M, Wagner U. 2019. Shellability is NP-complete. Journal of the ACM. 66(3), 21.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[53]
2019 | Published | Journal Article | IST-REx-ID: 7093 | OA
Huszár K, Spreer J, Wagner U. 2019. On the treewidth of triangulated 3-manifolds. Journal of Computational Geometry. 10(2), 70–98.
[Published Version] View | Files available | DOI | arXiv
 
[52]
2018 | Published | Journal Article | IST-REx-ID: 742 | OA
Dotterrer D, Kaufman T, Wagner U. 2018. On expansion and topological overlap. Geometriae Dedicata. 195(1), 307–317.
[Published Version] View | Files available | DOI | WoS
 
[51]
2018 | Published | Conference Paper | IST-REx-ID: 184 | OA
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.
[Published Version] View | Files available | DOI
 
[50]
2018 | Published | Journal Article | IST-REx-ID: 425 | OA
Matoušek J, Sedgwick E, Tancer M, Wagner U. 2018. Embeddability in the 3-Sphere is decidable. Journal of the ACM. 65(1), 5.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[49]
2018 | Published | Conference Paper | IST-REx-ID: 285 | OA
Huszár K, Spreer J, Wagner U. 2018. On the treewidth of triangulated 3-manifolds. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 99, 46.
[Submitted Version] View | Files available | DOI | arXiv
 
[48]
2018 | Published | Journal Article | IST-REx-ID: 6774 | OA
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.
[Published Version] View | Files available | DOI
 
[47]
2017 | Published | Conference Paper | IST-REx-ID: 683 | OA
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.
[Published Version] View | Files available | DOI
 
[46]
2017 | Published | Journal Article | IST-REx-ID: 534 | OA
Burton B, de Mesmay AN, Wagner U. 2017. Finding non-orientable surfaces in 3-Manifolds. Discrete & Computational Geometry. 58(4), 871–888.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[45]
2017 | Published | Book Chapter | IST-REx-ID: 424 | OA
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.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 
[44]
2017 | Published | Journal Article | IST-REx-ID: 610 | OA
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.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[43]
2016 | Published | Conference Paper | IST-REx-ID: 1381 | OA
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.
[Published Version] View | Files available | DOI
 
[42]
2016 | Published | Conference Paper | IST-REx-ID: 1378 | OA
Dotterrer D, Kaufman T, Wagner U. 2016. On expansion and topological overlap. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 51, 35.1-35.10.
[Published Version] View | Files available | DOI
 
[41]
2016 | Published | Conference Paper | IST-REx-ID: 1379 | OA
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.
[Published Version] View | Files available | DOI
 
[40]
2016 | Published | Journal Article | IST-REx-ID: 1523 | OA
Gundert A, Wagner U. 2016. On topological minors in random simplicial complexes. Proceedings of the American Mathematical Society. 144(4), 1815–1828.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[39]
2016 | Published | Journal Article | IST-REx-ID: 1411 | OA
Matoušek J, Sedgwick E, Tancer M, Wagner U. 2016. Untangling two systems of noncrossing curves. Israel Journal of Mathematics. 212(1), 37–79.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[38]
2016 | Published | Journal Article | IST-REx-ID: 1282 | OA
Gundert A, Wagner U. 2016. On eigenvalues of random complexes. Israel Journal of Mathematics. 216(2), 545–582.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[37]
2015 | Published | Conference Paper | IST-REx-ID: 1512 | OA
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.
[Submitted Version] View | Files available | DOI
 
[36]
2015 | Published | Conference Paper | IST-REx-ID: 1511 | OA
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.
[Published Version] View | Files available | DOI
 
[35]
2015 | Draft | Preprint | IST-REx-ID: 8183 | OA
Avvakumov S, Mabillard I, Skopenkov A, Wagner U. Eliminating higher-multiplicity intersections, III. Codimension 2. arXiv, 1511.03501.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[34]
2014 | Published | Conference Paper | IST-REx-ID: 2159 | OA
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.
[Submitted Version] View | Files available | DOI
 
[33]
2014 | Published | Journal Article | IST-REx-ID: 2154 | OA
Matoušek J, Wagner U. 2014. On Gromov’s method of selecting heavily covered points. Discrete & Computational Geometry. 52(1), 1–33.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | arXiv
 
[32]
2014 | Published | Conference Paper | IST-REx-ID: 2157 | OA
Matoušek 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.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | arXiv
 
[31]
2014 | Published | Journal Article | IST-REx-ID: 2184 | OA
Čadek M, Krcál M, Matoušek J, Sergeraert F, Vokřínek L, Wagner U. 2014. Computing all maps into a sphere. Journal of the ACM. 61(3), 17.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[30]
2013 | Published | Conference Paper | IST-REx-ID: 2807 | OA
Čadek M, Krcál M, Matoušek 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.
[Submitted Version] View | Files available | DOI
 
[29]
2013 | Published | Conference Paper | IST-REx-ID: 2244 | OA
Matoušek J, Sedgwick E, Tancer M, Wagner U. 2013. Untangling two systems of noncrossing curves. 8242, 472–483.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[28]
2012 | Published | Journal Article | IST-REx-ID: 2438
Matoušek J, Tancer M, Wagner U. 2012. A geometric proof of the colored Tverberg theorem. Discrete & Computational Geometry. 47(2), 245–265.
View | DOI
 
[27]
2012 | Published | Journal Article | IST-REx-ID: 2439
Chen D, Morin P, Wagner U. 2012. Absolute approximation of Tukey depth: Theory and experiments. Computational Geometry: Theory and Applications. 46(5), 566–573.
View | DOI
 
[26]
2012 | Published | Conference Paper | IST-REx-ID: 2440
Čadek M, Krcál M, Matoušek J, Sergeraert F, Vokřínek L, Wagner U. 2012. Computing all maps into a sphere. SODA: Symposium on Discrete Algorithms, 1–10.
View | Download (ext.)
 
[25]
2012 | Published | Conference Paper | IST-REx-ID: 2441
Gundert A, Wagner U. 2012. On Laplacians of random complexes. SGC: Symposuim on Computational Geometry, 151–160.
View | DOI
 
[24]
2011 | Published | Journal Article | IST-REx-ID: 2436
Matoušek J, Tancer M, Wagner U. 2011. Hardness of embedding simplicial complexes in Rd. Journal of the European Mathematical Society. 13(2), 259–295.
View | DOI
 
[23]
2011 | Published | Conference Paper | IST-REx-ID: 2437
Wagner U. 2011. Minors in random and expanding hypergraphs. SGC: Symposuim on Computational Geometry, 351–360.
View | DOI
 
[22]
2010 | Published | Journal Article | IST-REx-ID: 2435
Nevo E, Wagner U. 2010. On the embeddability of skeleta of spheres. Israel Journal of Mathematics. 174(1), 381–402.
View | DOI
 
[21]
2009 | Published | Conference Paper | IST-REx-ID: 2433 | OA
Matoušek J, Tancer M, Wagner U. 2009. Hardness of embedding simplicial complexes in ℝd. SODA: Symposium on Discrete Algorithms, 855–864.
View | Download (ext.)
 
[20]
2009 | Published | Journal Article | IST-REx-ID: 2434
Buchin K, Razen A, Uno T, Wagner U. 2009. Transforming spanning trees: A lower bound. Computational Geometry: Theory and Applications. 42(8), 724–730.
View | DOI
 
[19]
2008 | Published | Book Chapter | IST-REx-ID: 2415
Wagner U. 2008.k-Sets and k-facets. In: Surveys on Discrete and Computational Geometry: Twenty Years Later. Contemporary Mathematics, vol. 453, 443–514.
View | DOI
 
[18]
2008 | Published | Conference Paper | IST-REx-ID: 2432
Smorodinsky S, Sulovský M, Wagner U. 2008. On center regions and balls containing many points. COCOON: Conference on Computing and Combinatorics, LNCS, vol. 5092, 363–373.
View | DOI
 
[17]
2006 | Published | Book Chapter | IST-REx-ID: 2416
Bang Jensen J, Reed B, Schacht B, Šámal R, Toft B, Wagner U. 2006.On six problems posed by Jarik Nešetřil. In: Topics in Discrete Mathematics. Algorithms and Combinatorics, vol. 26, 613–627.
View | DOI
 
[16]
2006 | Published | Journal Article | IST-REx-ID: 2429
Matoušek J, Sharir M, Smorodinsky S, Wagner U. 2006. K-sets in four dimensions. Discrete & Computational Geometry. 35(2), 177–191.
View | DOI
 
[15]
2006 | Published | Journal Article | IST-REx-ID: 2430
Chent K, Fiat A, Kaplan H, Levy M, Matoušek J, Mossel E, Pach J, Sharir M, Smorodinsky S, Wagner U, Welzl E. 2006. Online conflict-free coloring for intervals. SIAM Journal on Computing. 36(5), 1342–1359.
View | DOI
 
[14]
2006 | Published | Conference Paper | IST-REx-ID: 2431
Wagner U. 2006. On a geometric generalization of the Upper Bound Theorem. FOCS: Foundations of Computer Science, IEEE Conference Proceedings, , 635–645.
View | DOI
 
[13]
2005 | Published | Journal Article | IST-REx-ID: 2427
Ambühl C, Wagner U. 2005. The Clique problem in intersection graphs of ellipses and triangles. Theory of Computing Systems. 38(3), 279–292.
View | DOI
 
[12]
2005 | Published | Conference Paper | IST-REx-ID: 2428
Fiat A, Levy M, Matoušek J, Pach E, Sharir M, Smorodinsky S, Wagner U, Welzl E. 2005. Online conflict-free coloring for intervals. SODA: Symposium on Discrete Algorithms, 545–554.
View | DOI
 
[11]
2004 | Published | Book Chapter | IST-REx-ID: 2417
Lovász L, Vesztergombi K, Wagner U, Welzl E. 2004.Convex quadrilaterals and k-sets . In: Towards a Theory of Geometric Graphs. Contemporary Mathematics , vol. 342, 139–148.
View | DOI
 
[10]
2004 | Published | Journal Article | IST-REx-ID: 2425
Matoušek J, Wagner U. 2004. New constructions of weak ε-nets. Discrete & Computational Geometry. 32(2), 195–206.
View | DOI
 
[9]
2004 | Published | Journal Article | IST-REx-ID: 2426
Giesen J, Wagner U. 2004. Shape dimension and intrinsic metric from samples of manifolds. Discrete & Computational Geometry. 32(2), 245–267.
View | DOI
 
[8]
2003 | Published | Thesis | IST-REx-ID: 2414
Wagner U. 2003. On k-Sets and Their Applications. ETH Zurich.
View | DOI
 
[7]
2003 | Published | Conference Paper | IST-REx-ID: 2422
Wagner U. 2003. On the rectilinear crossing number of complete graphs. SODA: Symposium on Discrete Algorithms, 583–588.
View | Download (ext.)
 
[6]
2003 | Published | Conference Paper | IST-REx-ID: 2423
Matoušek J, Wagner U. 2003. New constructions of weak epsilon-nets. SoCG: Symposium on Computational Geometry, 129–135.
View | DOI
 
[5]
2003 | Published | Conference Paper | IST-REx-ID: 2424
Giesen J, Wagner U. 2003. Shape dimension and intrinsic metric from samples of manifolds with high co-dimension. SoCG: Symposium on Computational Geometry, 329–337.
View | DOI
 
[4]
2002 | Published | Journal Article | IST-REx-ID: 2420
Wagner U. 2002. On the number of corner cuts. Advances in Applied Mathematics. 29(2), 152–161.
View | DOI
 
[3]
2002 | Published | Conference Paper | IST-REx-ID: 2421
Ambühl C, Wagner U. 2002. On the Clique problem in intersection graphs of ellipses. Proceedings of the 13th International Symposium on Algorithms and Computation. ISAAC: International Symposium on Algorithms and Computation, LNCS, vol. 2518, 489–500.
View | DOI
 
[2]
2001 | Published | Journal Article | IST-REx-ID: 2419
Wagner U, Welzl E. 2001. A continuous analogue of the Upper Bound Theorem. Discrete & Computational Geometry. 26(2), 205–219.
View | DOI
 
[1]
2000 | Published | Conference Paper | IST-REx-ID: 2418
Wagner U, Welzl E. 2000. Origin-embracing distributions or a continuous analogue of the Upper Bound Theorem. Proceedings of the 16th annual symposium on Computational geometry. SCG: Symposium on Computational Geometry, 50–56.
View | DOI
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: ISTA Annual Report

Export / Embed