Linearly ordered colourings of hypergraphs TV Nakajima, S Živný
ACM Transactions on Computation Theory, 2022
14 2022 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
7 2023 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
5 2023 1-in-3 vs. Not-All-Equal: Dichotomy of a broken promise L Ciardo, M Kozik, A Krokhin, TV Nakajima, S Živný
Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer …, 2024
3 * 2024 The syndrome-trellis sampler for generative steganography TV Nakajima, AD Ker
2020 IEEE International Workshop on Information Forensics and Security (WIFS …, 2020
3 2020 On the complexity of symmetric vs. functional PCSPs TV Nakajima, S Živný
ACM Transactions on Algorithms 20 (4), 1-29, 2024
1 2024 A logarithmic approximation of linearly ordered colourings J Håstad, B Martinsson, TV Nakajima, S Živný
arXiv preprint arXiv:2404.19556, 2024
1 2024 Complexity of approximate conflict-free, linearly-ordered, and nonmonochromatic hypergraph colourings TV Nakajima, Z Verwimp, M Wrochna, S Živný
arXiv preprint arXiv:2501.12062, 2025
2025 Maximum And-vs. Even-SAT TV Nakajima, S Živný
arXiv preprint arXiv:2409.07837, 2024
2024 Maximum Bipartite vs. Triangle-Free Subgraph TV Nakajima, S Živný
arXiv preprint arXiv:2406.20069, 2024
2024 A logarithmic approximation of linearly-ordered colourings TV Nakajima, S Živný
arXiv e-prints, arXiv: 2404.19556, 2024
2024 An approximation algorithm for Maximum DiCut vs. Cut TV Nakajima, S Živný
arXiv preprint arXiv:2402.07863, 2024
2024 Maximum TV Nakajima, S Živný
arXiv preprint arXiv:2311.00440, 2023
2023 
Stanislav ŽivnýProfessor of Computer Science, University of OxfordAdresă de e-mail confirmată pe cs.ox.ac.uk