Uli Wagner

Wagner Group

68 Publications

Mark all

[68]
2024 | Conference Paper | IST-REx-ID: 15168 | OA
Filakovský, M., Nakajima, T. V., Opršal, J., Tasinato, G., & Wagner, U. (2024). Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs. In 41st International Symposium on Theoretical Aspects of Computer Science (Vol. 289). Clermont-Ferrand, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.STACS.2024.34
[Published Version] View | Files available | DOI | arXiv
 
[67]
2023 | Journal Article | IST-REx-ID: 13974 | OA
Fulek, R., Gärtner, B., Kupavskii, A., Valtr, P., & Wagner, U. (2023). The crossing Tverberg theorem. Discrete and Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-023-00532-x
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[66]
2023 | 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. Springer Nature. https://doi.org/10.1007/s11856-023-2521-9
[Published Version] View | Files available | DOI | WoS
 
[65]
2022 | Journal Article | IST-REx-ID: 10776 | OA
Patakova, Z., Tancer, M., & Wagner, U. (2022). Barycentric cuts through a convex body. Discrete and Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-021-00364-7
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[64]
2022 | Journal Article | IST-REx-ID: 12129 | OA
Wagner, U., & Welzl, E. (2022). Connectivity of triangulation flip graphs in the plane. Discrete & Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-022-00436-2
[Published Version] View | Files available | DOI | WoS
 
[63]
2022 | 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. Societe Mathematique de France. https://doi.org/10.24033/ast.1188
View | DOI
 
[62]
2021 | Journal Article | IST-REx-ID: 10220 | OA
Avvakumov, S., Mabillard, I., Skopenkov, A. B., & Wagner, U. (2021). Eliminating higher-multiplicity intersections. III. Codimension 2. Israel Journal of Mathematics. Springer Nature. https://doi.org/10.1007/s11856-021-2216-z
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[61]
2020 | Conference Paper | IST-REx-ID: 7806 | OA
Filakovský, M., Wagner, U., & Zhechev, S. Y. (2020). Embeddability of simplicial complexes is undecidable. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. 2020–January, pp. 767–785). Salt Lake City, UT, United States: SIAM. https://doi.org/10.1137/1.9781611975994.47
[Published Version] View | DOI | Download Published Version (ext.)
 
[60]
2020 | Conference Paper | IST-REx-ID: 7992 | OA
Patakova, Z., Tancer, M., & Wagner, U. (2020). Barycentric cuts through a convex body. In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.62
[Published Version] View | Files available | DOI | arXiv
 
[59]
2020 | Conference Paper | IST-REx-ID: 7990 | OA
Wagner, U., & Welzl, E. (2020). Connectivity of triangulation flip graphs in the plane (Part II: Bistellar flips). In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.67
[Published Version] View | Files available | DOI | arXiv
 
[58]
2020 | Conference Paper | IST-REx-ID: 7807 | OA
Wagner, U., & Welzl, E. (2020). Connectivity of triangulation flip graphs in the plane (Part I: Edge flips). In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. 2020–January, pp. 2823–2841). Salt Lake City, UT, United States: SIAM. https://doi.org/10.1137/1.9781611975994.172
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | arXiv
 
[57]
2020 | Journal Article | IST-REx-ID: 9308 | OA
Avvakumov, S., Wagner, U., Mabillard, I., & Skopenkov, A. B. (2020). Eliminating higher-multiplicity intersections, III. Codimension 2. Russian Mathematical Surveys. IOP Publishing. https://doi.org/10.1070/RM9943
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[56]
2019 | 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. ACM. https://doi.org/10.1145/3314024
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[55]
2019 | 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. Springer Nature. https://doi.org/10.1007/s00454-018-0035-8
[Published Version] View | Files available | DOI | WoS | arXiv
 
[54]
2019 | 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. Computational Geometry Laborartoy. https://doi.org/10.20382/JOGC.V10I2A5
[Published Version] View | Files available | DOI | arXiv
 
[53]
2019 | Conference Paper | IST-REx-ID: 6647 | OA
Fulek, R., Gärtner, B., Kupavskii, A., Valtr, P., & Wagner, U. (2019). The crossing Tverberg theorem. In 35th International Symposium on Computational Geometry (Vol. 129, p. 38:1-38:13). Portland, OR, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.SOCG.2019.38
[Published Version] View | Files available | DOI | arXiv
 
[52]
2018 | Conference Paper | IST-REx-ID: 184 | OA
Goaoc, X., Paták, P., Patakova, Z., Tancer, M., & Wagner, U. (2018). Shellability is NP-complete (Vol. 99, p. 41:1-41:16). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2018.41
[Published Version] View | Files available | DOI
 
[51]
2018 | Conference Paper | IST-REx-ID: 285 | OA
Huszár, K., Spreer, J., & Wagner, U. (2018). On the treewidth of triangulated 3-manifolds (Vol. 99). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2018.46
[Submitted Version] View | Files available | DOI | arXiv
 
[50]
2018 | Journal Article | IST-REx-ID: 6774 | OA
Filakovský, M., Franek, P., Wagner, U., & Zhechev, S. Y. (2018). Computing simplicial representatives of homotopy group elements. Journal of Applied and Computational Topology. Springer. https://doi.org/10.1007/s41468-018-0021-5
[Published Version] View | Files available | DOI
 
[49]
2018 | 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. ACM. https://doi.org/10.1145/3078632
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[48]
2018 | Journal Article | IST-REx-ID: 742 | OA
Dotterrer, D., Kaufman, T., & Wagner, U. (2018). On expansion and topological overlap. Geometriae Dedicata. Springer. https://doi.org/10.1007/s10711-017-0291-4
[Published Version] View | Files available | DOI | WoS
 
[47]
2017 | Journal Article | IST-REx-ID: 534 | OA
Burton, B., de Mesmay, A. N., & Wagner, U. (2017). Finding non-orientable surfaces in 3-Manifolds. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-017-9900-0
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[46]
2017 | 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. Springer. https://doi.org/10.1007/s11856-017-1607-7
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[45]
2017 | 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 (Vol. 77). Presented at the SoCG: Symposium on Computational Geometry, Brisbane, Australia: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2017.49
[Published Version] View | Files available | DOI
 
[44]
2017 | 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 M. Loebl, J. Nešetřil, & R. Thomas (Eds.), A Journey through Discrete Mathematics: A Tribute to Jiri Matousek (pp. 407–447). Springer. https://doi.org/10.1007/978-3-319-44479-6_17
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[43]
2016 | Journal Article | IST-REx-ID: 1282 | OA
Gundert, A., & Wagner, U. (2016). On eigenvalues of random complexes. Israel Journal of Mathematics. Springer. https://doi.org/10.1007/s11856-016-1419-1
[Preprint] View | DOI | Download Preprint (ext.)
 
[42]
2016 | 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 (Vol. 51, p. 51.1-51.12). Presented at the SoCG: Symposium on Computational Geometry, Medford, MA, USA: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH. https://doi.org/10.4230/LIPIcs.SoCG.2016.51
[Published Version] View | Files available | DOI
 
[41]
2016 | 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. American Mathematical Society. https://doi.org/10.1090/proc/12824
[Preprint] View | DOI | Download Preprint (ext.)
 
[40]
2016 | 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. Springer. https://doi.org/10.1007/s11856-016-1294-9
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[39]
2016 | Conference Paper | IST-REx-ID: 1379 | OA
Burton, B., de Mesmay, A. N., & Wagner, U. (2016). Finding non-orientable surfaces in 3-manifolds (Vol. 51, p. 24.1-24.15). Presented at the SoCG: Symposium on Computational Geometry, Medford, MA, USA: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SoCG.2016.24
[Published Version] View | Files available | DOI
 
[38]
2016 | Conference Paper | IST-REx-ID: 1378 | OA
Dotterrer, D., Kaufman, T., & Wagner, U. (2016). On expansion and topological overlap (Vol. 51, p. 35.1-35.10). Presented at the SoCG: Symposium on Computational Geometry, Medford, MA, USA: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SoCG.2016.35
[Published Version] View | Files available | DOI
 
[37]
2015 | 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 (Vol. 34, pp. 476–490). Presented at the SoCG: Symposium on Computational Geometry, Eindhoven, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SOCG.2015.476
[Published Version] View | Files available | DOI
 
[36]
2015 | Preprint | IST-REx-ID: 8183 | OA
Avvakumov, S., Mabillard, I., Skopenkov, A., & Wagner, U. (n.d.). Eliminating higher-multiplicity intersections, III. Codimension 2. arXiv.
[Preprint] View | Files available | Download Preprint (ext.) | arXiv
 
[35]
2015 | 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 (Vol. 34, pp. 507–521). Presented at the SoCG: Symposium on Computational Geometry, Eindhoven, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SOCG.2015.507
[Submitted Version] View | Files available | DOI
 
