Tamio-Vesa Nakajima

According to our database, Tamio-Vesa Nakajima authored at least 7 papers between 2020 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

An approximation algorithm for Maximum DiCut vs. Cut.

Tamio-Vesa Nakajima, Stanislav Zivný

CoRR, 2024

Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform Hypergraphs.

Marek Filakovský, Tamio-Vesa Nakajima, Jakub Oprsal, Gianluca Tasinato, Uli Wagner

Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

2023

Maximum k- vs. 𝓁-colourings of graphs.

Tamio-Vesa Nakajima, Stanislav Zivný

CoRR, 2023

On the complexity of the approximate hypergraph homomorphism problem.

Lorenzo Ciardo, Marcin Kozik, Andrei A. Krokhin, Tamio-Vesa Nakajima, Stanislav Zivný

CoRR, 2023

Boolean symmetric vs. functional PCSP dichotomy.

Tamio-Vesa Nakajima, Stanislav Zivný

LICS, 2023

2022

Linearly Ordered Colourings of Hypergraphs.

Tamio-Vesa Nakajima, Stanislav Zivný

ACM Trans. Comput. Theory, December, 2022

2020

The Syndrome-Trellis Sampler for Generative Steganography.

Tamio-Vesa Nakajima, Andrew D. Ker

Proceedings of the 12th IEEE International Workshop on Information Forensics and Security, 2020