Reading for a DPhil (the Oxford name for a PhD) in Computer Science at Trinity College, Oxford. I previously (2017-2021) completed a MCompSci at University College, Oxford.
Email: tamio-vesa.nakajima@cs.ox.ac.uk
Orcid: 0000-0003-3684-9412
My main interest is in Promise Constraint Satisfaction Problems, which I research together with my supervisor Standa Živný. In the past I also worked a bit on steganography. More generally I am interested in Algorithms and Complexity.
| Name | Authors | arXiv | Conference | Journal |
|---|---|---|---|---|
| Maximum And- vs. Even-SAT | T.-V. N. and Stanislav Živný | 2409.07837 | ||
| Maximum Bipartite vs. Triangle-Free Subgraph | T.-V. N. and Stanislav Živný | 2406.20069 | ||
| A logarithmic approximation of linearly-ordered colourings | Johan Håstad, Björn Martinsson, T.-V. N. and Stanislav Živný | 2404.19556 | APPROX '24 | |
| An approximation algorithm for Maximum DiCut vs. Cut | T.-V. N. and Stanislav Živný | 2402.07863 | ||
| Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs | Marek Filakovský, T.-V. N., Jakub Opršal, Gianluca Tasinato, Uli Wagner | 2312.12981 | STACS '24 | |
| Maximum k- vs. l-colourings of graphs | T.-V. N. and Stanislav Živný | 2311.00440 | ||
| 1-in-3 vs. Not-All-Equal: Dichotomy of a broken promise | Lorenzo Ciardo, Marcin Kozik, Andrei Krokhin, T.-V. N. and Stanislav Živný | 2302.03456 | LICS '24 | |
| On the complexity of symmetric vs. functional PCSPs | T.-V. N. and Stanislav Živny | 2210.03343 | LICS '23 | ACM TALG '24 |
| Linearly Ordered Colourings of Hypergraphs | T.-V. N. and Stanislav Živny | 2204.05628 | ICALP '22 | ACM TOCT '22 |
| The Syndrome-Trellis Sampler for Generative Steganography | T.-V. N. and Andrew Ker | WIFS '20 |
I was awarded a Clarendon Scholarship in order to read for a DPhil at Oxford.
The following awards were received during my Undergraduate degree at Oxford; they are also listed here.
On the program committee for the Theory of Computing track of SYNASC '24.
Reviewed for:
Taught classes for Combinatorial Optimization at Oxford in 2022-2023, and in 2024-2025.
Taught tutorials for Imperative programming 1 & 2 and Imperative programming 3 at University College, Oxford in 2022.
Helped with undergraduate admission interviews for University College in 2021 and 2022.
Deputy team leader for Romania at:
Scientific committee executive chairman for InfO(1)Cup: 2020, 2021, 2022, 2023, 2024
Scientific committee member for:
I am Romanian, from Beiuș. I usually go by just Tamio, not Tamio-Vesa. I also compose classical music, which I put on my youtube channel.