[34]
2014 | 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. Springer. https://doi.org/10.1007/s00454-014-9584-7
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[33]
2014 | 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. ACM. https://doi.org/10.1145/2597629
[Preprint] View | DOI | Download Preprint (ext.)
 
[32]
2014 | Conference Paper | IST-REx-ID: 2159 | OA
Mabillard, I., & Wagner, U. (2014). Eliminating Tverberg points, I. An analogue of the Whitney trick. In Proceedings of the Annual Symposium on Computational Geometry (pp. 171–180). Kyoto, Japan: ACM. https://doi.org/10.1145/2582112.2582134
[Submitted Version] View | Files available | DOI
 
[31]
2014 | Conference Paper | IST-REx-ID: 2157 | OA
Matoušek, J., Sedgwick, E., Tancer, M., & Wagner, U. (2014). Embeddability in the 3 sphere is decidable. In Proceedings of the Annual Symposium on Computational Geometry (pp. 78–84). Kyoto, Japan: ACM. https://doi.org/10.1145/2582112.2582137
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
[30]
2013 | Conference Paper | IST-REx-ID: 2244 | OA
Matoušek, J., Sedgwick, E., Tancer, M., & Wagner, U. (2013). Untangling two systems of noncrossing curves. Presented at the GD: Graph Drawing and Network Visualization, Bordeaux, France: Springer. https://doi.org/10.1007/978-3-319-03841-4_41
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[29]
2013 | 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. In 45th Annual ACM Symposium on theory of computing (pp. 595–604). Palo Alto, CA, United States: ACM. https://doi.org/10.1145/2488608.2488683
[Submitted Version] View | Files available | DOI
 
[28]
2012 | 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 (pp. 1–10). Presented at the SODA: Symposium on Discrete Algorithms, SIAM.
View | Download (ext.)
 
[27]
2012 | 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. Springer. https://doi.org/10.1007/s00454-011-9368-2
View | DOI
 
[26]
2012 | 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. Elsevier. https://doi.org/10.1016/j.comgeo.2012.03.001
View | DOI
 
[25]
2012 | Conference Paper | IST-REx-ID: 2441
Gundert, A., & Wagner, U. (2012). On Laplacians of random complexes (pp. 151–160). Presented at the SGC: Symposuim on Computational Geometry, ACM. https://doi.org/10.1145/2261250.2261272
View | DOI
 
[24]
2011 | 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. European Mathematical Society. https://doi.org/10.4171/JEMS/252
View | DOI
 
[23]
2011 | Conference Paper | IST-REx-ID: 2437
Wagner, U. (2011). Minors in random and expanding hypergraphs (pp. 351–360). Presented at the SGC: Symposuim on Computational Geometry, ACM. https://doi.org/10.1145/1998196.1998256
View | DOI
 
[22]
2010 | Journal Article | IST-REx-ID: 2435
Nevo, E., & Wagner, U. (2010). On the embeddability of skeleta of spheres. Israel Journal of Mathematics. Springer. https://doi.org/10.1007/s11856-009-0119-5
View | DOI
 
[21]
2009 | 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. Elsevier. https://doi.org/10.1016/j.comgeo.2008.03.005
View | DOI
 
[20]
2009 | Conference Paper | IST-REx-ID: 2433 | OA
Matoušek, J., Tancer, M., & Wagner, U. (2009). Hardness of embedding simplicial complexes in ℝd (pp. 855–864). Presented at the SODA: Symposium on Discrete Algorithms, SIAM.
View | Download (ext.)
 
[19]
2008 | Book Chapter | IST-REx-ID: 2415
Wagner, U. (2008). k-Sets and k-facets. In J. Goodman, J. Pach, & R. Pollack (Eds.), Surveys on Discrete and Computational Geometry: Twenty Years Later (Vol. 453, pp. 443–514). American Mathematical Society. https://doi.org/10.1090/conm/453
View | DOI
 
[18]
2008 | Conference Paper | IST-REx-ID: 2432
Smorodinsky, S., Sulovský, M., & Wagner, U. (2008). On center regions and balls containing many points (Vol. 5092, pp. 363–373). Presented at the COCOON: Conference on Computing and Combinatorics, Springer. https://doi.org/10.1007/978-3-540-69733-6_36
View | DOI
 
[17]
2006 | 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 (Vol. 26, pp. 613–627). Springer. https://doi.org/10.1007/3-540-33700-8_30
View | DOI
 
