484 results on '"Uehara, Ryuhei"'
Search Results
2. On the Computational Complexity of Generalized Common Shape Puzzles
3. On the Computational Complexity of Generalized Common Shape Puzzles
4. Refolding and Refolding world map
5. Combinatorial Reconfiguration with Answer Set Programming: Algorithms, Encodings, and Empirical Analysis
6. Infinitely many Polygons that can fold into two boxes
7. Network over Regular Polyhedra (1)
8. Network over Regular Polyhedra (2)
9. Computational Complexity of Flattening Fixed-Angle Orthogonal Chains
10. Efficient Folding Algorithms for Convex Polyhedra
11. Sorting Balls and Water: Equivalence and Computational Complexity
12. Solving Rep-tile by Computers: Performance of Solvers and Analyses of Solutions
13. Any Regular Polyhedron Can Transform to Another by O(1) Refoldings
14. Computational Complexity of Jumping Block Puzzles
15. Efficient Folding Algorithms for Regular Polyhedra
16. Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares
17. Reconfiguration of Vertex-Disjoint Shortest Paths on Graphs
18. Computational complexity of jumping block puzzles
19. Efficient enumeration of non-isomorphic distance-hereditary graphs and related graphs
20. Efficient Segment Folding is Hard
21. Cyclic Shift Problems on Graphs
22. Gathering on a Circle with Limited Visibility by Anonymous Oblivious Robots
23. Sorting balls and water: Equivalence and computational complexity
24. Reconfiguration of Vertex-Disjoint Shortest Paths on Graphs
25. Reconfiguring Undirected Paths
26. Design Schemes for Fair Dice
27. Mathematical characterizations and computational complexity of anti-slide puzzles
28. Developing a tetramonohedron with minimum cut length
29. Efficient Enumeration of Non-isomorphic Distance-Hereditary Graphs and Ptolemaic Graphs
30. Mathematical Characterizations and Computational Complexity of Anti-slide Puzzles
31. Cyclic Shift Problems on Graphs
32. Shortest Reconfiguration Sequence for Sliding Tokens on Spiders
33. Swapping Colored Tokens on Graphs
34. Basic Knowledge of Unfolding
35. Common Nets of a Regular Tetrahedron and Johnson-Zalgaller Solids
36. Undecidability of Folding
37. Zipper-Unfolding
38. Answers to Exercises
39. Rep-Cube
40. Bumpy Pyramids Folded from Petal Polygons
41. One-Dimensional Origami Model and Stamp Folding
42. Common Nets of Boxes
43. Computational Complexity of Stamp Folding
44. Unfolding
45. Common Nets of (Regular) Polyhedra
46. Efficient segment folding is hard
47. Ununfoldable polyhedra with 6 vertices or 6 faces
48. Packing Cube Nets into Rectangles with O(1) Holes
49. Toward Unfolding Doubly Covered n-Stars
50. Token Shifting on Graphs
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.