Nakajima, Tamio-Vesa

1. Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs
   2023/12/20 by Filakovský, Marek, Nakajima, Tamio-Vesa, Opršal, Jakub +2 · 2 citations
   #Algebraic Topology (math.AT) #Combinatorics (math.CO) #Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Mathematics
2. A logarithmic approximation of linearly ordered colourings
   2024/04/30 by Håstad, Johan, Martinsson, Björn, Nakajima, Tamio-Vesa +1 · 2 citations
   #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
3. Complexity of approximate conflict-free, linearly-ordered, and nonmonochromatic hypergraph colourings
   2025/01/21 by Nakajima, Tamio-Vesa, Verwimp, Zephyr, Wrochna, Marcin +1 · 1 citation
   #Combinatorics (math.CO) #Computational Complexity (cs.CC) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics