Filakovský, M., Nakajima, T. V., Oprsal, 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 
LibreCat: https://research-explorer.ista.ac.at/record/15168
DOI: 10.4230/LIPIcs.STACS.2024.34
arXiv: 2312.12981

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 
LibreCat: https://research-explorer.ista.ac.at/record/13974
DOI: 10.1007/s00454-023-00532-x
WoS: 001038546500001
arXiv: 1812.04911

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 
LibreCat: https://research-explorer.ista.ac.at/record/14445
DOI: 10.1007/s11856-023-2521-9
WoS: 001081646400010

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 
LibreCat: https://research-explorer.ista.ac.at/record/10776
DOI: 10.1007/s00454-021-00364-7
WoS: 000750681500001
arXiv: 2003.13536

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 
LibreCat: https://research-explorer.ista.ac.at/record/12129
DOI: 10.1007/s00454-022-00436-2
WoS: 000883222200003

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 
LibreCat: https://research-explorer.ista.ac.at/record/14381
DOI: 10.24033/ast.1188

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 
LibreCat: https://research-explorer.ista.ac.at/record/10220
DOI: 10.1007/s11856-021-2216-z
WoS: 000712942100013
arXiv: 1511.03501

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 
LibreCat: https://research-explorer.ista.ac.at/record/7806
DOI: 10.1137/1.9781611975994.47

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 
LibreCat: https://research-explorer.ista.ac.at/record/7992
DOI: 10.4230/LIPIcs.SoCG.2020.62
arXiv: 2003.13536

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 
LibreCat: https://research-explorer.ista.ac.at/record/7990
DOI: 10.4230/LIPIcs.SoCG.2020.67
arXiv: 2003.13557

Wagner, U., &; Welzl, E. (2020). Connectivity of triangulation flip graphs in the plane (Part I: Edge flips). 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 
LibreCat: https://research-explorer.ista.ac.at/record/7807
DOI: 10.1137/1.9781611975994.172
arXiv: 2003.13557

Avvakumov, S., Wagner, U., Mabillard, I., &; Skopenkov, A. B. (2020). Eliminating higher-multiplicity intersections, III. Codimension 2. Russian Mathematical Surveys. IOP Publishing.https://doi.org/10.1070/RM9943 
LibreCat: https://research-explorer.ista.ac.at/record/9308
DOI: 10.1070/RM9943
WoS: 000625983100001
arXiv: 1511.03501

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 
LibreCat: https://research-explorer.ista.ac.at/record/7108
DOI: 10.1145/3314024
WoS: 000495406300007
arXiv: 1711.08436

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 
LibreCat: https://research-explorer.ista.ac.at/record/5986
DOI: 10.1007/s00454-018-0035-8
WoS: 000466130000009
arXiv: 1710.02741

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

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 
LibreCat: https://research-explorer.ista.ac.at/record/6647
DOI: 10.4230/LIPICS.SOCG.2019.38
arXiv: 1812.04911

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 
LibreCat: https://research-explorer.ista.ac.at/record/184
DOI: 10.4230/LIPIcs.SoCG.2018.41

Huszár, K., Spreer, J., &; Wagner, U. (2018). On the treewidth of triangulated 3-manifolds (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 
LibreCat: https://research-explorer.ista.ac.at/record/285
DOI: 10.4230/LIPIcs.SoCG.2018.46
arXiv: 1712.00434

Filakovský, M., Franek, P., Wagner, U., &; Zhechev, 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 
LibreCat: https://research-explorer.ista.ac.at/record/6774
DOI: 10.1007/s41468-018-0021-5

Matousek, 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 
LibreCat: https://research-explorer.ista.ac.at/record/425
DOI: 10.1145/3078632
WoS: 000425685900006
arXiv: 1402.0815

Dotterrer, D., Kaufman, T., &; Wagner, U. (2018). On expansion and topological overlap. Geometriae Dedicata. Springer.https://doi.org/10.1007/s10711-017-0291-4 
LibreCat: https://research-explorer.ista.ac.at/record/742
DOI: 10.1007/s10711-017-0291-4
WoS: 000437122700017

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 
LibreCat: https://research-explorer.ista.ac.at/record/534
DOI: 10.1007/s00454-017-9900-0
arXiv: 1602.07907

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 
LibreCat: https://research-explorer.ista.ac.at/record/610
DOI: 10.1007/s11856-017-1607-7

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 
LibreCat: https://research-explorer.ista.ac.at/record/683
DOI: 10.4230/LIPIcs.SoCG.2017.49

Goaoc, X., Paták, P., Patakova, Z., Tancer, M., &; Wagner, U. (2017). Bounding helly numbers via betti numbers. In M. Loebl, J. Nesetil, &; 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 
LibreCat: https://research-explorer.ista.ac.at/record/424
DOI: 10.1007/978-3-319-44479-6_17

Gundert, A., &; Wagner, U. (2016). On eigenvalues of random complexes. Israel Journal of Mathematics. Springer.https://doi.org/10.1007/s11856-016-1419-1 
LibreCat: https://research-explorer.ista.ac.at/record/1282
DOI: 10.1007/s11856-016-1419-1

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 
LibreCat: https://research-explorer.ista.ac.at/record/1381
DOI: 10.4230/LIPIcs.SoCG.2016.51

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 
LibreCat: https://research-explorer.ista.ac.at/record/1523
DOI: 10.1090/proc/12824

Matousek, 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 
LibreCat: https://research-explorer.ista.ac.at/record/1411
DOI: 10.1007/s11856-016-1294-9

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 
LibreCat: https://research-explorer.ista.ac.at/record/1379
DOI: 10.4230/LIPIcs.SoCG.2016.24

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 
LibreCat: https://research-explorer.ista.ac.at/record/1378
DOI: 10.4230/LIPIcs.SoCG.2016.35

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 
LibreCat: https://research-explorer.ista.ac.at/record/1511
DOI: 10.4230/LIPIcs.SOCG.2015.476

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

Goaoc, X., Paták, P., Patakova, Z., Tancer, M., &; Wagner, U. (2015). Bounding Helly numbers via Betti numbers (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 
LibreCat: https://research-explorer.ista.ac.at/record/1512
DOI: 10.4230/LIPIcs.SOCG.2015.507

Matousek, 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 
LibreCat: https://research-explorer.ista.ac.at/record/2154
DOI: 10.1007/s00454-014-9584-7

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

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 
LibreCat: https://research-explorer.ista.ac.at/record/2159
DOI: 10.1145/2582112.2582134

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

Matousek, J., Sedgwick, E., Tancer, M., &; Wagner, U. (2013). Untangling two systems of noncrossing curves. Presented at the GD: Graph Drawing and Network Visualization, Bordeaux, France: Springer.https://doi.org/10.1007/978-3-319-03841-4_41 
LibreCat: https://research-explorer.ista.ac.at/record/2244
DOI: 10.1007/978-3-319-03841-4_41
arXiv: 1302.6475

cadek, M., Krcál, M., Matousek, J., Vokínek, L., &; Wagner, U. (2013). Extending continuous maps: Polynomiality and undecidability. 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 
LibreCat: https://research-explorer.ista.ac.at/record/2807
DOI: 10.1145/2488608.2488683

cadek, M., Krcál, M., Matousek, 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.
LibreCat: https://research-explorer.ista.ac.at/record/2440

Matousek, 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 
LibreCat: https://research-explorer.ista.ac.at/record/2438
DOI: 10.1007/s00454-011-9368-2

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 
LibreCat: https://research-explorer.ista.ac.at/record/2439
DOI: 10.1016/j.comgeo.2012.03.001

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 
LibreCat: https://research-explorer.ista.ac.at/record/2441
DOI: 10.1145/2261250.2261272

Matousek, 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 
LibreCat: https://research-explorer.ista.ac.at/record/2436
DOI: 10.4171/JEMS/252

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 
LibreCat: https://research-explorer.ista.ac.at/record/2437
DOI: 10.1145/1998196.1998256

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 
LibreCat: https://research-explorer.ista.ac.at/record/2435
DOI: 10.1007/s11856-009-0119-5

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 
LibreCat: https://research-explorer.ista.ac.at/record/2434
DOI: 10.1016/j.comgeo.2008.03.005

Matousek, J., Tancer, M., &; Wagner, U. (2009). Hardness of embedding simplicial complexes in dd (pp. 855–864). Presented at the SODA: Symposium on Discrete Algorithms, SIAM.
LibreCat: https://research-explorer.ista.ac.at/record/2433

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 
LibreCat: https://research-explorer.ista.ac.at/record/2415
DOI: 10.1090/conm/453

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 
LibreCat: https://research-explorer.ista.ac.at/record/2432
DOI: 10.1007/978-3-540-69733-6_36

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

Chent, K., Fiat, A., Kaplan, H., Levy, M., Matousek, J., Mossel, E.,https://doi.org/10.1137/S0097539704446682__Welzl, E. (2006). Online conflict-free coloring for intervals. SIAM Journal on Computing. SIAM.https://doi.org/10.1137/S0097539704446682 
LibreCat: https://research-explorer.ista.ac.at/record/2430
DOI: 10.1137/S0097539704446682

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 
LibreCat: https://research-explorer.ista.ac.at/record/2431
DOI: 10.1109/FOCS.2006.53

Matousek, 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 
LibreCat: https://research-explorer.ista.ac.at/record/2429
DOI: 10.1007/s00454-005-1200-4

Fiat, A., Levy, M., Matousek, J., Pach, E., Sharir, M., Smorodinsky, S.,https://doi.org/10.1137/S0097539704446682__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 
LibreCat: https://research-explorer.ista.ac.at/record/2428
DOI: 10.1137/S0097539704446682

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 
LibreCat: https://research-explorer.ista.ac.at/record/2427
DOI: 10.1007/s00224-005-1141-6

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 
LibreCat: https://research-explorer.ista.ac.at/record/2417
DOI: 10.1090/conm/342

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 
LibreCat: https://research-explorer.ista.ac.at/record/2426
DOI: 10.1007/s00454-004-1120-8

Matousek, J., &; Wagner, U. (2004). New constructions of weak ;5-nets. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/s00454-004-1116-4 
LibreCat: https://research-explorer.ista.ac.at/record/2425
DOI: 10.1007/s00454-004-1116-4

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

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 
LibreCat: https://research-explorer.ista.ac.at/record/2424
DOI: 10.1145/777792.777841

Matousek, 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 
LibreCat: https://research-explorer.ista.ac.at/record/2423
DOI: 10.1145/777792.777813

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

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 
LibreCat: https://research-explorer.ista.ac.at/record/2421
DOI: 10.1007/3-540-36136-7_43

Wagner, U. (2002). On the number of corner cuts. Advances in Applied Mathematics. ACM.https://doi.org/10.1016/S0196-8858(02)00014-3 
LibreCat: https://research-explorer.ista.ac.at/record/2420
DOI: 10.1016/S0196-8858(02)00014-3

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 
LibreCat: https://research-explorer.ista.ac.at/record/2419
DOI: 10.1007/s00454-001-0028-9

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 
LibreCat: https://research-explorer.ista.ac.at/record/2418
DOI: 10.1145/336154.336176