2009 |
31 | EE | Kazuhisa Makino,
Hirotaka Ono:
Deductive Inference for the Interiors and Exteriors of Horn Theories
CoRR abs/0903.0422: (2009) |
2008 |
30 | EE | Yuichi Asahiro,
Eiji Miyano,
Hirotaka Ono:
Graph Classes and the Complexity of the Graph Orientation Minimizing the Maximum Weighted Outdegree.
CATS 2008: 97-106 |
29 | EE | Ei Ando,
Hirotaka Ono,
Kunihiko Sadakane,
Masafumi Yamashita:
The space complexity of the leader election in anonymous networks.
IPDPS 2008: 1-8 |
28 | EE | Yuta Harada,
Hirotaka Ono,
Kunihiko Sadakane,
Masafumi Yamashita:
The Balanced Edge Cover Problem.
ISAAC 2008: 246-257 |
27 | EE | Kazuhisa Makino,
Hirotaka Ono:
Deductive Inference for the Interiors and Exteriors of Horn Theories.
ISAAC 2008: 390-401 |
26 | EE | Toru Hasunuma,
Toshimasa Ishii,
Hirotaka Ono,
Yushi Uno:
An Algorithm for L(2, 1)-Labeling of Trees.
SWAT 2008: 185-197 |
25 | EE | Toru Hasunuma,
Toshimasa Ishii,
Hirotaka Ono,
Yushi Uno:
A linear time algorithm for L(2,1)-labeling of trees
CoRR abs/0810.0906: (2008) |
2007 |
24 | EE | Yuichi Asahiro,
Jesper Jansson,
Eiji Miyano,
Hirotaka Ono,
Kouhei Zenmyo:
Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree.
AAIM 2007: 167-177 |
23 | EE | Suguru Kawashimo,
Hirotaka Ono,
Kunihiko Sadakane,
Masafumi Yamashita:
Dynamic Neighborhood Searches for Thermodynamically Designing DNA Sequence.
DNA 2007: 130-139 |
22 | EE | Kazuo Iwama,
Eiji Miyano,
Hirotaka Ono:
Drawing Borders Efficiently.
FUN 2007: 213-226 |
21 | EE | Yuichi Asahiro,
Eiji Miyano,
Toshihide Murata,
Hirotaka Ono:
On Approximation of Bookmark Assignments.
MFCS 2007: 115-124 |
20 | EE | Yuichi Asahiro,
Eiji Miyano,
Hirotaka Ono,
Kouhei Zenmyo:
Graph Orientation Algorithms to minimize the Maximum Outdegree.
Int. J. Found. Comput. Sci. 18(2): 197-215 (2007) |
2006 |
19 | EE | Yuichi Asahiro,
Eiji Miyano,
Hirotaka Ono,
Kouhei Zenmyo:
Graph Orientation Algorithms to Minimize the Maximum Outdegree.
CATS 2006: 11-20 |
18 | EE | Suguru Kawashimo,
Hirotaka Ono,
Kunihiko Sadakane,
Masafumi Yamashita:
DNA Sequence Design by Dynamic Neighborhood Searches.
DNA 2006: 157-171 |
17 | EE | Masashi Shiozaki,
Hirotaka Ono,
Kunihiko Sadakane,
Masafumi Yamashita:
A Probabilistic Model of the DNA Conformational Change.
DNA 2006: 274-285 |
16 | EE | Yuichi Kurumida,
Hirotaka Ono,
Kunihiko Sadakane,
Masafumi Yamashita:
Forest Search: A Paradigm for Faster Exploration of Scale-Free Networks.
ISPA 2006: 39-50 |
15 | EE | Yuichi Kurumida,
Tsukasa Ogata,
Hirotaka Ono,
Kunihiko Sadakane,
Masafumi Yamashita:
A generic search strategy for large-scale real-world networks.
Infoscale 2006: 2 |
14 | EE | Yuichi Asahiro,
Takashi Horiyama,
Kazuhisa Makino,
Hirotaka Ono,
Toshinori Sakuma,
Masafumi Yamashita:
How to collect balls moving in the Euclidean plane.
Discrete Applied Mathematics 154(16): 2247-2262 (2006) |
2005 |
13 | EE | Hirotaka Ono,
Yen Kaow Ng:
Best Fitting Fixed-Length Substring Patterns for a Set of Strings.
COCOON 2005: 240-250 |
12 | EE | Tsutomu Takeda,
Hirotaka Ono,
Kunihiko Sadakane,
Masafumi Yamashita:
A Local Search Based Barrier Height Estimation Algorithm for DNA Molecular Transitions.
DNA 2005: 359-370 |
11 | EE | Yen Kaow Ng,
Hirotaka Ono,
Takeshi Shinohara:
Measuring Over-Generalization in the Minimal Multiple Generalizations of Biosequences.
Discovery Science 2005: 176-188 |
10 | EE | Shay Kutten,
Hirotaka Ono,
David Peleg,
Kunihiko Sadakane,
Masafumi Yamashita:
Energy-Optimal Online Algorithms for Broadcasting in Wireless Networks.
WONS 2005: 125-130 |
2004 |
9 | EE | Yuichi Handa,
Hirotaka Ono,
Kunihiko Sadakane,
Masafumi Yamashita:
Neighborhood Composition: A Parallelization of Local Search Algorithms.
PVM/MPI 2004: 155-163 |
8 | EE | Hirotaka Ono,
Mutsunori Yagiura,
Toshihide Ibaraki:
A decomposability index in logical analysis of data.
Discrete Applied Mathematics 142(1-3): 165-180 (2004) |
7 | EE | Yuichi Asahiro,
Takashi Horiyama,
Kazuhisa Makino,
Hirotaka Ono,
Toshinori Sakuma,
Masafumi Yamashita:
How to Collect Balls Moving in the Euclidean Plane.
Electr. Notes Theor. Comput. Sci. 91: 229-245 (2004) |
2003 |
6 | | Toshihide Ibaraki,
Naoki Katoh,
Hirotaka Ono:
Algorithms and Computation, 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings
Springer 2003 |
5 | EE | Kazuhisa Makino,
Hirotaka Ono,
Toshihide Ibaraki:
Interior and exterior functions of positive Boolean functions.
Discrete Applied Mathematics 130(3): 417-436 (2003) |
2002 |
4 | | Hoong Chuin Lau,
Qi Zhang Liu,
Hirotaka Ono:
Integrating Local Search and Network Flow to Solve the Inventory Routing Problem.
AAAI/IAAI 2002: 9-14 |
3 | | Hirotaka Ono,
Kazuhisa Makino,
Toshihide Ibaraki:
Logical analysis of data with decomposable structures.
Theor. Comput. Sci. 289(2): 977-995 (2002) |
2001 |
2 | EE | Hirotaka Ono,
Mutsunori Yagiura,
Toshihide Ibaraki:
An Index for the Data Size to Extract Decomposable Structures in LAD.
ISAAC 2001: 279-290 |
2000 |
1 | EE | Hirotaka Ono,
Kazuhisa Makino,
Toshihide Ibaraki:
Logical Analysis of Data with Decomposable Structures.
COCOON 2000: 396-406 |