VLSI Algorithm for Euclidean Distance Transform

by Hirata, Tomio
Published 2004

Refined Computations for Points of the Form 2kP Based on Montgomery Trick

by HIRATA, Tomio, ADACHI, Daisuke
Published 2006

Approximation Algorithms for MAX SAT

by ONO, Takao, HIRATA, Tomio
Published 2000

An Improved Algorithm for the Net Assignment Problem

by HIRATA, Tomio, ONO, Takao
Published 2001

Inapproximability of the Edge-Contraction Problem

by HIRATA, Tomio, OTSUKI, Hideaki
Published 2006

Inapproximability of the Minimum Biclique Edge Partition Problem

by HIRATA, Tomio, OTSUKI, Hideaki
Published 2010

On Approximation Algorithms for Coloring k-Colorable Graphs

by HIRATA, Tomio, ONO, Takao, XIE, Xuzhen
Published 2003

Designing Efficient Geometric Search Algorithms Using Persistent Binary-Binary Search Trees

by INAGAKI, Yasuyoshi, HIRATA, Tomio, TAN, Xuehou
Published 1994

Efficient Routability Checking for Global Wires in Planar Layouts

by HIRATA, Tomio, KAWAGUCHI, Yasushi, ISO, Naoyuki
Published 1997

Approximation Algorithms for Weighted Independent Set Problem

by Hirata Laboratory, Hirata, Tomio, Ono, Takao, Xie, Xuzhen
Published 2005

平面配線可能性検証アルゴリズムの実現 (<特集>電子システムの設計技術と設計自動化)

by 磯, 直行, ISO, NAOYUKI, 平田, 富夫, HIRATA, TOMIO
Published 1999

効率の良いモルフォロジー演算が可能なフィルタ形状について

by 櫻井, 敦史, SAKURAI, ATSUSHI, 平田, 富夫, HIRATA, TOMIO
Published 2000

NEARLY EQUITABLE EDGE-COLORING PROBLEM

by Xie, Xuzhen, Ono, Takao, Nakao, Shin-ichi, Hirata, Tomio
Published 2006

An Improved Algorithm for the Nearly Equitable Edge-Coloring Problem

by HIRATA, Tomio, NAKANO, Shin-ichi, ONO, Takao, XIE, Xuzhen
Published 2004