Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

145 Publications


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.) | WoS | arXiv
 

earlier version | 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
 

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
 

earlier version | 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
 

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
 

Filters and Search Terms

department=UlWa

Search

Filter Publications

Display / Sort

Citation Style: ISTA Annual Report

Export / Embed