[16]
2006 | Journal Article | IST-REx-ID: 2430
Chent, K., Fiat, A., Kaplan, H., Levy, M., Matoušek, J., Mossel, E., … Welzl, E. (2006). Online conflict-free coloring for intervals. SIAM Journal on Computing. SIAM. https://doi.org/10.1137/S0097539704446682
View | DOI
 
[15]
2006 | Conference Paper | IST-REx-ID: 2431
Wagner, U. (2006). On a geometric generalization of the Upper Bound Theorem (pp. 635–645). Presented at the FOCS: Foundations of Computer Science, IEEE. https://doi.org/10.1109/FOCS.2006.53
View | DOI
 
[14]
2006 | Journal Article | IST-REx-ID: 2429
Matoušek, J., Sharir, M., Smorodinsky, S., & Wagner, U. (2006). K-sets in four dimensions. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-005-1200-4
View | DOI
 
[13]
2005 | Conference Paper | IST-REx-ID: 2428
Fiat, A., Levy, M., Matoušek, J., Pach, E., Sharir, M., Smorodinsky, S., … Welzl, E. (2005). Online conflict-free coloring for intervals (pp. 545–554). Presented at the SODA: Symposium on Discrete Algorithms, SIAM. https://doi.org/10.1137/S0097539704446682
View | DOI
 
[12]
2005 | 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. Springer. https://doi.org/10.1007/s00224-005-1141-6
View | DOI
 
[11]
2004 | Book Chapter | IST-REx-ID: 2417
Lovász, L., Vesztergombi, K., Wagner, U., & Welzl, E. (2004). Convex quadrilaterals and k-sets . In J. Pach (Ed.), Towards a Theory of Geometric Graphs (Vol. 342, pp. 139–148). American Mathematical Society. https://doi.org/10.1090/conm/342
View | DOI
 
[10]
2004 | Journal Article | IST-REx-ID: 2426
Giesen, J., & Wagner, U. (2004). Shape dimension and intrinsic metric from samples of manifolds. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-004-1120-8
View | DOI
 
[9]
2004 | Journal Article | IST-REx-ID: 2425
Matoušek, J., & Wagner, U. (2004). New constructions of weak ε-nets. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-004-1116-4
View | DOI
 
[8]
2003 | Thesis | IST-REx-ID: 2414
Wagner, U. (2003). On k-Sets and Their Applications. ETH Zurich. https://doi.org/10.3929/ethz-a-004708408
View | DOI
 
[7]
2003 | Conference Paper | IST-REx-ID: 2424
Giesen, J., & Wagner, U. (2003). Shape dimension and intrinsic metric from samples of manifolds with high co-dimension (pp. 329–337). Presented at the SoCG: Symposium on Computational Geometry, ACM. https://doi.org/10.1145/777792.777841
View | DOI
 
[6]
2003 | Conference Paper | IST-REx-ID: 2423
Matoušek, J., & Wagner, U. (2003). New constructions of weak epsilon-nets (pp. 129–135). Presented at the SoCG: Symposium on Computational Geometry, ACM. https://doi.org/10.1145/777792.777813
View | DOI
 
[5]
2003 | Conference Paper | IST-REx-ID: 2422
Wagner, U. (2003). On the rectilinear crossing number of complete graphs (pp. 583–588). Presented at the SODA: Symposium on Discrete Algorithms, SIAM.
View | Download (ext.)
 
[4]
2002 | Conference Paper | IST-REx-ID: 2421
Ambühl, C., & Wagner, U. (2002). On the Clique problem in intersection graphs of ellipses. In Proceedings of the 13th International Symposium on Algorithms and Computation (Vol. 2518, pp. 489–500). Vancouver, Canada: Springer. https://doi.org/10.1007/3-540-36136-7_43
View | DOI
 
[3]
2002 | Journal Article | IST-REx-ID: 2420
Wagner, U. (2002). On the number of corner cuts. Advances in Applied Mathematics. ACM. https://doi.org/10.1016/S0196-8858(02)00014-3
View | DOI
 
[2]
2001 | Journal Article | IST-REx-ID: 2419
Wagner, U., & Welzl, E. (2001). A continuous analogue of the Upper Bound Theorem. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-001-0028-9
View | DOI
 
[1]
2000 | Conference Paper | IST-REx-ID: 2418
Wagner, U., & Welzl, E. (2000). Origin-embracing distributions or a continuous analogue of the Upper Bound Theorem. In Proceedings of the 16th annual symposium on Computational geometry (pp. 50–56). Clear Water Bay Kowloon, Hong Kong: ACM. https://doi.org/10.1145/336154.336176
View | DOI
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: APA

    Export / Embed

