◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Y. Okamoto

32 papers hereh-index 191.4k citations133 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author2
  • middle author18
  • last author9

Across the 29 of 32 papers where every author was matched, so the position is known.

fields
  • cs.CG12
  • cs.DS11
  • math.CO6
  • cs.GT2
  • cs.CC1
same name
  • Y. Okamoto — 82 papers, h 30
  • Y. Okamoto — 45 papers, h 42
  • Y. Okamoto — 21 papers, h 20
  • Y. Okamoto — 11 papers, h 2
  • Y. Okamoto — 3 papers, h 52
  • Y. Okamoto — 2 papers, h 26

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20062026
most citedOn Problems as Hard as CNFSAT

121 citations · 153 across the 25 of their papers we have counts for

collaborators
Showing 2023Show all

2 papers · 1 filter

cs.DS2023★ 1 cited

Algorithmic Theory of Qubit Routing

Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama +2

The qubit routing problem, also known as the swap minimization problem, is a (classical) combinatorial optimization problem that arises in the design of compilers of quantum progra…

math.CO2023

Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra

Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama +4

We prove that the computation of a combinatorial shortest path between two vertices of a graph associahedron, introduced by Carr and Devadoss, is NP-hard. This resolves an open pro…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.