A linear time algorithm for L(2,1)-labeling of trees (2009)
Hasunuma, Toru, Ishii, Toshimasa, Ono, Hirotaka, Uno, Yushi, 蓮沼, 徹, 石井, 利昌, ...
17th Annual European Symposium on Algorithms (ESA) : 7–9 September 2009 : IT University of Copenhagen
Izumi, Tomoko, Izumi, Taisuke, Ono, Hirotaka, Wada, Koichi, 泉, 朋子, 泉, 泰介, ...
Computing and Combinatorics, 15th Annual International Conference, COCOON : Niagara Falls, NY, USA, July 13-15, 2009
Deductive Inference for the Interiors and Exteriors of Horn Theories (2009)
Makino, Kazuhisa, Ono, Hirotaka
In this paper, we investigate the deductive inference for the interiors and exteriors of Horn knowledge bases, where the interiors and exteriors were introduced by Makino and Ibaraki to study...
Drawing Borders Efficiently (2009)
Iwama, Kazuo, Miyano, Eiji, Ono, Hirotaka, 岩間, 一雄, 宮野, 英次, 小野, 廣隆, ...
A spreadsheet, especially MS Excel, is probably one of the most popular software applications for personal-computer users and gives us convenient and user-friendly tools for drawing tables. Using...
Deductive Inference for the Interiors and Exteriors of Horn Theories (2008)
Makino, Kazuhisa, Ono, Hirotaka, 牧野, 和久, 小野, 廣隆, マキノ, カズヒサ, オノ, ヒロタカ
Deductive Inference for the Interiors and Exteriors of Horn Theories
A linear time algorithm for L(2,1)-labeling of trees (2008)
Hasunuma, Toru, Ishii, Toshimasa, Ono, Hirotaka, Uno, Yushi
An L(2,1)-labeling of a graph $G$ is an assignment $f$ from the vertex set $V(G)$ to the set of nonnegative integers such that $|f(x)-f(y)|\ge 2$ if $x$ and $y$ are adjacent and $|f(x)-f(y)|\ge 1$ if...
A linear time algorithm for L(2,1)-labeling of trees (2008)
Hasunuma, Toru, Ishii, Toshimasa, Ono, Hirotaka, Yushi, Uno, 蓮沼, 徹, 石井, 利昌, ...
An O(n^{1.75}) Algorithm for L(2,1)-labeling of Trees (2008)
Hasunuma, Toru, Ishii, Toshimasa, Ono, Hirotaka, Uno, Yushi, 蓮沼, 徹, 石井, 利昌, ...
Algorithm Theory - SWAT 2008, 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings
Graph Orientation Algorithms to (2008)
Minimize The Maximum, Yuichi Asahiro, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo
We study the problem of orienting the edges of a weighted graph such that the maximum weighted outdegree of vertices is minimized. This problem, which has applications in the guard arrangement for...
Kazuhisa Makino, Takashi Suda, Hirotaka Ono
are used as a convenient meanst explain given posit [ e examples andnegatE e examples, which is a form ofdat mining and knowledge discovery.StE#fl]b met# ods such as ID3 may providenon-monot85 [...
On Approximation of Bookmark Assignments (2007)
Asahiro, Yuichi, Miyano, Eiji, Murata, Toshihide, Ono, Hirotaka, 朝廣, 雄一, 宮野, 英次, ...
Mathematical Foundations of Computer Science 2007
Graph orientation algorithms to minimize the maximum outdegree (2007)
Asahiro, Yuichi, Miyano, Eiji, Ono, Hirotaka, Zenmyo, Kouhei, 朝廣, 雄一, 宮野, 英次, ...
A Generic Search Strategy for Large-Scale Real-World Networks (2006)
Kurumida, Yuichi, Ogata, Tsukasa, Ono, Hirotaka, Sadakane, Kunihiko, Yamashita, Masafumi, 来見田, 裕一, ...
ACM International Conference Proceeding Series; Vol. 152 : Article No. 2
Best Fitting Fixed-Length Substring Patterns for a Set of Strings (2005)
Ono, Hirotaka, Ng, Yen Kaow, 小野, 廣隆, オノ, ヒロタカ
Computing and Combinatorics
Neighborhood Composition: A Parallelization of Local Search Algorithms (2004)
Handa, Yuichi, Ono, Hirotaka, Sadakane, Kunihiko, Yamashita, Masafumi, 半田, 祐一, 小野, 廣隆, ...
Recent Advances in Parallel Virtual Machine and Message Passing Interface
A faster algorithm for two-variable integer programming (2003)
Eisenbrand, Friedrich, Laue, Soeren, Ibaraki, Toshihide, Katoh, Naoki, Ono, Hirotaka
We show that a 2-variable integer program, defined by $m$ constraints involving coefficients with at most $\varphi$ bits can be solved with $O(m + \varphi)$ arithmetic operations on rational numbers...