default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTamio-Vesa Nakajima
Person information
- affiliation: University of Oxford, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j2]Tamio-Vesa Nakajima
, Stanislav Zivný:
On the Complexity of Symmetric vs. Functional PCSPs. ACM Trans. Algorithms 20(4): 33:1-33:29 (2024)- [c6]Johan Håstad, Björn Martinsson, Tamio-Vesa Nakajima, Stanislav Zivný:
A Logarithmic Approximation of Linearly-Ordered Colourings. APPROX/RANDOM 2024: 7:1-7:6 - [c5]Lorenzo Ciardo, Marcin Kozik, Andrei A. Krokhin, Tamio-Vesa Nakajima, Stanislav Zivný:
1-in-3 vs. Not-All-Equal: Dichotomy of a broken promise. LICS 2024: 24:1-24:12 - [c4]Marek Filakovský, Tamio-Vesa Nakajima, Jakub Oprsal, Gianluca Tasinato, Uli Wagner:
Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform Hypergraphs. STACS 2024: 34:1-34:19 - [i9]Tamio-Vesa Nakajima, Stanislav Zivný:
An approximation algorithm for Maximum DiCut vs. Cut. CoRR abs/2402.07863 (2024) - [i8]Johan Håstad, Björn Martinsson, Tamio-Vesa Nakajima, Stanislav Zivný:
A logarithmic approximation of linearly-ordered colourings. CoRR abs/2404.19556 (2024) - [i7]Tamio-Vesa Nakajima, Stanislav Zivný:
Maximum Bipartite vs. Triangle-Free Subgraph. CoRR abs/2406.20069 (2024) - [i6]Tamio-Vesa Nakajima, Stanislav Zivný:
Maximum And- vs. Even-SAT. CoRR abs/2409.07837 (2024) - 2023
- [c3]Tamio-Vesa Nakajima, Stanislav Zivný:
Boolean symmetric vs. functional PCSP dichotomy. LICS 2023: 1-12 - [i5]Lorenzo Ciardo, Marcin Kozik, Andrei A. Krokhin, Tamio-Vesa Nakajima, Stanislav Zivný:
On the complexity of the approximate hypergraph homomorphism problem. CoRR abs/2302.03456 (2023) - [i4]Tamio-Vesa Nakajima, Stanislav Zivný:
Maximum k- vs. 𝓁-colourings of graphs. CoRR abs/2311.00440 (2023) - [i3]Marek Filakovský, Tamio-Vesa Nakajima, Jakub Oprsal, Gianluca Tasinato, Uli Wagner:
Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs. CoRR abs/2312.12981 (2023) - 2022
- [j1]Tamio-Vesa Nakajima, Stanislav Zivný:
Linearly Ordered Colourings of Hypergraphs. ACM Trans. Comput. Theory 14(3-4): 1-19 (2022) - [c2]Tamio-Vesa Nakajima, Stanislav Zivný:
Linearly Ordered Colourings of Hypergraphs. ICALP 2022: 128:1-128:18 - [i2]Tamio-Vesa Nakajima, Stanislav Zivný:
Linearly ordered colourings of hypergraphs. CoRR abs/2204.05628 (2022) - [i1]Tamio-Vesa Nakajima, Stanislav Zivný:
Boolean symmetric vs. functional PCSP dichotomy. CoRR abs/2210.03343 (2022) - 2020
- [c1]Tamio-Vesa Nakajima, Andrew D. Ker:
The Syndrome-Trellis Sampler for Generative Steganography. WIFS 2020: 1-6
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-13 01:04 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
