| * | 2009 |
|---|
| 9 | EE | Akihisa Kako,
Takao Ono,
Tomio Hirata,
Magnús M. Halldórsson:
Approximation algorithms for the weighted independent set problem in sparse graphs.
Discrete Applied Mathematics 157(4): 617-626 (2009) |
| 8 | EE | Ippei Koura,
Takao Ono,
Tomio Hirata:
A note on the Greedy algorithm for finding independent sets of Ck-free graphs.
Inf. Process. Lett. 109(10): 485-489 (2009) |
| 2007 |
|---|
| 7 | EE | Xuzhen Xie,
Mutsunori Yagiura,
Takao Ono,
Tomio Hirata,
Uri Zwick:
New Bounds for the Nearly Equitable Edge Coloring Problem.
ISAAC 2007: 280-291 |
| 6 | EE | Takao Ono,
Mutsunori Yagiura,
Tomio Hirata:
A Vector Assignment Approach for the Graph Coloring Problem.
LION 2007: 167-176 |
| 2005 |
|---|
| 5 | EE | Akihisa Kako,
Takao Ono,
Tomio Hirata,
Magnús M. Halldórsson:
Approximation Algorithms for the Weighted Independent Set Problem.
WG 2005: 341-350 |
| 1997 |
|---|
| 4 | EE | Takao Asano,
Kuniaki Hori,
Takao Ono,
Tomio Hirata:
A Theoretical Framework of Hybrid Approaches to MAX SAT.
ISAAC 1997: 153-162 |
| 1996 |
|---|
| 3 | EE | Takao Asano,
Takao Ono,
Tomio Hirata:
Approximation Algorithms for the Maximum Satisfiability Problem.
SWAT 1996: 100-111 |
| 2 | | Takao Asano,
Takao Ono,
Tomio Hirata:
Approximation Algorithms for the Maximum Satisfiability Problem.
Nord. J. Comput. 3(4): 388-404 (1996) |
| 1995 |
|---|
| 1 | EE | Takao Ono,
Tomio Hirata,
Takao Asano:
An Approximation Algorithm for MAX 3-SAT.
ISAAC 1995: 163-170 |
