The following pages link to Yusuke Kobayashi (Q273162):
Displaying 21 items.
- A strongly polynomial time algorithm for the maximum supply rate problem on trees (Q5919326) (← links)
- Diameter of colorings under Kempe changes (Q5919442) (← links)
- Linear-time recognition of double-threshold graphs (Q5970798) (← links)
- Fixed-parameter algorithms for graph constraint logic (Q6041672) (← links)
- Reconfiguration of spanning trees with degree constraints or diameter constraints (Q6053473) (← links)
- Feedback vertex set reconfiguration in planar graphs (Q6057837) (← links)
- On reachable assignments under dichotomous preferences (Q6057838) (← links)
- (Q6087211) (← links)
- (Q6089660) (← links)
- Reconfiguration of spanning trees with degree constraint or diameter constraint (Q6490966) (← links)
- EFX allocations for indivisible chores: matching-based approach (Q6546298) (← links)
- Envy-free relaxations for goods, chores, and mixed items (Q6548959) (← links)
- Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams (Q6575130) (← links)
- One-face shortest disjoint paths with a deviation terminal (Q6602472) (← links)
- Proportional allocation of indivisible goods up to the least valued good on average (Q6602481) (← links)
- Reconfiguration of colorings in triangulations of the sphere (Q6620535) (← links)
- Rerouting planar curves and disjoint paths (Q6638084) (← links)
- Hardness of finding combinatorial shortest paths on graph associahedra (Q6638085) (← links)
- EFX allocations for indivisible chores: matching-based approach (Q6658304) (← links)
- Finding Spanning Trees with Perfect Matchings (Q6735012) (← links)
- On the two problems in Ramsey achievement games (Q6739138) (← links)
