Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
133 Publications
2015 | Published | Conference Paper | IST-REx-ID: 1510 | 
Franek P, Krcál M. 2015. On computability and triviality of well groups. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 34, 842–856.
[Published Version]
View
| Files available
| DOI
2015 | Published | Conference Paper | IST-REx-ID: 1511 |
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. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 34, 476–490.
[Published Version]
View
| Files available
| DOI
2015 | Published | Conference Paper | IST-REx-ID: 1512 |
Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. 2015. Bounding Helly numbers via Betti numbers. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 34, 507–521.
[Submitted Version]
View
| Files available
| DOI
2015 | Published | Book Chapter | IST-REx-ID: 1596 |
Fulek R, Radoičić R. 2015.Vertical visibility among parallel polygons in three dimensions. In: Graph Drawing and Network Visualization. LNCS, vol. 9411, 373–379.
[Submitted Version]
View
| Files available
| DOI
2014 | Published | Conference Paper | IST-REx-ID: 2159 |
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
2014 | Published | Conference Paper | IST-REx-ID: 10793
Fulek R, Kynčl J, Malinović I, Pálvölgyi D. 2014. Clustered planarity testing revisited. International Symposium on Graph Drawing. , LNCS, vol. 8871, 428–436.
[Preprint]
View
| Files available
| DOI
| arXiv
2014 | Published | Journal Article | IST-REx-ID: 1842 |
Cibulka J, Gao P, Krcál M, Valla T, Valtr P. 2014. On the geometric ramsey number of outerplanar graphs. Discrete & Computational Geometry. 53(1), 64–79.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2014 | Published | Journal Article | IST-REx-ID: 2154 |
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.)
2014 | Published | Conference Paper | IST-REx-ID: 2157 |
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.)
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. 61(3), 17.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2014 | Draft | Working Paper | IST-REx-ID: 7038 |
Huszár K, Rolinek M. Playful Math - An introduction to mathematical games, IST Austria, 5p.
[Published Version]
View
| Files available
2013 | Published | Conference Paper | IST-REx-ID: 2244 |
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 |
Č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