Tamio-Vesa Nakajima

2022202320244 12 2

Public access

2 articles

0 articles

available

not available

Based on funding mandates

Stanislav ŽivnýProfessor of Computer Science, University of OxfordVerified email at cs.ox.ac.uk
Andrei KrokhinProfessor of Computer Science, Durham University, UKVerified email at durham.ac.uk
Marcin KozikProfessor of Computer Science, Jagiellonian UniversityVerified email at uj.edu.pl
Lorenzo CiardoUniversity of OxfordVerified email at cs.ox.ac.uk
Andrew D. KerAssociate Professor of Computer Science, Oxford UniversityVerified email at cs.ox.ac.uk
Jakub OpršalUniversity of BirminghamVerified email at bham.ac.uk

Tamio-Vesa Nakajima

Verified email at cs.ox.ac.uk - Homepage


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Linearly ordered colourings of hypergraphs TV Nakajima, S Živný ACM Transactions on Computation Theory, 2022	11	2022
The syndrome-trellis sampler for generative steganography TV Nakajima, AD Ker 2020 IEEE International Workshop on Information Forensics and Security (WIFS …, 2020	3	2020
Boolean symmetric vs. functional PCSP dichotomy TV Nakajima, S Živný 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-12, 2023	2	2023
On the complexity of the approximate hypergraph homomorphism problem L Ciardo, M Kozik, A Krokhin, TV Nakajima, S Živný arXiv preprint arXiv:2302.03456, 2023	2	2023
An approximation algorithm for Maximum DiCut vs. Cut TV Nakajima, S Živný arXiv preprint arXiv:2402.07863, 2024		2024
1-in-3 vs. not-all-equal: dichotomy of a broken promise L Ciardo, M Kozik, A Krokhin, TV Nakajima, S Zivny		2024
Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs M Filakovský, TV Nakajima, J Opršal, G Tasinato, U Wagner arXiv preprint arXiv:2312.12981, 2023		2023
Maximum - vs. -colourings of graphs TV Nakajima, S Živný arXiv preprint arXiv:2311.00440, 2023		2023

The system can't perform the operation now. Try again later.

Articles 1–8

Citations per year