68 Publications

Mark all

[68]
2024 | Conference Paper | IST-REx-ID: 15168 | OA
Filakovský, M., Nakajima, T. V., Opršal, J., Tasinato, G., & Wagner, U. (2024). Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs. In 41st International Symposium on Theoretical Aspects of Computer Science (Vol. 289). Clermont-Ferrand, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.STACS.2024.34
[Published Version] View | Files available | DOI | arXiv
 
[67]
2023 | Journal Article | IST-REx-ID: 13974 | OA
Fulek, R., Gärtner, B., Kupavskii, A., Valtr, P., & Wagner, U. (2023). The crossing Tverberg theorem. Discrete and Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-023-00532-x
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[66]
2023 | 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. Springer Nature. https://doi.org/10.1007/s11856-023-2521-9
[Published Version] View | Files available | DOI | WoS
 
[65]
2022 | Journal Article | IST-REx-ID: 10776 | OA
Patakova, Z., Tancer, M., & Wagner, U. (2022). Barycentric cuts through a convex body. Discrete and Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-021-00364-7
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[64]
2022 | Journal Article | IST-REx-ID: 12129 | OA
Wagner, U., & Welzl, E. (2022). Connectivity of triangulation flip graphs in the plane. Discrete & Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-022-00436-2
[Published Version] View | Files available | DOI | WoS
 
[63]
2022 | 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. Societe Mathematique de France. https://doi.org/10.24033/ast.1188
View | DOI
 
[62]
2021 | Journal Article | IST-REx-ID: 10220 | OA
Avvakumov, S., Mabillard, I., Skopenkov, A. B., & Wagner, U. (2021). Eliminating higher-multiplicity intersections. III. Codimension 2. Israel Journal of Mathematics. Springer Nature. https://doi.org/10.1007/s11856-021-2216-z
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[61]
2020 | Conference Paper | IST-REx-ID: 7806 | OA
Filakovský, M., Wagner, U., & Zhechev, S. Y. (2020). Embeddability of simplicial complexes is undecidable. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. 2020–January, pp. 767–785). Salt Lake City, UT, United States: SIAM. https://doi.org/10.1137/1.9781611975994.47
[Published Version] View | DOI | Download Published Version (ext.)
 
[60]
2020 | Conference Paper | IST-REx-ID: 7992 | OA
Patakova, Z., Tancer, M., & Wagner, U. (2020). Barycentric cuts through a convex body. In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.62
[Published Version] View | Files available | DOI | arXiv
 
[59]
2020 | Conference Paper | IST-REx-ID: 7990 | OA
Wagner, U., & Welzl, E. (2020). Connectivity of triangulation flip graphs in the plane (Part II: Bistellar flips). In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.67
[Published Version] View | Files available | DOI | arXiv
 
[58]
2020 | Conference Paper | IST-REx-ID: 7807 | OA
Wagner, U., & Welzl, E. (2020). Connectivity of triangulation flip graphs in the plane (Part I: Edge flips). In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. 2020–January, pp. 2823–2841). Salt Lake City, UT, United States: SIAM. https://doi.org/10.1137/1.9781611975994.172
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | arXiv
 
[57]
2020 | Journal Article | IST-REx-ID: 9308 | OA
Avvakumov, S., Wagner, U., Mabillard, I., & Skopenkov, A. B. (2020). Eliminating higher-multiplicity intersections, III. Codimension 2. Russian Mathematical Surveys. IOP Publishing. https://doi.org/10.1070/RM9943
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[56]
2019 | 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. ACM. https://doi.org/10.1145/3314024
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[55]
2019 | 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. Springer Nature. https://doi.org/10.1007/s00454-018-0035-8
[Published Version] View | Files available | DOI | WoS | arXiv
 
[54]
2019 | 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. Computational Geometry Laborartoy. https://doi.org/10.20382/JOGC.V10I2A5
[Published Version] View | Files available | DOI | arXiv
 
[53]
2019 | Conference Paper | IST-REx-ID: 6647 | OA
Fulek, R., Gärtner, B., Kupavskii, A., Valtr, P., & Wagner, U. (2019). The crossing Tverberg theorem. In 35th International Symposium on Computational Geometry (Vol. 129, p. 38:1-38:13). Portland, OR, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.SOCG.2019.38
[Published Version] View | Files available | DOI | arXiv
 
[52]
2018 | Conference Paper | IST-REx-ID: 184 | OA
Goaoc, X., Paták, P., Patakova, Z., Tancer, M., & Wagner, U. (2018). Shellability is NP-complete (Vol. 99, p. 41:1-41:16). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2018.41
[Published Version] View | Files available | DOI
 
