Tamio-Vesa Nakajima

25 papers A* 6A 3Journal 15Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Rooting Out Entropy: Optimal Tree Extraction for Ultra-Succinct Graphs. CoRR Ziad Ismaili Alaoui, Tamio-Vesa Nakajima, Namrata, Sebastian Wild
2025	J	`jnl`	1-in-3 vs. Not-All-Equal: Dichotomy of a Broken Promise. ACM Trans. Comput. Log. Lorenzo Ciardo, Marcin Kozik, Andrei A. Krokhin, Tamio-Vesa Nakajima, Stanislav Zivný
2025	A*	`conf`	Complexity of Approximate Conflict-Free, Linearly-Ordered, and Nonmonochromatic Hypergraph Colourings. ICALP Tamio-Vesa Nakajima, Zephyr Verwimp, Marcin Wrochna, Stanislav Zivný
2025	J	`jnl`	Complexity of approximate conflict-free, linearly-ordered, and nonmonochromatic hypergraph colourings. CoRR Tamio-Vesa Nakajima, Zephyr Verwimp, Marcin Wrochna, Stanislav Zivný
2025	A	`conf`	Maximum And- vs. Even-SAT. APPROX/RANDOM Tamio-Vesa Nakajima, Stanislav Zivný
2025	A*	`conf`	Maximum Bipartite vs. Triangle-Free Subgraph. ICALP Tamio-Vesa Nakajima, Stanislav Zivný
2025	A*	`conf`	Strong Sparsification for 1-in-3-SAT via Polynomial Freiman-Ruzsa. FOCS Benjamin Bedert, Tamio-Vesa Nakajima, Karolina Okrasa, Stanislav Zivný
2025	J	`jnl`	Strong Sparsification for 1-in-3-SAT via Polynomial Freiman-Ruzsa. CoRR Benjamin Bedert, Tamio-Vesa Nakajima, Karolina Okrasa, Stanislav Zivný
2024	A*	`conf`	1-in-3 vs. Not-All-Equal: Dichotomy of a broken promise. LICS Lorenzo Ciardo, Marcin Kozik, Andrei A. Krokhin, Tamio-Vesa Nakajima, Stanislav Zivný
2024	A	`conf`	A Logarithmic Approximation of Linearly-Ordered Colourings. APPROX/RANDOM Johan Håstad, Björn Martinsson, Tamio-Vesa Nakajima, Stanislav Zivný
2024	J	`jnl`	A logarithmic approximation of linearly-ordered colourings. CoRR Johan Håstad, Björn Martinsson, Tamio-Vesa Nakajima, Stanislav Zivný
2024	J	`jnl`	An approximation algorithm for Maximum DiCut vs. Cut. CoRR Tamio-Vesa Nakajima, Stanislav Zivný
2024	A	`conf`	Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform Hypergraphs. STACS Marek Filakovský, Tamio-Vesa Nakajima, Jakub Oprsal, Gianluca Tasinato, Uli Wagner
2024	J	`jnl`	Maximum And- vs. Even-SAT. CoRR Tamio-Vesa Nakajima, Stanislav Zivný
2024	J	`jnl`	Maximum Bipartite vs. Triangle-Free Subgraph. CoRR Tamio-Vesa Nakajima, Stanislav Zivný
2024	J	`jnl`	On the Complexity of Symmetric vs. Functional PCSPs. ACM Trans. Algorithms Tamio-Vesa Nakajima, Stanislav Zivný
2023	A*	`conf`	Boolean symmetric vs. functional PCSP dichotomy. LICS Tamio-Vesa Nakajima, Stanislav Zivný
2023	J	`jnl`	Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs. CoRR Marek Filakovský, Tamio-Vesa Nakajima, Jakub Oprsal, Gianluca Tasinato, Uli Wagner
2023	J	`jnl`	Maximum k- vs. 𝓁-colourings of graphs. CoRR Tamio-Vesa Nakajima, Stanislav Zivný
2023	J	`jnl`	On the complexity of the approximate hypergraph homomorphism problem. CoRR Lorenzo Ciardo, Marcin Kozik, Andrei A. Krokhin, Tamio-Vesa Nakajima, Stanislav Zivný
2022	J	`jnl`	Boolean symmetric vs. functional PCSP dichotomy. CoRR Tamio-Vesa Nakajima, Stanislav Zivný
2022	A*	`conf`	Linearly Ordered Colourings of Hypergraphs. ICALP Tamio-Vesa Nakajima, Stanislav Zivný
2022	J	`jnl`	Linearly Ordered Colourings of Hypergraphs. ACM Trans. Comput. Theory Tamio-Vesa Nakajima, Stanislav Zivný
2022	J	`jnl`	Linearly ordered colourings of hypergraphs. CoRR Tamio-Vesa Nakajima, Stanislav Zivný
2020	—	`conf`	The Syndrome-Trellis Sampler for Generative Steganography. WIFS Tamio-Vesa Nakajima, Andrew D. Ker