Gianluca Tasinato
5 Publications
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 | 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
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19860 |
Aronov, Boris, et al. “Eight-Partitioning Points in 3D, and Efficiently Too.” Discrete and Computational Geometry, Springer Nature, 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ý, Marek, et al. “Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform Hypergraphs.” 41st International Symposium on Theoretical Aspects of Computer Science, vol. 289, 34, 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, Boris, et al. “Eight-Partitioning Points in 3D, and Efficiently Too.” 40th International Symposium on Computational Geometry, vol. 293, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, p. 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, 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 | 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
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19860 |
Aronov, Boris, et al. “Eight-Partitioning Points in 3D, and Efficiently Too.” Discrete and Computational Geometry, Springer Nature, 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ý, Marek, et al. “Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform Hypergraphs.” 41st International Symposium on Theoretical Aspects of Computer Science, vol. 289, 34, 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, Boris, et al. “Eight-Partitioning Points in 3D, and Efficiently Too.” 40th International Symposium on Computational Geometry, vol. 293, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, p. 8:1-8:15, doi:10.4230/LIPIcs.SoCG.2024.8.
[Published Version]
View
| Files available
| DOI
| arXiv