The following pages link to Takao Ono (Q987801):
Displayed 9 items.
- A note on the greedy algorithm for finding independent sets of \(C_k\)-free graphs (Q987802) (← links)
- Approximation algorithms for the weighted independent set problem in sparse graphs (Q1028454) (← links)
- (Q3129924) (← links)
- (Q4105757) (← links)
- Approximation algorithms for the maximum satisfiability problem (Q4375642) (← links)
- (Q4703908) (← links)
- An Efficient Algorithm for the Nearly Equitable Edge Coloring Problem (Q5301444) (← links)
- New Bounds for the Nearly Equitable Edge Coloring Problem (Q5387764) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5897568) (← links)