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.




146 Publications

earlier version | 2014 | Published | Conference Paper | IST-REx-ID: 10793 | OA
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 | Download Preprint (ext.) | arXiv
 
2014 | Draft | Working Paper | IST-REx-ID: 7038 | OA
Huszár, K., & Rolinek, M. (n.d.). Playful Math - An introduction to mathematical games. IST Austria.
[Published Version] View | Files available
 
2014 | Published | Journal Article | IST-REx-ID: 1842 | OA
Cibulka, J., Gao, P., Krcál, M., Valla, T., & Valtr, P. (2014). On the geometric ramsey number of outerplanar graphs. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-014-9646-x
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS | 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. 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
 
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. 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
 
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. 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
 

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed