The following pages link to Hugo A. Akitaya (Q783035):
Displaying 40 items.
- The reach of axis-aligned squares in the plane (Q783038) (← links)
- Multi-colored spanning graphs (Q784473) (← links)
- Folding polyominoes with holes into a cube (Q827332) (← links)
- On the spanning and routing ratios of the directed \(\varTheta_6\)-graph (Q832828) (← links)
- The minimum moving spanning tree problem (Q832829) (← links)
- Recognizing weakly simple polygons (Q1688854) (← links)
- Pachinko (Q1699294) (← links)
- Distance measures for embedded graphs (Q1984601) (← links)
- Ununfoldable polyhedra with \(6\) vertices or \(6\) faces (Q2123289) (← links)
- On the spanning and routing ratios of the directed \(\Theta_6\)-graph (Q2144459) (← links)
- Snipperclips: cutting tools into desired polygons using themselves (Q2230404) (← links)
- Minimum weight connectivity augmentation for planar straight-line graphs (Q2272377) (← links)
- Infinite all-layers simple foldability (Q2308494) (← links)
- Universal reconfiguration of facet-connected modular robots by pivots: the \(O(1)\) musketeers (Q2663707) (← links)
- Circumscribing polygons and polygonizations for disjoint line segments (Q2671176) (← links)
- Negative instance for the edge patrolling beacon problem (Q2695468) (← links)
- Toward unfolding doubly covered \(n\)-stars (Q2695478) (← links)
- Box Pleating is Hard (Q2958099) (← links)
- Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs (Q2980910) (← links)
- Recognizing weakly simple polygons (Q3132840) (← links)
- Reconstruction of Weakly Simple Polygons from Their Edges (Q3177902) (← links)
- (Q4607898) (← links)
- Upward Partitioned Book Embeddings (Q4625113) (← links)
- (Q4636492) (← links)
- Recognizing Weak Embeddings of Graphs (Q4973046) (← links)
- Maximum Area Axis-Aligned Square Packings. (Q5005181) (← links)
- Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers (Q5075735) (← links)
- Unfolding simple folds from crease patterns (Q5078739) (← links)
- (Q5088936) (← links)
- Rigid foldability is NP-hard (Q5120145) (← links)
- Face flips in origami tessellations (Q5132647) (← links)
- Distance Measures for Embedded Graphs (Q5875622) (← links)
- (Q5881551) (← links)
- The Minimum Moving Spanning Tree Problem (Q5886031) (← links)
- How to fit a tree in a box (Q5915945) (← links)
- Reconfiguration of connected graph partitions via recombination (Q5925556) (← links)
- How to fit a tree in a box (Q5925577) (← links)
- Reconfiguration of connected graph partitions via recombination (Q5925672) (← links)
- Reconfiguration of connected graph partitions (Q6093138) (← links)
- (Q6179342) (← links)
