Gianluca Tasinato

5 Publications

Mark all

[5]
2025 | Published | Conference Paper | IST-REx-ID: 20008 | OA
Avvakumov, Sergey, Marek Filakovský, Jakub Opršal, Gianluca Tasinato, and Uli Wagner. “Hardness of 4-Colouring G-Colourable Graphs.” In Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 72–83. Association for Computing Machinery, 2025. https://doi.org/10.1145/3717823.3718154.
[Published Version] View | Files available | DOI
 
[4]
2025 | Published | Thesis | IST-REx-ID: 20339 | OA
Tasinato, Gianluca. “Topological Methods in Discrete Geometry and Theoretical Computer Science : Measure Partitioning and Constraint Satisfaction Problems.” Institute of Science and Technology Austria, 2025. https://doi.org/10.15479/AT-ISTA-20339.
[Published Version] View | Files available | DOI
 
[3]
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19860 | OA
Aronov, Boris, Abdul Basit, Indu Ramesh, Gianluca Tasinato, and Uli Wagner. “Eight-Partitioning Points in 3D, and Efficiently Too.” Discrete and Computational Geometry. Springer Nature, 2025. https://doi.org/10.1007/s00454-025-00739-0.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | WoS | arXiv
 
[2]
2024 | Published | Conference Paper | IST-REx-ID: 15168 | OA
Filakovský, Marek, Tamio Vesa Nakajima, Jakub Opršal, Gianluca Tasinato, and Uli Wagner. “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. https://doi.org/10.4230/LIPIcs.STACS.2024.34.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[1]
2024 | Published | Conference Paper | IST-REx-ID: 18917 | OA
Aronov, Boris, Abdul Basit, Indu Ramesh, Gianluca Tasinato, and Uli Wagner. “Eight-Partitioning Points in 3D, and Efficiently Too.” In 40th International Symposium on Computational Geometry, 293:8:1-8:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.SoCG.2024.8.
[Published Version] View | Files available | DOI | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed

Grants


5 Publications

Mark all

[5]
2025 | Published | Conference Paper | IST-REx-ID: 20008 | OA
Avvakumov, Sergey, Marek Filakovský, Jakub Opršal, Gianluca Tasinato, and Uli Wagner. “Hardness of 4-Colouring G-Colourable Graphs.” In Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 72–83. Association for Computing Machinery, 2025. https://doi.org/10.1145/3717823.3718154.
[Published Version] View | Files available | DOI
 
[4]
2025 | Published | Thesis | IST-REx-ID: 20339 | OA
Tasinato, Gianluca. “Topological Methods in Discrete Geometry and Theoretical Computer Science : Measure Partitioning and Constraint Satisfaction Problems.” Institute of Science and Technology Austria, 2025. https://doi.org/10.15479/AT-ISTA-20339.
[Published Version] View | Files available | DOI
 
[3]
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 19860 | OA
Aronov, Boris, Abdul Basit, Indu Ramesh, Gianluca Tasinato, and Uli Wagner. “Eight-Partitioning Points in 3D, and Efficiently Too.” Discrete and Computational Geometry. Springer Nature, 2025. https://doi.org/10.1007/s00454-025-00739-0.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | WoS | arXiv
 
[2]
2024 | Published | Conference Paper | IST-REx-ID: 15168 | OA
Filakovský, Marek, Tamio Vesa Nakajima, Jakub Opršal, Gianluca Tasinato, and Uli Wagner. “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. https://doi.org/10.4230/LIPIcs.STACS.2024.34.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[1]
2024 | Published | Conference Paper | IST-REx-ID: 18917 | OA
Aronov, Boris, Abdul Basit, Indu Ramesh, Gianluca Tasinato, and Uli Wagner. “Eight-Partitioning Points in 3D, and Efficiently Too.” In 40th International Symposium on Computational Geometry, 293:8:1-8:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.SoCG.2024.8.
[Published Version] View | Files available | DOI | arXiv
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed