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 |
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 | 1 | 2023 |
A logarithmic approximation of linearly-ordered colourings TV Nakajima, S Živný arXiv preprint arXiv:2404.19556, 2024 | | 2024 |
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 |
Maximum - vs. -colourings of graphs TV Nakajima, S Živný arXiv preprint arXiv:2311.00440, 2023 | | 2023 |