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.

145 Publications


2026 | Published | Conference Paper | IST-REx-ID: 22000 | OA
R. Tinarrage, “Simplicial approximation to CW complexes with spherical Delaunay triangulations,” in 42nd International Symposium on Computational Geometry, New Brunswick, NJ, United States, 2026, vol. 367.
[Published Version] View | Files available | DOI | arXiv
 

2026 | Published | Thesis | PhD | IST-REx-ID: 21021 | OA
C. D. Fillmore, “Braiding geometry and topology to study shapes and data,” Institute of Science and Technology Austria, 2026.
[Published Version] View | Files available | DOI
 

2026 | Published | Journal Article | IST-REx-ID: 21704 | OA
L. H. Isakova, E. Streltsova, O. Bochkareva, P. K. Vlasov, and F. Kondrashov, “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, p. e2532018123, 2026.
[Published Version] View | Files available | DOI | PubMed | Europe PMC
 

2026 | Published | Journal Article | IST-REx-ID: 21766 | OA
M. Dymond and V. Kaluza, “Extending bilipschitz mappings between separated nets,” Annales Fennici Mathematici, vol. 51, no. 1. Finnish Mathematical Society, pp. 237–260, 2026.
[Published Version] View | Files available | DOI | arXiv
 

2026 | Published | Journal Article | IST-REx-ID: 21778 | OA
M. Dymond and V. Kaluza, “Planar bilipschitz extension from separated nets,” Journal of the London Mathematical Society, vol. 113, no. 4. Wiley, 2026.
[Published Version] View | Files available | DOI | arXiv
 

2026 | Published | Journal Article | IST-REx-ID: 21954 | OA | PlanS
A. François and R. Tinarrage, “Train-free segmentation in MRI with cubical persistent homology,” Journal of Mathematical Imaging and Vision, vol. 68, no. 3. Springer Nature, 2026.
[Published Version] View | Files available | DOI | arXiv
 

2025 | Published | Journal Article | IST-REx-ID: 18580 | OA
M. Lipiński, K. Mischaikow, and M. Mrozek, “Morse predecomposition of an invariant set,” Qualitative Theory of Dynamical Systems, vol. 24, no. 1. Springer Nature, 2025.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19848 | OA
R. Tinarrage, H. Ennes, L. Resck, L. T. Gomes, J. R. Ponciano, and J. Poco, “Empirical analysis of binding precedent efficiency in Brazilian Supreme Court via case classification,” Artificial Intelligence and Law. Springer Nature, 2025.
[Published Version] View | DOI | Download Published Version (ext.) | WoS | arXiv
 

2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19860 | OA
B. Aronov, A. Basit, I. Ramesh, G. Tasinato, and U. Wagner, “Eight-partitioning points in 3D, and efficiently too,” Discrete & Computational Geometry. Springer Nature, 2025.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | WoS | arXiv
 

2025 | Published | Conference Paper | IST-REx-ID: 20004 | OA
E. Streltsova and U. Wagner, “Levels in arrangements: Linear relations, the g-matrix, and applications to crossing numbers,” in 41st International Symposium on Computational Geometry, Kanazawa, Japan, 2025, vol. 332.
[Published Version] View | Files available | DOI | arXiv
 

2025 | Published | Conference Paper | IST-REx-ID: 20008 | OA
S. Avvakumov, M. Filakovský, J. Opršal, G. Tasinato, and U. Wagner, “Hardness of 4-colouring G-colourable graphs,” in Proceedings of the 57th Annual ACM Symposium on Theory of Computing, Prague, Czechia, 2025, pp. 72–83.
[Published Version] View | Files available | DOI
 

2025 | Published | Thesis | PhD | IST-REx-ID: 20339 | OA
G. Tasinato, “Topological methods in discrete geometry and theoretical computer science : Measure partitioning and constraint satisfaction problems,” Institute of Science and Technology Austria, 2025.
[Published Version] View | Files available | DOI
 

2025 | Epub ahead of print | Journal Article | IST-REx-ID: 20407 | OA | PlanS
H. Ennes and R. Tinarrage, “LieDetect: Detection of representation orbits of compact Lie groups from point clouds,” Foundations of Computational Mathematics. Springer Nature, 2025.
[Published Version] View | DOI | Download Published Version (ext.) | WoS | arXiv
 

2025 | Published | Journal Article | IST-REx-ID: 18157 | OA
F. R. Brunck and M. A. Kwan, “Books, Hallways, and social butterflies: A note on sliding block puzzles,” Mathematical Intelligencer, vol. 47. Springer Nature, pp. 52–65, 2025.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2024 | Published | Journal Article | IST-REx-ID: 13974 | OA
R. Fulek, B. Gärtner, A. Kupavskii, P. Valtr, and U. Wagner, “The crossing Tverberg theorem,” Discrete and Computational Geometry, vol. 72. Springer Nature, pp. 831–848, 2024.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

2024 | Published | Journal Article | IST-REx-ID: 14660 | OA
G. Ivanov and M. Naszódi, “Quantitative Steinitz theorem: A polynomial bound,” Bulletin of the London Mathematical Society, vol. 56, no. 2. London Mathematical Society, pp. 796–802, 2024.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2024 | Published | Conference Paper | IST-REx-ID: 14888 | OA
P. De Nooijer et al., “Removing popular faces in curve arrangements,” in 31st International Symposium on Graph Drawing and Network Visualization, Isola delle Femmine, Palermo, Italy, 2024, vol. 14466, pp. 18–33.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2024 | Published | Conference Paper | IST-REx-ID: 15168 | OA
M. Filakovský, T. V. Nakajima, J. Opršal, G. Tasinato, and U. Wagner, “Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs,” in 41st International Symposium on Theoretical Aspects of Computer Science, Clermont-Ferrand, France, 2024, vol. 289.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2024 | Published | Conference Paper | IST-REx-ID: 15296
M. Lopushanski and G. Ivanov, “A constructive algorithm for building rectifiable curves in weakly convex sets,” in AIP Conference Proceedings, Virtual, 2024, vol. 3030, no. 1.
View | DOI
 

2024 | Published | Journal Article | IST-REx-ID: 18604 | OA
P. De Nooijer et al., “Removing popular faces in curve arrangements,” Journal of Graph Algorithms and Applications, vol. 28, no. 2. Brown University, pp. 47–82, 2024.
[Published Version] View | Files available | DOI | arXiv
 

Filters and Search Terms

department=UlWa

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed