We stand with Ukraine  

Tamio-Vesa Nakajima

Orcid: 0000-0003-3684-9412

Affiliations:
  • University of Oxford, UK


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

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Virtual-Memory Powersort.
[BibTeX]
[DOI]
Finn Moltmann
,
Tamio-Vesa Nakajima
,
Sebastian Wild
CoRR, May, 2026

Towards infinite PCSP: a dichotomy for monochromatic cliques.
[BibTeX]
[DOI]
Demian Banakh
,
Alexey Barsukov
,
Tamio-Vesa Nakajima
CoRR, May, 2026

Rooting Out Entropy: Optimal Tree Extraction for Ultra-Succinct Graphs.
[BibTeX]
[DOI]
Ziad Ismaili Alaoui
,
Tamio-Vesa Nakajima
,
Namrata
,
Sebastian Wild
CoRR, March, 2026

2025
Maximum Bipartite vs. Triangle-Free Subgraph.
[BibTeX]
[DOI]
Tamio-Vesa Nakajima
,
Stanislav Zivný
Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

Complexity of Approximate Conflict-Free, Linearly-Ordered, and Nonmonochromatic Hypergraph Colourings.
[BibTeX]
[DOI]
Tamio-Vesa Nakajima
,
Zephyr Verwimp
,
Marcin Wrochna
,
Stanislav Zivný
Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

Strong Sparsification for 1-in-3-SAT via Polynomial Freiman-Ruzsa.
[BibTeX]
[DOI]
Benjamin Bedert
,
Tamio-Vesa Nakajima
,
Karolina Okrasa
,
Stanislav Zivný
Proceedings of the 66th IEEE Annual Symposium on Foundations of Computer Science, 2025

Maximum And- vs. Even-SAT.
[BibTeX]
[DOI]
Tamio-Vesa Nakajima
,
Stanislav Zivný
Proceedings of the Approximation, 2025

2024
On the Complexity of Symmetric vs. Functional PCSPs.
[BibTeX]
[DOI]
Tamio-Vesa Nakajima
,
Stanislav Zivný
ACM Trans. Algorithms, October, 2024

An approximation algorithm for Maximum DiCut vs. Cut.
[BibTeX]
[DOI]
Tamio-Vesa Nakajima
,
Stanislav Zivný
CoRR, 2024

Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform Hypergraphs.
[BibTeX]
[DOI]
Marek Filakovský
,
Tamio-Vesa Nakajima
,
Jakub Oprsal
,
Gianluca Tasinato
,
Uli Wagner
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.
[BibTeX]
[DOI]
Lorenzo Ciardo
,
Marcin Kozik
,
Andrei A. Krokhin
,
Tamio-Vesa Nakajima
,
Stanislav Zivný
Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

A Logarithmic Approximation of Linearly-Ordered Colourings.
[BibTeX]
[DOI]
Johan Håstad
,
Björn Martinsson
,
Tamio-Vesa Nakajima
,
Stanislav Zivný
Proceedings of the Approximation, 2024

2023
Maximum k- vs. 𝓁-colourings of graphs.
[BibTeX]
[DOI]
Tamio-Vesa Nakajima
,
Stanislav Zivný
CoRR, 2023

On the complexity of the approximate hypergraph homomorphism problem.
[BibTeX]
[DOI]
Lorenzo Ciardo
,
Marcin Kozik
,
Andrei A. Krokhin
,
Tamio-Vesa Nakajima
,
Stanislav Zivný
CoRR, 2023

Boolean symmetric vs. functional PCSP dichotomy.
[BibTeX]
[DOI]
Tamio-Vesa Nakajima
,
Stanislav Zivný
Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023

2022
Linearly Ordered Colourings of Hypergraphs.
[BibTeX]
[DOI]
Tamio-Vesa Nakajima
,
Stanislav Zivný
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2020
The Syndrome-Trellis Sampler for Generative Steganography.
[BibTeX]
[DOI]
Tamio-Vesa Nakajima
,
Andrew D. Ker
Proceedings of the 12th IEEE International Workshop on Information Forensics and Security, 2020


  Loading...