[51]
2018 | Conference Paper | IST-REx-ID: 285 | OA
Huszár, K., Spreer, J., & Wagner, U. (2018). On the treewidth of triangulated 3-manifolds (Vol. 99). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2018.46
[Submitted Version] View | Files available | DOI | arXiv
 
[50]
2018 | Journal Article | IST-REx-ID: 6774 | OA
Filakovský, M., Franek, P., Wagner, U., & Zhechev, S. Y. (2018). Computing simplicial representatives of homotopy group elements. Journal of Applied and Computational Topology. Springer. https://doi.org/10.1007/s41468-018-0021-5
[Published Version] View | Files available | DOI
 
[49]
2018 | 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. ACM. https://doi.org/10.1145/3078632
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[48]
2018 | Journal Article | IST-REx-ID: 742 | OA
Dotterrer, D., Kaufman, T., & Wagner, U. (2018). On expansion and topological overlap. Geometriae Dedicata. Springer. https://doi.org/10.1007/s10711-017-0291-4
[Published Version] View | Files available | DOI | WoS
 
[47]
2017 | Journal Article | IST-REx-ID: 534 | OA
Burton, B., de Mesmay, A. N., & Wagner, U. (2017). Finding non-orientable surfaces in 3-Manifolds. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-017-9900-0
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[46]
2017 | 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. Springer. https://doi.org/10.1007/s11856-017-1607-7
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[45]
2017 | 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 (Vol. 77). Presented at the SoCG: Symposium on Computational Geometry, Brisbane, Australia: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2017.49
[Published Version] View | Files available | DOI
 
[44]
2017 | 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 M. Loebl, J. Nešetřil, & R. Thomas (Eds.), A Journey through Discrete Mathematics: A Tribute to Jiri Matousek (pp. 407–447). Springer. https://doi.org/10.1007/978-3-319-44479-6_17
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[43]
2016 | Journal Article | IST-REx-ID: 1282 | OA
Gundert, A., & Wagner, U. (2016). On eigenvalues of random complexes. Israel Journal of Mathematics. Springer. https://doi.org/10.1007/s11856-016-1419-1
[Preprint] View | DOI | Download Preprint (ext.)
 
[42]
2016 | 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 (Vol. 51, p. 51.1-51.12). Presented at the SoCG: Symposium on Computational Geometry, Medford, MA, USA: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH. https://doi.org/10.4230/LIPIcs.SoCG.2016.51
[Published Version] View | Files available | DOI
 
[41]
2016 | 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. American Mathematical Society. https://doi.org/10.1090/proc/12824
[Preprint] View | DOI | Download Preprint (ext.)
 
[40]
2016 | 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. Springer. https://doi.org/10.1007/s11856-016-1294-9
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[39]
2016 | Conference Paper | IST-REx-ID: 1379 | OA
Burton, B., de Mesmay, A. N., & Wagner, U. (2016). Finding non-orientable surfaces in 3-manifolds (Vol. 51, p. 24.1-24.15). Presented at the SoCG: Symposium on Computational Geometry, Medford, MA, USA: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SoCG.2016.24
[Published Version] View | Files available | DOI
 
[38]
2016 | Conference Paper | IST-REx-ID: 1378 | OA
Dotterrer, D., Kaufman, T., & Wagner, U. (2016). On expansion and topological overlap (Vol. 51, p. 35.1-35.10). Presented at the SoCG: Symposium on Computational Geometry, Medford, MA, USA: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SoCG.2016.35
[Published Version] View | Files available | DOI
 
[37]
2015 | 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 (Vol. 34, pp. 476–490). Presented at the SoCG: Symposium on Computational Geometry, Eindhoven, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SOCG.2015.476
[Published Version] View | Files available | DOI
 
[36]
2015 | Preprint | IST-REx-ID: 8183 | OA
Avvakumov, S., Mabillard, I., Skopenkov, A., & Wagner, U. (n.d.). Eliminating higher-multiplicity intersections, III. Codimension 2. arXiv.
[Preprint] View | Files available | Download Preprint (ext.) | arXiv
 
[35]
2015 | 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 (Vol. 34, pp. 507–521). Presented at the SoCG: Symposium on Computational Geometry, Eindhoven, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SOCG.2015.507
[Submitted Version] View | Files available | DOI
 
[34]
2014 | 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. Springer. https://doi.org/10.1007/s00454-014-9584-7
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[33]
2014 | 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. ACM. https://doi.org/10.1145/2597629
[Preprint] View | DOI | Download Preprint (ext.)
 
[32]
2014 | Conference Paper | IST-REx-ID: 2159 | OA
Mabillard, I., & Wagner, U. (2014). Eliminating Tverberg points, I. An analogue of the Whitney trick. In Proceedings of the Annual Symposium on Computational Geometry (pp. 171–180). Kyoto, Japan: ACM. https://doi.org/10.1145/2582112.2582134
[Submitted Version] View | Files available | DOI
 
[31]
2014 | Conference Paper | IST-REx-ID: 2157 | OA
Matoušek, J., Sedgwick, E., Tancer, M., & Wagner, U. (2014). Embeddability in the 3 sphere is decidable. In Proceedings of the Annual Symposium on Computational Geometry (pp. 78–84). Kyoto, Japan: ACM. https://doi.org/10.1145/2582112.2582137
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
[30]
2013 | Conference Paper | IST-REx-ID: 2244 | OA
Matoušek, J., Sedgwick, E., Tancer, M., & Wagner, U. (2013). Untangling two systems of noncrossing curves. Presented at the GD: Graph Drawing and Network Visualization, Bordeaux, France: Springer. https://doi.org/10.1007/978-3-319-03841-4_41
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[29]
2013 | 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. In 45th Annual ACM Symposium on theory of computing (pp. 595–604). Palo Alto, CA, United States: ACM. https://doi.org/10.1145/2488608.2488683
[Submitted Version] View | Files available | DOI
 
[28]
2012 | 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 (pp. 1–10). Presented at the SODA: Symposium on Discrete Algorithms, SIAM.
View | Download (ext.)
 
[27]
2012 | 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. Springer. https://doi.org/10.1007/s00454-011-9368-2
View | DOI
 
[26]
2012 | 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. Elsevier. https://doi.org/10.1016/j.comgeo.2012.03.001
View | DOI
 
[25]
2012 | Conference Paper | IST-REx-ID: 2441
Gundert, A., & Wagner, U. (2012). On Laplacians of random complexes (pp. 151–160). Presented at the SGC: Symposuim on Computational Geometry, ACM. https://doi.org/10.1145/2261250.2261272
View | DOI
 
[24]
2011 | 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. European Mathematical Society. https://doi.org/10.4171/JEMS/252
View | DOI
 
[23]
2011 | Conference Paper | IST-REx-ID: 2437
Wagner, U. (2011). Minors in random and expanding hypergraphs (pp. 351–360). Presented at the SGC: Symposuim on Computational Geometry, ACM. https://doi.org/10.1145/1998196.1998256
View | DOI
 
[22]
2010 | Journal Article | IST-REx-ID: 2435
Nevo, E., & Wagner, U. (2010). On the embeddability of skeleta of spheres. Israel Journal of Mathematics. Springer. https://doi.org/10.1007/s11856-009-0119-5
View | DOI
 
[21]
2009 | 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. Elsevier. https://doi.org/10.1016/j.comgeo.2008.03.005
View | DOI
 
[20]
2009 | Conference Paper | IST-REx-ID: 2433 | OA
Matoušek, J., Tancer, M., & Wagner, U. (2009). Hardness of embedding simplicial complexes in ℝd (pp. 855–864). Presented at the SODA: Symposium on Discrete Algorithms, SIAM.
View | Download (ext.)
 
[19]
2008 | Book Chapter | IST-REx-ID: 2415
Wagner, U. (2008). k-Sets and k-facets. In J. Goodman, J. Pach, & R. Pollack (Eds.), Surveys on Discrete and Computational Geometry: Twenty Years Later (Vol. 453, pp. 443–514). American Mathematical Society. https://doi.org/10.1090/conm/453
View | DOI
 
[18]
2008 | Conference Paper | IST-REx-ID: 2432
Smorodinsky, S., Sulovský, M., & Wagner, U. (2008). On center regions and balls containing many points (Vol. 5092, pp. 363–373). Presented at the COCOON: Conference on Computing and Combinatorics, Springer. https://doi.org/10.1007/978-3-540-69733-6_36
View | DOI
 
[17]
2006 | 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 (Vol. 26, pp. 613–627). Springer. https://doi.org/10.1007/3-540-33700-8_30
View | DOI
 
