
Solving Reptile by Computers: Performance of Solvers and Analyses of Solutions
A reptile is a polygon that can be dissected into smaller copies (of th...
read it

Any Regular Polyhedron Can Transform to Another by O(1) Refoldings
We show that several classes of polyhedra are joined by a sequence of O(...
read it

Computational Complexity of Jumping Block Puzzles
In combinatorial reconfiguration, the reconfiguration problems on a vert...
read it

Efficient Folding Algorithms for Regular Polyhedra
We investigate the folding problem that asks if a polygon P can be folde...
read it

Efficient Segment Folding is Hard
We introduce a computational origami problem which we call the segment f...
read it

Cyclic Shift Problems on Graphs
We study a new reconfiguration problem inspired by classic mechanical pu...
read it

Gathering on a Circle with Limited Visibility by Anonymous Oblivious Robots
A swarm of anonymous oblivious mobile robots, operating in deterministic...
read it

Reconfiguring Undirected Paths
We consider problems in which a simple path of fixed length, in an undir...
read it

Shortest Reconfiguration Sequence for Sliding Tokens on Spiders
Suppose that two independent sets I and J of a graph with I = J are ...
read it

Swapping Colored Tokens on Graphs
We investigate the computational complexity of the following problem. We...
read it
Ryuhei Uehara
is this you? claim profile