Takao Ono - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 12 from 12

2021

Drift Suppression of Solution-Gated Graphene Field-Effect Transistors by Cation Doping for Sensing PlatformsNaruto Miyakawa, Ayumi Shinagawa, Yasuko Kajiwara, Shota Ushiba, Takao Ono, Yasushi Kanai, Shinsuke Tani, Masahiko Kimura, Kazuhiko Matsumoto. sensors, 21(22):7455, 2021. [doi]

2009

Approximation algorithms for the weighted independent set problem in sparse graphsAkihisa Kako, Takao Ono, Tomio Hirata, MagnÃºs M. HalldÃ³rsson. DAM, 157(4):617-626, 2009. [doi]

A note on the Greedy algorithm for finding independent sets of C::k::-free graphsIppei Koura, Takao Ono, Tomio Hirata. ipl, 109(10):485-489, 2009. [doi]

2008

An Efficient Algorithm for the Nearly Equitable Edge Coloring ProblemXuzhen Xie, Mutsunori Yagiura, Takao Ono, Tomio Hirata, Uri Zwick. jgaa, 12(4):383-399, 2008. [doi]

2007

A Vector Assignment Approach for the Graph Coloring ProblemTakao Ono, Mutsunori Yagiura, Tomio Hirata. lion 2008: 167-176 [doi]

New Bounds for the Nearly Equitable Edge Coloring ProblemXuzhen Xie, Mutsunori Yagiura, Takao Ono, Tomio Hirata, Uri Zwick. isaac 2007: 280-291 [doi]

2005

Approximation Algorithms for the Weighted Independent Set ProblemAkihisa Kako, Takao Ono, Tomio Hirata, Magnús M. Halldórsson. criwg 2005: 341-350 [doi]

2003

k-Colorable GraphsXuzhen Xie, Takao Ono, Tomio Hirata. ieiceta, 86-A(5):1046-1051, 2003. [doi]

1997

A Theoretical Framework of Hybrid Approaches to MAX SATTakao Asano, Kuniaki Hori, Takao Ono, Tomio Hirata. isaac 1997: 153-162

1996

Approximation Algorithms for the Maximum Satisfiability ProblemTakao Asano, Takao Ono, Tomio Hirata. swat 1996: 100-111

Approximation Algorithms for the Maximum Satisfiability ProblemTakao Asano, Takao Ono, Tomio Hirata. njc, 3(4):388-404, 1996.

1995

An Approximation Algorithm for MAX 3-SATTakao Ono, Tomio Hirata, Takao Asano. isaac 1995: 163-170

Sign in or sign up to see more results.

runs on WebDSL