[16]
2006 | Journal Article | IST-REx-ID: 2430
Chent, K., Fiat, A., Kaplan, H., Levy, M., Matoušek, J., Mossel, E., … Welzl, E. (2006). Online conflict-free coloring for intervals. SIAM Journal on Computing. SIAM. https://doi.org/10.1137/S0097539704446682
View | DOI
 
[15]
2006 | Conference Paper | IST-REx-ID: 2431
Wagner, U. (2006). On a geometric generalization of the Upper Bound Theorem (pp. 635–645). Presented at the FOCS: Foundations of Computer Science, IEEE. https://doi.org/10.1109/FOCS.2006.53
View | DOI
 
[14]
2006 | Journal Article | IST-REx-ID: 2429
Matoušek, J., Sharir, M., Smorodinsky, S., & Wagner, U. (2006). K-sets in four dimensions. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-005-1200-4
View | DOI
 
[13]
2005 | Conference Paper | IST-REx-ID: 2428
Fiat, A., Levy, M., Matoušek, J., Pach, E., Sharir, M., Smorodinsky, S., … Welzl, E. (2005). Online conflict-free coloring for intervals (pp. 545–554). Presented at the SODA: Symposium on Discrete Algorithms, SIAM. https://doi.org/10.1137/S0097539704446682
View | DOI
 
[12]
2005 | 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. Springer. https://doi.org/10.1007/s00224-005-1141-6
View | DOI
 
[11]
2004 | Book Chapter | IST-REx-ID: 2417
Lovász, L., Vesztergombi, K., Wagner, U., & Welzl, E. (2004). Convex quadrilaterals and k-sets . In J. Pach (Ed.), Towards a Theory of Geometric Graphs (Vol. 342, pp. 139–148). American Mathematical Society. https://doi.org/10.1090/conm/342
View | DOI
 
[10]
2004 | Journal Article | IST-REx-ID: 2426
Giesen, J., & Wagner, U. (2004). Shape dimension and intrinsic metric from samples of manifolds. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-004-1120-8
View | DOI
 
[9]
2004 | Journal Article | IST-REx-ID: 2425
Matoušek, J., & Wagner, U. (2004). New constructions of weak ε-nets. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-004-1116-4
View | DOI
 
[8]
2003 | Thesis | IST-REx-ID: 2414
Wagner, U. (2003). On k-Sets and Their Applications. ETH Zurich. https://doi.org/10.3929/ethz-a-004708408
View | DOI
 
[7]
2003 | Conference Paper | IST-REx-ID: 2424
Giesen, J., & Wagner, U. (2003). Shape dimension and intrinsic metric from samples of manifolds with high co-dimension (pp. 329–337). Presented at the SoCG: Symposium on Computational Geometry, ACM. https://doi.org/10.1145/777792.777841
View | DOI
 
[6]
2003 | Conference Paper | IST-REx-ID: 2423
Matoušek, J., & Wagner, U. (2003). New constructions of weak epsilon-nets (pp. 129–135). Presented at the SoCG: Symposium on Computational Geometry, ACM. https://doi.org/10.1145/777792.777813
View | DOI
 
[5]
2003 | Conference Paper | IST-REx-ID: 2422
Wagner, U. (2003). On the rectilinear crossing number of complete graphs (pp. 583–588). Presented at the SODA: Symposium on Discrete Algorithms, SIAM.
View | Download (ext.)
 
[4]
2002 | Conference Paper | IST-REx-ID: 2421
Ambühl, C., & Wagner, U. (2002). On the Clique problem in intersection graphs of ellipses. In Proceedings of the 13th International Symposium on Algorithms and Computation (Vol. 2518, pp. 489–500). Vancouver, Canada: Springer. https://doi.org/10.1007/3-540-36136-7_43
View | DOI
 
[3]
2002 | Journal Article | IST-REx-ID: 2420
Wagner, U. (2002). On the number of corner cuts. Advances in Applied Mathematics. ACM. https://doi.org/10.1016/S0196-8858(02)00014-3
View | DOI
 
[2]
2001 | Journal Article | IST-REx-ID: 2419
Wagner, U., & Welzl, E. (2001). A continuous analogue of the Upper Bound Theorem. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-001-0028-9
View | DOI
 
[1]
2000 | Conference Paper | IST-REx-ID: 2418
Wagner, U., & Welzl, E. (2000). Origin-embracing distributions or a continuous analogue of the Upper Bound Theorem. In Proceedings of the 16th annual symposium on Computational geometry (pp. 50–56). Clear Water Bay Kowloon, Hong Kong: ACM. https://doi.org/10.1145/336154.336176
View | DOI
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: APA

    Export / Embed