The following pages link to Yoichi Iwata (Q897877):
Displaying 14 items.
- Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover (Q897878) (← links)
- Improved analysis of highest-degree branching for feedback vertex set (Q2041981) (← links)
- Half-integrality, LP-branching, and FPT Algorithms (Q2816829) (← links)
- A Faster Algorithm for Dominating Set Analyzed by the Potential Method (Q2891336) (← links)
- Exact and Approximation Algorithms for the Maximum Constraint Satisfaction Problem over the Point Algebra (Q2957877) (← links)
- Fast Dynamic Graph Algorithms for Parameterized Problems (Q3188899) (← links)
- On the Power of Tree-Depth for Fully Polynomial FPT Algorithms (Q3304140) (← links)
- On the Equivalence among Problems of Bounded Width (Q3452838) (← links)
- Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP (Q5075760) (← links)
- (Q5111399) (← links)
- Fast Shortest-path Distance Queries on Road Networks by Pruned Highway Labeling (Q5232501) (← links)
- Branch-and-Reduce Exponential/FPT Algorithms in Practice: A Case Study of Vertex Cover (Q5232523) (← links)
- Linear-Time FPT Algorithms via Network Flow (Q5384089) (← links)
- (Q5875556) (← links)