The following pages link to Tsuyoshi Yagita (Q782171):
Displaying 6 items.
- Reconfiguring \(k\)-path vertex covers (Q782172) (← links)
- Complexity of the maximum \(k\)-path vertex cover problem (Q1641128) (← links)
- Path cover problems with length cost (Q2154120) (← links)
- How to pack directed acyclic graphs into small blocks (Q2208351) (← links)
- Finding a maximum minimal separator: graph classes and fixed-parameter tractability (Q2661784) (← links)
- Path cover problems with length cost (Q6069927) (← links)