The following pages link to Yushi Uno (Q290104):
Displaying 50 items.
- (Total) vector domination for graphs with bounded branchwidth (Q290105) (← links)
- Mining preserving structures in a graph sequence (Q344786) (← links)
- UNO is hard, even for a single player (Q389942) (← links)
- The \((p,q)\)-total labeling problem for trees (Q408175) (← links)
- A tight upper bound on the (\(2,1\))-total labeling number of outerplanar graphs (Q450562) (← links)
- Morpion solitaire 5D: a new upper bound of 121 on the maximum score (Q509879) (← links)
- Hanabi is NP-hard, even for cheaters who look at their cards (Q528493) (← links)
- On the complexity of reconfiguration problems (Q631762) (← links)
- An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees (Q837161) (← links)
- Minimum edge ranking spanning trees of split graphs (Q860397) (← links)
- A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares (Q902421) (← links)
- Laminar structure of ptolemaic graphs with applications (Q1028126) (← links)
- Threes!, Fives, 1024!, and 2048 are hard (Q1623263) (← links)
- An integer programming approach to solving Tantrix on fixed boards (Q1736504) (← links)
- Swapping colored tokens on graphs (Q1749531) (← links)
- Subexponential fixed-parameter algorithms for partial vector domination (Q1751177) (← links)
- Symmetric assembly puzzles are hard, beyond a few pieces (Q2206733) (← links)
- A 4.31-approximation for the geometric unique coverage problem on unit disks (Q2250456) (← links)
- Reconfiguring undirected paths (Q2285101) (← links)
- Twenty years of progress of \(\mathrm{JCDCG}^3\) (Q2308489) (← links)
- Settlement fund circulation problem (Q2312652) (← links)
- A linear time algorithm for \(L(2,1)\)-labeling of trees (Q2375957) (← links)
- Parameterized edge Hamiltonicity (Q2413968) (← links)
- Approximating the path-distance-width for AT-free graphs and graphs in related classes (Q2442209) (← links)
- Folding a paper strip to minimize thickness (Q2634713) (← links)
- Packing cube nets into rectangles with \(O(1)\) holes (Q2695481) (← links)
- On Minimum Edge Ranking Spanning Trees (Q2729646) (← links)
- On Complexity of Flooding Games on Graphs with Interval Representations (Q2864330) (← links)
- A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares (Q2904540) (← links)
- Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces (Q2958100) (← links)
- The (2,1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2 (Q3000498) (← links)
- Contracted Webgraphs: Structure Mining and Scale-Freeness (Q3004682) (← links)
- The (p,q)-total Labeling Problem for Trees (Q3060760) (← links)
- ON COMPUTING LONGEST PATHS IN SMALL GRAPH CLASSES (Q3065608) (← links)
- Approximability of the Path-Distance-Width for AT-free Graphs (Q3104783) (← links)
- Subexponential Fixed-Parameter Algorithms for Partial Vector Domination (Q3195339) (← links)
- Mining Preserving Structures in a Graph Sequence (Q3196368) (← links)
- Swapping Colored Tokens on Graphs (Q3449858) (← links)
- An $\mbox{O}(n^{1.75})$ Algorithm for L(2,1)-Labeling of Trees (Q3512458) (← links)
- Web Structure Mining by Isolated Stars (Q3520041) (← links)
- On the Complexity of Reconfiguration Problems (Q3596704) (← links)
- A Linear Time Algorithm for L(2,1)-Labeling of Trees (Q3639233) (← links)
- (Q4427863) (← links)
- A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks (Q4909554) (← links)
- Settlement Fund Circulation Problem (Q5136266) (← links)
- Folding a Paper Strip to Minimize Thickness (Q5176577) (← links)
- (Q5282800) (← links)
- Threes!, Fives, 1024!, and 2048 are Hard (Q5282820) (← links)
- (Total) Vector Domination for Graphs with Bounded Branchwidth (Q5405043) (← links)
- Algorithms and Computation (Q5712173) (← links)
