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.
8 Publications
2020 | Journal Article | IST-REx-ID: 7666 | 
Edelsbrunner, H., & Ölsböck, K. (2020). Tri-partitions and bases of an ordered complex. Discrete and Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-020-00188-x
[Published Version]
View
| Files available
| DOI
| WoS
2020 | Journal Article | IST-REx-ID: 7960 |
Kalai, G., & Patakova, Z. (2020). Intersection patterns of planar sets. Discrete and Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-020-00205-z
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2020 | Journal Article | IST-REx-ID: 7962 |
Pach, J., Reed, B., & Yuditsky, Y. (2020). Almost all string graphs are intersection graphs of plane convex sets. Discrete and Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-020-00213-z
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2020 | Journal Article | IST-REx-ID: 8323 |
Pach, J. (2020). A farewell to Ricky Pollack. Discrete and Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-020-00237-5
View
| DOI
| Download None (ext.)
| WoS
2019 | Journal Article | IST-REx-ID: 5678 |
Edelsbrunner, H., & Nikitenko, A. (2019). Poisson–Delaunay Mosaics of Order k. Discrete and Computational Geometry. Springer. https://doi.org/10.1007/s00454-018-0049-2
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2018 | Journal Article | IST-REx-ID: 1064 |
Akopyan, A., Balitskiy, A., & Grigorev, M. (2018). On the circle covering theorem by A.W. Goodman and R.E. Goodman. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-017-9883-x
[Published Version]
View
| Files available
| DOI
| WoS
2017 | Journal Article | IST-REx-ID: 534 |
Burton, B., de Mesmay, A. N., & Wagner, U. (2017). Finding non-orientable surfaces in 3-Manifolds. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-017-9900-0
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2017 | Journal Article | IST-REx-ID: 1073 |
Čadek, M., Krcál, M., & Vokřínek, L. (2017). Algorithmic solvability of the lifting extension problem. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-016-9855-6
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS