4 citations · 18 across the 22 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
math.HO2018
Design Schemes for Fair Dice
Tomoko Taniguchi, Ryuhei Uehara
A cube is used as a fair die of 6 faces. However, there are many dice of different shapes on the market. To make them fair, most of them usually have some symmetric shapes. We here…
cs.DS2018★ 4 cited
Shortest Reconfiguration Sequence for Sliding Tokens on Spiders
Duc A. Hoang, Amanj Khorramian, Ryuhei Uehara
Suppose that two independent sets and of a graph with are given, and a token is placed on each vertex in . The Sliding Token problem is t…
cs.DS2018
Swapping Colored Tokens on Graphs
Katsuhisa Yamanaka, Takashi Horiyama, J. Mark Keil +5
We investigate the computational complexity of the following problem. We are given a graph in which each vertex has an initial and a target color. Each pair of adjacent vertices ca…