The following pages link to Ryuhei Uehara (Q286972):
Displaying 50 items.
- Folding a paper strip to minimize thickness (Q2634713) (← links)
- Shortest reconfiguration of sliding tokens on subclasses of interval graphs (Q2658043) (← links)
- Token shifting on graphs (Q2695335) (← links)
- Computational complexity of jumping block puzzles (Q2695336) (← links)
- Toward unfolding doubly covered \(n\)-stars (Q2695478) (← links)
- Packing cube nets into rectangles with \(O(1)\) holes (Q2695481) (← links)
- Unique solution instance generation for the 3-satisfiability (3SAT) problem (Q2749863) (← links)
- Common unfolding of regular tetrahedron and Johnson-Zalgaller solid (Q2790157) (← links)
- Shortest Reconfiguration of Sliding Tokens on a Caterpillar (Q2803826) (← links)
- Efficient algorithms for a simple network design problem (Q2811297) (← links)
- Bounding the number of reduced trees, cographs, and series-parallel graphs by compression (Q2846474) (← links)
- Variations on Instant Insanity (Q2848966) (← links)
- On Complexity of Flooding Games on Graphs with Interval Representations (Q2864330) (← links)
- The Voronoi game on graphs and its complexity (Q2865040) (← links)
- Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression (Q2889896) (← links)
- A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares (Q2904540) (← links)
- The graph isomorphism problem on geometric graphs (Q2928583) (← links)
- Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths (Q2936933) (← links)
- Polynomial-Time Algorithm for Sliding Tokens on Trees (Q2942646) (← links)
- Depth-First Search Using $$O(n)$$ Bits (Q2942660) (← links)
- Common Developments of Three Incongruent Boxes of Area 30 (Q2948470) (← links)
- Box Pleating is Hard (Q2958099) (← links)
- Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces (Q2958100) (← links)
- Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns (Q2980895) (← links)
- Sequentially Swapping Colored Tokens on Graphs (Q2980931) (← links)
- Sliding Tokens on Block Graphs (Q2980933) (← links)
- ON COMPUTING LONGEST PATHS IN SMALL GRAPH CLASSES (Q3065608) (← links)
- Coverage with k-Transmitters in the Presence of Obstacles (Q3066439) (← links)
- Bipartite Permutation Graphs Are Reconstructible (Q3066471) (← links)
- BIPARTITE PERMUTATION GRAPHS ARE RECONSTRUCTIBLE (Q3166750) (← links)
- (Q3295662) (← links)
- Introduction to Computational Origami (Q3297849) (← links)
- Reconstruction Algorithm for Permutation Graphs (Q3404435) (← links)
- Competitive Diffusion on Weighted Graphs (Q3449840) (← links)
- Swapping Colored Tokens on Graphs (Q3449858) (← links)
- COMMON DEVELOPMENTS OF THREE INCONGRUENT ORTHOGONAL BOXES (Q3459362) (← links)
- Sliding Token on Bipartite Permutation Graphs (Q3459864) (← links)
- Scale Free Interval Graphs (Q3511437) (← links)
- SUBEXPONENTIAL INTERVAL GRAPHS GENERATED BY IMMIGRATION–DEATH PROCESSES (Q3564642) (← links)
- Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks (Q3575247) (← links)
- On the Complexity of Reconfiguration Problems (Q3596704) (← links)
- Bandwidth of Bipartite Permutation Graphs (Q3597883) (← links)
- Enumeration of Perfect Sequences of Chordal Graph (Q3597885) (← links)
- Random Generation and Enumeration of Proper Interval Graphs (Q3605496) (← links)
- Route-Enabling Graph Orientation Problems (Q3652228) (← links)
- Algorithmic Folding Complexity (Q3652233) (← links)
- Random Generation and Enumeration of Bipartite Permutation Graphs (Q3652296) (← links)
- (Q4253358) (← links)
- (Q4331284) (← links)
- (Q4373691) (← links)
