Eight-Partitioning Points in 3D, and Efficiently Too. - Boris Aronov; Abdul Basit 001; Indu Ramesh; Gianluca Tasinato; Uli Wagner 001 (SoCG, 2024)

Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform Hypergraphs. - Marek Filakovský; Tamio-Vesa Nakajima; Jakub Oprsal; Gianluca Tasinato; Uli Wagner 001 (STACS, 2024)

Hardness of 4-Colouring k-Colourable Graphs. - Sergey Avvakumov; Marek Filakovský; Jakub Oprsal; Gianluca Tasinato; Uli Wagner 001 (STOC, 2025)

Hardness of 4-Colourings G-Colourable Graphs. - Sergey Avvakumov; Marek Filakovský; Jakub Oprsal; Gianluca Tasinato; Uli Wagner 001 (CoRR, 2025)