3 citations · 5 across the 4 of their papers we have counts for
4 papers
Core Challenge 2023: Solver and Graph Descriptions
Takehide Soh, Tomoya Tanjo, Yoshio Okamoto +1
This paper collects all descriptions of solvers and ISR instances submitted to CoRe Challenge 2023.
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…
Core Challenge 2022: Solver and Graph Descriptions
Takehide Soh, Yoshio Okamoto, Takehiro Ito
This paper collects all descriptions of solvers and ISR instances submitted to CoRe Challenge 2022.
Reforming an Envy-Free Matching
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura +5
We consider the problem of reforming an envy-free matching when each agent is assigned a single item. Given an envy-free matching, we consider an operation to exchange the item of…