Tamio-Vesa Nakajima

Orcid: 0000-0003-3684-9412

Affiliations:
  • University of Oxford, UK


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

Collaborative distances:

Timeline

2020
2021
2022
2023
2024
0
1
2
3
4
5
6
7
8
4
2
1
3
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On the Complexity of Symmetric vs. Functional PCSPs.
ACM Trans. Algorithms, October, 2024

Maximum And- vs. Even-SAT.
CoRR, 2024

Maximum Bipartite vs. Triangle-Free Subgraph.
CoRR, 2024

An approximation algorithm for Maximum DiCut vs. Cut.
CoRR, 2024

Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform Hypergraphs.
Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

1-in-3 vs. Not-All-Equal: Dichotomy of a broken promise.
Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

A Logarithmic Approximation of Linearly-Ordered Colourings.
Proceedings of the Approximation, 2024

2023
Maximum k- vs. 𝓁-colourings of graphs.
CoRR, 2023

On the complexity of the approximate hypergraph homomorphism problem.
CoRR, 2023

Boolean symmetric vs. functional PCSP dichotomy.
Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023

2022
Linearly Ordered Colourings of Hypergraphs.
ACM Trans. Comput. Theory, December, 2022

2020
The Syndrome-Trellis Sampler for Generative Steganography.
Proceedings of the 12th IEEE International Workshop on Information Forensics and Security, 2020


  Loading...