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
2015 | Published | Book Chapter | IST-REx-ID: 1596 | 
R. Fulek and R. Radoičić, “Vertical visibility among parallel polygons in three dimensions,” in Graph Drawing and Network Visualization, vol. 9411, Springer Nature, 2015, pp. 373–379.
[Submitted Version]
View
| Files available
| DOI
2015 | Published | Journal Article | IST-REx-ID: 1642 |
R. Fulek, J. Kynčl, I. Malinovič, and D. Pálvölgyi, “Clustered planarity testing revisited,” Electronic Journal of Combinatorics, vol. 22, no. 4. Electronic Journal of Combinatorics, 2015.
[Published Version]
View
| Files available
| DOI
| arXiv
2015 | Published | Journal Article | IST-REx-ID: 1682 |
P. Franek and M. Krcál, “Robust satisfiability of systems of equations,” Journal of the ACM, vol. 62, no. 4. ACM, 2015.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2015 | Published | Conference Paper | IST-REx-ID: 1685 |
V. Cohen Addad and A. N. de Mesmay, “A fixed parameter tractable approximation scheme for the optimal cut graph of a surface,” presented at the ESA: European Symposium on Algorithms, Patras, Greece, 2015, vol. 9294, pp. 386–398.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2015 | Published | Journal Article | IST-REx-ID: 1688 |
R. Karasev, J. Kynčl, P. Paták, Z. Patakova, and M. Tancer, “Bounds for Pach’s selection theorem and for the minimum solid angle in a simplex,” Discrete & Computational Geometry, vol. 54, no. 3. Springer, pp. 610–636, 2015.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2015 | Published | Journal Article | IST-REx-ID: 1730 |
É. Colin De Verdière, A. Hubard, and A. N. de Mesmay, “Discrete systolic inequalities and decompositions of triangulated surfaces,” Discrete & Computational Geometry, vol. 53, no. 3. Springer, pp. 587–620, 2015.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2014 | Draft | Working Paper | IST-REx-ID: 7038 |
K. Huszár and M. Rolinek, Playful Math - An introduction to mathematical games. IST Austria.
[Published Version]
View
| Files available
2014 | Published | Journal Article | IST-REx-ID: 1842 |
J. Cibulka, P. Gao, M. Krcál, T. Valla, and P. Valtr, “On the geometric ramsey number of outerplanar graphs,” Discrete & Computational Geometry, vol. 53, no. 1. Springer, pp. 64–79, 2014.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2014 | Published | Journal Article | IST-REx-ID: 2154 |
J. Matoušek and U. Wagner, “On Gromov’s method of selecting heavily covered points,” Discrete & Computational Geometry, vol. 52, no. 1. Springer, pp. 1–33, 2014.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2014 | Published | Conference Paper | IST-REx-ID: 2157 |
J. Matoušek, E. Sedgwick, M. Tancer, and U. Wagner, “Embeddability in the 3 sphere is decidable,” in Proceedings of the Annual Symposium on Computational Geometry, Kyoto, Japan, 2014, pp. 78–84.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
2014 | Published | Conference Paper | IST-REx-ID: 2159 |
I. Mabillard and U. Wagner, “Eliminating Tverberg points, I. An analogue of the Whitney trick,” in Proceedings of the Annual Symposium on Computational Geometry, Kyoto, Japan, 2014, pp. 171–180.
[Submitted Version]
View
| Files available
| DOI
2014 | Published | Journal Article | IST-REx-ID: 2184 |
M. Čadek, M. Krcál, J. Matoušek, F. Sergeraert, L. Vokřínek, and U. Wagner, “Computing all maps into a sphere,” Journal of the ACM, vol. 61, no. 3. ACM, 2014.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2014 | Published | Conference Paper | IST-REx-ID: 10793
R. Fulek, J. Kynčl, I. Malinović, and D. Pálvölgyi, “Clustered planarity testing revisited,” in International Symposium on Graph Drawing, 2014, vol. 8871, pp. 428–436.
[Preprint]
View
| Files available
| DOI
| arXiv
2013 | Published | Conference Paper | IST-REx-ID: 2807 |
M. Čadek, M. Krcál, J. Matoušek, L. Vokřínek, and U. Wagner, “Extending continuous maps: Polynomiality and undecidability,” in 45th Annual ACM Symposium on theory of computing, Palo Alto, CA, United States, 2013, pp. 595–604.
[Submitted Version]
View
| Files available
| DOI
2013 | Published | Conference Paper | IST-REx-ID: 2244 |
J. Matoušek, E. Sedgwick, M. Tancer, and U. Wagner, “Untangling two systems of noncrossing curves,” vol. 8242. Springer, pp. 472–483, 2013.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv