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
2026 |
Published |
Conference Paper |
IST-REx-ID: 22000 |
Tinarrage, Raphaël. “Simplicial Approximation to CW Complexes with Spherical Delaunay Triangulations.” 42nd International Symposium on Computational Geometry, vol. 367, 93:1-93:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026, doi:10.4230/LIPIcs.SoCG.2026.93.
[Published Version]
View
| Files available
| DOI
| arXiv
2026 |
Published |
Journal Article |
IST-REx-ID: 21704 |
Isakova, Lada H., et al. “Descent from a Common Ancestor Restricts Exploration of Protein Sequence Space.” Proceedings of the National Academy of Sciences, vol. 123, no. 14, National Academy of Sciences, 2026, p. e2532018123, doi:10.1073/pnas.2532018123.
[Published Version]
View
| Files available
| DOI
| PubMed | Europe PMC
2026 |
Published |
Journal Article |
IST-REx-ID: 21766 |
Dymond, Michael, and Vojtech Kaluza. “Extending Bilipschitz Mappings between Separated Nets.” Annales Fennici Mathematici, vol. 51, no. 1, Finnish Mathematical Society, 2026, pp. 237–60, doi:10.54330/afm.181562.
[Published Version]
View
| Files available
| DOI
| arXiv
2026 |
Published |
Journal Article |
IST-REx-ID: 21778 |
Dymond, Michael, and Vojtech Kaluza. “Planar Bilipschitz Extension from Separated Nets.” Journal of the London Mathematical Society, vol. 113, no. 4, e70540, Wiley, 2026, doi:10.1112/jlms.70540.
[Published Version]
View
| Files available
| DOI
| arXiv
2026 |
Published |
Journal Article |
IST-REx-ID: 21954 |
| 
|
François, Anton, and Raphaël Tinarrage. “Train-Free Segmentation in MRI with Cubical Persistent Homology.” Journal of Mathematical Imaging and Vision, vol. 68, no. 3, 20, Springer Nature, 2026, doi:10.1007/s10851-026-01300-1.
[Published Version]
View
| Files available
| DOI
| arXiv
2026 |
Published |
Journal Article |
IST-REx-ID: 22247 |
|
|
Filakovský, Marek, et al. “Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform Hypergraphs.” ACM Transactions on Computation Theory, vol. 18, no. 2, 10, Association for Computing Machinery, 2026, doi:10.1145/3779121.
[Published Version]
View
| Files available
| DOI
| arXiv
2026 |
Published |
Thesis | PhD |
IST-REx-ID: 21021 |
Fillmore, Christopher D. Braiding Geometry and Topology to Study Shapes and Data. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-21021.
[Published Version]
View
| Files available
| DOI
2026 |
Published |
Journal Article |
IST-REx-ID: 19860 |
|
|
Aronov, Boris, et al. “Eight-Partitioning Points in 3D, and Efficiently Too.” Discrete & Computational Geometry, vol. 75, Springer Nature, 2026, pp. 1331–55, doi:10.1007/s00454-025-00739-0.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 |
Published |
Journal Article |
IST-REx-ID: 18580 |
Lipiński, Michał, et al. “Morse Predecomposition of an Invariant Set.” Qualitative Theory of Dynamical Systems, vol. 24, no. 1, 5, Springer Nature, 2025, doi:10.1007/s12346-024-01144-3.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 |
Epub ahead of print |
Journal Article |
IST-REx-ID: 19848 |
Tinarrage, Raphaël, et al. “Empirical Analysis of Binding Precedent Efficiency in Brazilian Supreme Court via Case Classification.” Artificial Intelligence and Law, Springer Nature, 2025, doi:10.1007/s10506-025-09458-6.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| WoS
| arXiv
2025 |
Epub ahead of print |
Journal Article |
IST-REx-ID: 20407 |
|
|
Ennes, Henrique, and Raphaël Tinarrage. “LieDetect: Detection of Representation Orbits of Compact Lie Groups from Point Clouds.” Foundations of Computational Mathematics, Springer Nature, 2025, doi:10.1007/s10208-025-09728-4.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| WoS
| arXiv
2025 |
Published |
Journal Article |
IST-REx-ID: 18157 |
Brunck, Florestan R., and Matthew Alan Kwan. “Books, Hallways, and Social Butterflies: A Note on Sliding Block Puzzles.” Mathematical Intelligencer, vol. 47, Springer Nature, 2025, pp. 52–65, doi:10.1007/s00283-024-10358-x.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 20004 |
Streltsova, Elizaveta, and Uli Wagner. “Levels in Arrangements: Linear Relations, the g-Matrix, and Applications to Crossing Numbers.” 41st International Symposium on Computational Geometry, vol. 332, 75, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:10.4230/LIPIcs.SoCG.2025.75.
[Published Version]
View
| Files available
| DOI
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 20008 |
Avvakumov, Sergey, et al. “Hardness of 4-Colouring G-Colourable Graphs.” Proceedings of the 57th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2025, pp. 72–83, doi:10.1145/3717823.3718154.
[Published Version]
View
| Files available
| DOI
2025 |
Published |
Thesis | PhD |
IST-REx-ID: 20339 |
Tasinato, Gianluca. Topological Methods in Discrete Geometry and Theoretical Computer Science: Measure Partitioning and Constraint Satisfaction Problems. Institute of Science and Technology Austria, 2025, doi:10.15479/AT-ISTA-20339.
[Published Version]
View
| Files available
| DOI
2024 |
Published |
Journal Article |
IST-REx-ID: 13974 |
Fulek, Radoslav, et al. “The Crossing Tverberg Theorem.” Discrete and Computational Geometry, vol. 72, Springer Nature, 2024, pp. 831–48, doi:10.1007/s00454-023-00532-x.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2024 |
Published |
Journal Article |
IST-REx-ID: 14660 |
Ivanov, Grigory, and Márton Naszódi. “Quantitative Steinitz Theorem: A Polynomial Bound.” Bulletin of the London Mathematical Society, vol. 56, no. 2, London Mathematical Society, 2024, pp. 796–802, doi:10.1112/blms.12965.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 |
Published |
Conference Paper |
IST-REx-ID: 14888 |
De Nooijer, Phoebe, et al. “Removing Popular Faces in Curve Arrangements.” 31st International Symposium on Graph Drawing and Network Visualization, vol. 14466, Springer Nature, 2024, pp. 18–33, doi:10.1007/978-3-031-49275-4_2.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2024 |
Published |
Conference Paper |
IST-REx-ID: 15296
Lopushanski, Mariana, and Grigory Ivanov. “A Constructive Algorithm for Building Rectifiable Curves in Weakly Convex Sets.” AIP Conference Proceedings, vol. 3030, no. 1, 080002, AIP Publishing, 2024, doi:10.1063/5.0195908.
View
| DOI
2024 |
Published |
Journal Article |
IST-REx-ID: 18604 |
De Nooijer, Phoebe, et al. “Removing Popular Faces in Curve Arrangements.” Journal of Graph Algorithms and Applications, vol. 28, no. 2, Brown University, 2024, pp. 47–82, doi:10.7155/jgaa.v28i2.2988.
[Published Version]
View
| Files available
| DOI
| arXiv