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 |
Matoušek, Jiří, and Uli Wagner. “On Gromov’s Method of Selecting Heavily Covered Points.” Discrete & Computational Geometry. Springer, 2014. https://doi.org/10.1007/s00454-014-9584-7.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
| arXiv
earlier version | 2014 |
Published |
Conference Paper |
IST-REx-ID: 2157 |
Matoušek, Jiří, Eric Sedgwick, Martin Tancer, and Uli Wagner. “Embeddability in the 3 Sphere Is Decidable.” In Proceedings of the Annual Symposium on Computational Geometry, 78–84. ACM, 2014. https://doi.org/10.1145/2582112.2582137.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| arXiv
2014 |
Published |
Conference Paper |
IST-REx-ID: 2159 |
Mabillard, Isaac, and Uli Wagner. “Eliminating Tverberg Points, I. An Analogue of the Whitney Trick.” In Proceedings of the Annual Symposium on Computational Geometry, 171–80. ACM, 2014. https://doi.org/10.1145/2582112.2582134.
[Submitted Version]
View
| Files available
| DOI
earlier version | 2013 |
Published |
Conference Paper |
IST-REx-ID: 2244 |
Matoušek, Jiří, Eric Sedgwick, Martin Tancer, and Uli Wagner. “Untangling Two Systems of Noncrossing Curves.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-319-03841-4_41.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2013 |
Published |
Conference Paper |
IST-REx-ID: 2807 |
Čadek, Martin, Marek Krcál, Jiří Matoušek, Lukáš Vokřínek, and Uli Wagner. “Extending Continuous Maps: Polynomiality and Undecidability.” In 45th Annual ACM Symposium on Theory of Computing, 595–604. ACM, 2013. https://doi.org/10.1145/2488608.2488683.
[Submitted Version]
View
| Files available
| DOI