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.
125 Publications
2014 | Published | Conference Paper | IST-REx-ID: 2159 | 
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
2014 | Published | Journal Article | IST-REx-ID: 2184 |
Č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.)
2014 | Published | Conference Paper | IST-REx-ID: 10793
Fulek, R., Kynčl, J., Malinović, I., & Pálvölgyi, D. (2014). Clustered planarity testing revisited. In International Symposium on Graph Drawing (Vol. 8871, pp. 428–436). Cham: Springer Nature. https://doi.org/10.1007/978-3-662-45803-7_36
[Preprint]
View
| Files available
| DOI
| arXiv
2013 | Published | Conference Paper | IST-REx-ID: 2807 |
Č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
2013 | Published | Conference Paper | IST-REx-ID: 2244 |
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