Gianluca Tasinato
5 Publications
2025 | Published | Conference Paper | IST-REx-ID: 20008 | 
Avvakumov S, Filakovský M, Opršal J, Tasinato G, Wagner U. Hardness of 4-colouring G-colourable graphs. In: Proceedings of the 57th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery; 2025:72-83. doi:10.1145/3717823.3718154
[Published Version]
View
| Files available
| DOI
2025 | Published | Thesis | IST-REx-ID: 20339 |
Tasinato G. Topological methods in discrete geometry and theoretical computer science : Measure partitioning and constraint satisfaction problems. 2025. doi:10.15479/AT-ISTA-20339
[Published Version]
View
| Files available
| DOI
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19860 |
Aronov B, Basit A, Ramesh I, Tasinato G, Wagner U. Eight-partitioning points in 3D, and efficiently too. Discrete and Computational Geometry. 2025. doi:10.1007/s00454-025-00739-0
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
| WoS
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 15168 |
Filakovský M, Nakajima TV, Opršal J, Tasinato G, Wagner U. Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs. In: 41st International Symposium on Theoretical Aspects of Computer Science. Vol 289. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.STACS.2024.34
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 18917 |
Aronov B, Basit A, Ramesh I, Tasinato G, Wagner U. Eight-partitioning points in 3D, and efficiently too. In: 40th International Symposium on Computational Geometry. Vol 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024:8:1-8:15. doi:10.4230/LIPIcs.SoCG.2024.8
[Published Version]
View
| Files available
| DOI
| arXiv
Grants
5 Publications
2025 | Published | Conference Paper | IST-REx-ID: 20008 |
Avvakumov S, Filakovský M, Opršal J, Tasinato G, Wagner U. Hardness of 4-colouring G-colourable graphs. In: Proceedings of the 57th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery; 2025:72-83. doi:10.1145/3717823.3718154
[Published Version]
View
| Files available
| DOI
2025 | Published | Thesis | IST-REx-ID: 20339 |
Tasinato G. Topological methods in discrete geometry and theoretical computer science : Measure partitioning and constraint satisfaction problems. 2025. doi:10.15479/AT-ISTA-20339
[Published Version]
View
| Files available
| DOI
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19860 |
Aronov B, Basit A, Ramesh I, Tasinato G, Wagner U. Eight-partitioning points in 3D, and efficiently too. Discrete and Computational Geometry. 2025. doi:10.1007/s00454-025-00739-0
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
| WoS
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 15168 |
Filakovský M, Nakajima TV, Opršal J, Tasinato G, Wagner U. Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs. In: 41st International Symposium on Theoretical Aspects of Computer Science. Vol 289. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.STACS.2024.34
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 18917 |
Aronov B, Basit A, Ramesh I, Tasinato G, Wagner U. Eight-partitioning points in 3D, and efficiently too. In: 40th International Symposium on Computational Geometry. Vol 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024:8:1-8:15. doi:10.4230/LIPIcs.SoCG.2024.8
[Published Version]
View
| Files available
| DOI
| arXiv