Gianluca Tasinato

5 Publications

Mark all

[5]
2025 | Published | Conference Paper | IST-REx-ID: 20008 | OA
Avvakumov S, Filakovský M, Opršal J, Tasinato G, Wagner U. 2025. Hardness of 4-colouring G-colourable graphs. Proceedings of the 57th Annual ACM Symposium on Theory of Computing. STOC: Symposium on Theory of Computing, 72–83.
[Published Version] View | Files available | DOI
 
[4]
2025 | Published | Thesis | IST-REx-ID: 20339 | OA
Tasinato G. 2025. Topological methods in discrete geometry and theoretical computer science : Measure partitioning and constraint satisfaction problems. Institute of Science and Technology Austria.
[Published Version] View | Files available | DOI
 
[3]
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19860 | OA
Aronov B, Basit A, Ramesh I, Tasinato G, Wagner U. 2025. Eight-partitioning points in 3D, and efficiently too. Discrete and Computational Geometry.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | WoS | arXiv
 
[2]
2024 | Published | Conference Paper | IST-REx-ID: 15168 | OA
Filakovský M, Nakajima TV, Opršal J, Tasinato G, Wagner U. 2024. Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs. 41st International Symposium on Theoretical Aspects of Computer Science. STACS: Symposium on Theoretical Aspects of Computer Science, LIPIcs, vol. 289, 34.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[1]
2024 | Published | Conference Paper | IST-REx-ID: 18917 | OA
Aronov B, Basit A, Ramesh I, Tasinato G, Wagner U. 2024. Eight-partitioning points in 3D, and efficiently too. 40th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry vol. 293, 8:1-8:15.
[Published Version] View | Files available | DOI | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: ISTA Annual Report

Export / Embed

Grants


5 Publications

Mark all

[5]
2025 | Published | Conference Paper | IST-REx-ID: 20008 | OA
Avvakumov S, Filakovský M, Opršal J, Tasinato G, Wagner U. 2025. Hardness of 4-colouring G-colourable graphs. Proceedings of the 57th Annual ACM Symposium on Theory of Computing. STOC: Symposium on Theory of Computing, 72–83.
[Published Version] View | Files available | DOI
 
[4]
2025 | Published | Thesis | IST-REx-ID: 20339 | OA
Tasinato G. 2025. Topological methods in discrete geometry and theoretical computer science : Measure partitioning and constraint satisfaction problems. Institute of Science and Technology Austria.
[Published Version] View | Files available | DOI
 
[3]
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19860 | OA
Aronov B, Basit A, Ramesh I, Tasinato G, Wagner U. 2025. Eight-partitioning points in 3D, and efficiently too. Discrete and Computational Geometry.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | WoS | arXiv
 
[2]
2024 | Published | Conference Paper | IST-REx-ID: 15168 | OA
Filakovský M, Nakajima TV, Opršal J, Tasinato G, Wagner U. 2024. Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs. 41st International Symposium on Theoretical Aspects of Computer Science. STACS: Symposium on Theoretical Aspects of Computer Science, LIPIcs, vol. 289, 34.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[1]
2024 | Published | Conference Paper | IST-REx-ID: 18917 | OA
Aronov B, Basit A, Ramesh I, Tasinato G, Wagner U. 2024. Eight-partitioning points in 3D, and efficiently too. 40th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry vol. 293, 8:1-8:15.
[Published Version] View | Files available | DOI | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: ISTA Annual Report

Export / Embed