| 2009 | ||
|---|---|---|
| 39 | Tomoko Izumi, Taisuke Izumi, Hirotaka Ono, Koichi Wada: Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem. COCOON 2009: 56-65 | |
| 38 | Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno: A Linear Time Algorithm for L(2, 1)-Labeling of Trees. ESA 2009: 35-46 | |
| 37 | Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono: Graph orientation to maximize the minimum weighted outdegree. IPDPS 2009: 1-8 | |
| 36 | Yoshiaki Nonaka, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita: How to Design a Linear Cover Time Random Walk on a Finite Graph. SAGA 2009: 104-116 | |
| 35 | Ei Ando, Hirotaka Ono, Masafumi Yamashita: A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems. SAGA 2009: 89-103 | |
| 34 | Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita: Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG. TAMC 2009: 98-107 | |
| 33 | Kazuhisa Makino, Hirotaka Ono: Deductive Inference for the Interiors and Exteriors of Horn Theories CoRR abs/0903.0422: (2009) | |
| 32 | Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno: An O(n1.75) algorithm for L(2, 1)-labeling of trees. Theor. Comput. Sci. 410(38-40): 3702-3710 (2009) | |
| 2008 | ||
| 31 | Yuichi Asahiro, Eiji Miyano, Hirotaka Ono: Graph Classes and the Complexity of the Graph Orientation Minimizing the Maximum Weighted Outdegree. CATS 2008: 97-106 | |
| 30 | Suguru Kawashimo, Yen Kaow Ng, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita: Speeding Up Local-Search Type Algorithms for Designing DNA Sequences under Thermodynamical Constraints. DNA 2008: 168-178 | |
| 29 | Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita: The space complexity of the leader election in anonymous networks. IPDPS 2008: 1-8 | |
| 28 | Yuta Harada, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita: The Balanced Edge Cover Problem. ISAAC 2008: 246-257 | |
| 27 | Kazuhisa Makino, Hirotaka Ono: Deductive Inference for the Interiors and Exteriors of Horn Theories. ISAAC 2008: 390-401 | |
| 26 | Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno: An Algorithm for L(2, 1)-Labeling of Trees. SWAT 2008: 185-197 | |
| 25 | 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 | 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 | Suguru Kawashimo, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita: Dynamic Neighborhood Searches for Thermodynamically Designing DNA Sequence. DNA 2007: 130-139 | |
| 22 | Kazuo Iwama, Eiji Miyano, Hirotaka Ono: Drawing Borders Efficiently. FUN 2007: 213-226 | |
| 21 | Yuichi Asahiro, Eiji Miyano, Toshihide Murata, Hirotaka Ono: On Approximation of Bookmark Assignments. MFCS 2007: 115-124 | |
| 20 | 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 | Yuichi Asahiro, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo: Graph Orientation Algorithms to Minimize the Maximum Outdegree. CATS 2006: 11-20 | |
| 18 | Suguru Kawashimo, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita: DNA Sequence Design by Dynamic Neighborhood Searches. DNA 2006: 157-171 | |
| 17 | Masashi Shiozaki, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita: A Probabilistic Model of the DNA Conformational Change. DNA 2006: 274-285 | |
| 16 | Yuichi Kurumida, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita: Forest Search: A Paradigm for Faster Exploration of Scale-Free Networks. ISPA 2006: 39-50 | |
| 15 | Yuichi Kurumida, Tsukasa Ogata, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita: A generic search strategy for large-scale real-world networks. Infoscale 2006: 2 | |
| 14 | 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 | Hirotaka Ono, Yen Kaow Ng: Best Fitting Fixed-Length Substring Patterns for a Set of Strings. COCOON 2005: 240-250 | |
| 12 | 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 | Yen Kaow Ng, Hirotaka Ono, Takeshi Shinohara: Measuring Over-Generalization in the Minimal Multiple Generalizations of Biosequences. Discovery Science 2005: 176-188 | |
| 10 | 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 | Yuichi Handa, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita: Neighborhood Composition: A Parallelization of Local Search Algorithms. PVM/MPI 2004: 155-163 | |
| 8 | Hirotaka Ono, Mutsunori Yagiura, Toshihide Ibaraki: A decomposability index in logical analysis of data. Discrete Applied Mathematics 142(1-3): 165-180 (2004) | |
| 7 | 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 | 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 | Hirotaka Ono, Mutsunori Yagiura, Toshihide Ibaraki: An Index for the Data Size to Extract Decomposable Structures in LAD. ISAAC 2001: 279-290 | |
| 2000 | ||
| 1 | Hirotaka Ono, Kazuhisa Makino, Toshihide Ibaraki: Logical Analysis of Data with Decomposable Structures. COCOON 2000: 396-406 | |