Tamio-Vesa Nakajima

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

CV: here

Research

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.

Publications

T.-V. N. and Stanislav Živný, An approximation algorithm for Maximum DiCut vs. Cut
- arXiv preprint: 2402.07863
Marek Filakovský, T.-V. N., Jakub Opršal, Gianluca Tasinato, Uli Wagner, Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs
- arXiv preprint: 2312.12981
- Presented at: STACS 2024, doi: 10.4230/LIPIcs.STACS.2024.34
T.-V. N. and Stanislav Živný, Maximum k- vs. l-colourings of graphs
- arXiv preprint: 2311.00440
T.-V. N. and Stanislav Živny, Boolean symmetric vs. functional PCSP dichotomy
- Presented at: LICS 2023, doi: 10.1109/LICS56636.2023.10175746
- arXiv preprint: 2210.03343
Lorenzo Ciardo, Marcin Kozik, Andrei Krokhin, T.-V. N. and Stanislav Živný, 1-in-3 vs. Not-All-Equal: Dichotomy of a broken promise
- arXiv preprint (old version with other name): 2302.03456
- To appear at LICS 2024.
T.-V. N. and Stanislav Živny, Linearly Ordered Colourings of Hypergraphs
- In: ACM Transactions on Computation Theory, Vol. 14, No. 3-4, December 2022, doi: 10.1145/3570909
- Presented at: ICALP 2022, doi: 10.4230/LIPIcs.ICALP.2022.128
- arXiv preprint: 2204.05628
T.-V. N. and Andrew Ker, The Syndrome-Trellis Sampler for Generative Steganography
- Presented at: WIFS 2020, doi: 10.1109/WIFS49906.2020.9360885

Honours, Awards

Academic

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.

The Microsoft Prize for best Computer Science project 2021 (Part C) (joint winner)
The Hoare Prize for best overall performance in Computer Science 2020 (Part A+B)
The BCS Prize in Computer Science 2018 for the best performance in Computer Science papers (Prelims)

Competitive programming

My comptetitive programming profiles are: infoarena, codeforces.

Gold medal at International Olympiad in Informatics (IOI) 2017, Iran
Gold medal at Central European Olympiad in Informatics (CEOI) 2017, Slovenia
Silver medal at Balkan Olympiad in Informatics (BOI) 2016, Cyprus
Participated in the 2018 ACM ICPC world finals in Beijing, with team Tractor_Specialists
Participated in the Google HashCode world finals in 2018, 2019, 2020, with teams Tractor_Specialists, Steaklovers, Rust Team
Bronze (2014), Silver (2015), Gold, third place (2016), Bronze (2017) medal at the Romanian National Olympiad in Informatics

Other activities

Teaching

Taught classes for Combinatorial Optimization at Oxford in 2022-2023.

Taught tutorials for Imperative programming 1 & 2 and Imperative programming 3 at University College, Oxford in 2022.

Project participations

Participated on

Research seminars, etc.

Presented at:

Participated in:

Competitive programming

Deputy team leader for Romania at:

Scientific committee executive chairman for InfO(1)Cup: 2020, 2021, 2022, 2023, 2024

Scientific committee member for:

Balkan Olympiad in Informatics (BOI): 2018 (Timișoara), 2022 (Bucharest)
Junior Balkan Olympiad in Informatics (JBOI): 2022 (Dorohoi), 2023 (Strumica)
InfO(1)Cup: 2019
Romanian Master of Informatics (RMI): 2020, 2021 2022 2023
European Junior Olympiad in Informatics (EJOI) 2021
Romanian National Olympiad in Informatics (several years)

Personal details

I am Romanian, from Beiuș. (In fact, in 2018-2019 I was president of the Romanian Society in Oxford.) I usually go by just Tamio, not Tamio-Vesa. I also compose a lot of classical music, which I put on my youtube channel: