The following pages link to Katsuhisa Yamanaka (Q407551):
Displaying 35 items.
- A compact encoding of plane triangulations with efficient query supports (Q407553) (← links)
- Random generation and enumeration of bipartite permutation graphs (Q414425) (← links)
- Efficient enumeration of ordered trees with \(k\) leaves (Q441889) (← links)
- Efficient enumeration of all ladder lotteries and its application (Q964388) (← links)
- Floorplans with columns (Q1699755) (← links)
- Swapping colored tokens on graphs (Q1749531) (← links)
- More routes for evacuation (Q1790955) (← links)
- Algorithmic enumeration of surrounding polygons (Q1983143) (← links)
- A polynomial delay algorithm for enumerating 2-edge-connected induced subgraphs (Q2037960) (← links)
- Floorplans with walls (Q2110694) (← links)
- Efficient segment folding is hard (Q2123292) (← links)
- Parameterized complexity of independent set reconfiguration problems (Q2192091) (← links)
- Optimal reconfiguration of optimal ladder lotteries (Q2227490) (← links)
- Swapping labeled tokens on graphs (Q2347003) (← links)
- Approximating the path-distance-width for AT-free graphs and graphs in related classes (Q2442209) (← links)
- The Complexity of Induced Tree Reconfiguration Problems (Q2798731) (← links)
- Sequentially Swapping Colored Tokens on Graphs (Q2980931) (← links)
- Approximability of the Path-Distance-Width for AT-free Graphs (Q3104783) (← links)
- Competitive Diffusion on Weighted Graphs (Q3449840) (← links)
- Swapping Colored Tokens on Graphs (Q3449858) (← links)
- Enumeration, Counting, and Random Generation of Ladder Lotteries (Q3452576) (← links)
- Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract) (Q3605493) (← links)
- Random Generation and Enumeration of Proper Interval Graphs (Q3605496) (← links)
- Listing All Plane Graphs (Q3627962) (← links)
- Random Generation and Enumeration of Bipartite Permutation Graphs (Q3652296) (← links)
- Sequentially Swapping Colored Tokens on Graphs (Q4622769) (← links)
- Recent Developments in Floorplan Representations (Q5135264) (← links)
- On the Parameterized Complexity for Token Jumping on Graphs (Q5410654) (← links)
- A Compact Encoding of Rectangular Drawings with Efficient Query Supports (Q5434424) (← links)
- A Compact Encoding of Plane Triangulations with Efficient Query Supports (Q5452159) (← links)
- Listing All Plane Graphs (Q5452167) (← links)
- Sorting balls and water: equivalence and computational complexity (Q6050130) (← links)
- Enumerating floorplans with walls (Q6143840) (← links)
- Sorting balls and water: equivalence and computational complexity (Q6540585) (← links)
- Efficient enumeration of transversal edge-partitions (Q6657235) (← links)
