Gianluca Tasinato
Graduate School
Wagner Group
2 Publications
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
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
| arXiv
Grants
2 Publications
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
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
| arXiv