Gianluca Tasinato
5 Publications
2025 | Published | Conference Paper | IST-REx-ID: 20008 | 
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 | IST-REx-ID: 20339 |
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: 19860 |
B. Aronov, A. Basit, I. Ramesh, G. Tasinato, and U. Wagner, “Eight-partitioning points in 3D, and efficiently too,” Discrete and Computational Geometry. Springer Nature, 2025.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
| WoS
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 15168 |
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: 18917 |
B. Aronov, A. Basit, I. Ramesh, G. Tasinato, and U. Wagner, “Eight-partitioning points in 3D, and efficiently too,” in 40th International Symposium on Computational Geometry, Athens, Greece, 2024, vol. 293, p. 8:1-8:15.
[Published Version]
View
| Files available
| DOI
| arXiv
Grants
5 Publications
2025 | Published | Conference Paper | IST-REx-ID: 20008 |
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 | IST-REx-ID: 20339 |
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: 19860 |
B. Aronov, A. Basit, I. Ramesh, G. Tasinato, and U. Wagner, “Eight-partitioning points in 3D, and efficiently too,” Discrete and Computational Geometry. Springer Nature, 2025.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
| WoS
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 15168 |
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: 18917 |
B. Aronov, A. Basit, I. Ramesh, G. Tasinato, and U. Wagner, “Eight-partitioning points in 3D, and efficiently too,” in 40th International Symposium on Computational Geometry, Athens, Greece, 2024, vol. 293, p. 8:1-8:15.
[Published Version]
View
| Files available
| DOI
| arXiv