Hirotaka Ono

Assistant Professor

Theoretical Computer Science Group,
Department of Computer Science and Communication Engineering
Graduate School of Information Science and Electrical Engineering
Kyushu University
744, Motooka, Nishi-ku, Fukuoka, 819-0395, Japan
Phone: +81-92-802-3637
e-mail: ono@csce.kyushu-u.ac.jp

 My photo
Japanese version is here.
Research Interests:

Selected Publications

Journal

  1. Y. Asahiro, J. Jansson, E. Miyano, H. Ono and Z. Kouhei, Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree, Journal of Combinatorial Optimization.

  2. Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno, An O(n^{1.75}) Algorithm for L(2,1)-labeling of Trees, Theoretical Computer Science, Vol. 410, pp. 3702-3710, 2009. (PDF)

  3. Ei Ando, Hirotaka Ono, Kunihiko Sadakane and Masafumi Yamashita, The Space Complexity of Leader Election in Anonymous Networks, to appear in International Journal of Foundation of Computer Science.

  4. Kazuo Iwama, Eiji Miyano and Hirotaka Ono, Drawing Borders Efficiently, Theory of Computing Systems, Vol. 44, No. 2, pp. 230-244, February 2009. (PDF)QIR

  5. Yuta Harada, Hirotaka Ono, Kunihiko Sadakane, and Masafumi Yamashita, Optimal Balanced Semi-Matchings for Weighted Bipartite Graphs, IPSJ Journal, Vol. 48 No. 10, 2007.

  6. Yuichi Asahiro, Eiji Miyano, Hirotaka Ono and Kouhei Zenmyo, Graph orientation algorithms to minimize the maximum outdegree, International Journal of Foundation of Computer Science, Vol. 18, No. 2, pp. 197--216, April 2007.

  7. Yuichi Asahiro, Takashi Horiyama, Kazuhisa Makino, Hirotaka Ono, Toshinori Sakuma, and Masafumi Yamashita, How to Collect Balls Moving in the Euclidean Plane Discrete Applied Mathematics, Vol 154, no. 16, pp. 2247--2262, 2006.

  8. Hirotaka Ono, Mutsunori Yagiura and Toshihide Ibaraki, A Decomposability Index in Logical Analysis of Data, Discrete Applied Mathematics, vol 142, no. 1-3, pp.165--180, 2004.

  9. Kazuhisa Makino, Hirotaka Ono and Toshihide Ibaraki, Interior and exterior functions of positive Boolean functions, Discrete Applied Mathematics, Vol 130 no. 3, pp.417--436, 2003.

  10. Hirotaka Ono, Kazuhisa Makino and Toshihide Ibaraki, Logical analysis of data with decomposable structures, Theoretical Computer Science, Vol 289, pp. 977--995, 2002.

  11. Kazuhisa Makino, Takashi Suda, Hirotaka Ono and Toshihide Ibaraki, Data analysis by positive decision trees, IEICE Transactions on Information and Systems, Vol. E82-D, No.1, pp. 76-88, January 1999.

Conference Proceedings (Reviewed)

  1. Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno, A linear time algorithm for L(2,1)-labeling of trees, to appear in Proceedings of ESA 2009.

  2. Tomoko Izumi, Taisuke Izumi, Hirotaka Ono and Koichi Wada, Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem, to appear in Proceedings of COCOON 2009. (pdf, QIR)

  3. Ei Ando, Hirotaka Ono, Kunihiko Sadakane and Masafumi Yamashita, Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG, to appear in Proceedings of TAMC 2009.

  4. Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Graph Orientation to Maximize the Minimum Weighted Outdegree, to appear in Proceedings of 11th Workshop on Advances in Parallel and Distributed Computational Models, IPDPS 2009, APDCM2009.

  5. Kazuhisa Makino and Hirotaka Ono. Deductive Inference for the Interiors and Exteriors of Horn Theories, Lecture Notes in Computer Science 5369, the Proceedings of Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, pp. 390--401, 2008. QIR

  6. Yuta Harada, Hirotaka Ono, Kunihiko Sadakane and Masafumi Yamashita. The Balanced Edge Cover Problem, Lecture Notes in Computer Science 5369, the Proceedings of Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, pp. 246--257, 2008.

  7. Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono and Yushi Uno, An O(n^{1.75}) Algorithm for L(2,1)-labeling of Trees, Lecture Notes in Computer Science 5124, Proceedings of 11th Scandinavian Workshop on Algorithm Theory (SWAT 2008), pp. 185--197, July 2008. (pdf)

  8. S. Kawashimo, Y.K. Ng, H. Ono, K. Sadakane, M. Yamashita, Speeding up Local-Search type Algorithms for Designing DNA Sequences under Thermodynamical Constraints, Proceedings of the 14th International Meeting on DNA Computing (June 2-6, 2008, Prague, Czech Republic), pp. 152--161, June 2008. (Lecture Notes in Computer Science 5347, Revised Selected Paper of the 14th International Meeting of DNA Computing (June 2-6, 2008, Prague, Czech Republic), DNA14, pp. 168--179, 2009.)

  9. Ei Ando, Hirotaka Ono, Kunihiko Sadakane and Masafumi Yamashita, The Space Complexity of the Leader Election in Anonymous Networks, CD-ROM, Proceedings of 10th Workshop on Advances in Parallel and Distributed Computational Models, April, 2008.

  10. Y. Asahiro, E. Miyano and H. Ono, Graph Classes and the Complexity of the Graph Orientation Minimizing the Maximum Weighted Outdegree, Proceedings of Computing: the Twelfth Australasian Theory Symposium (CATS 2008), Wollongong, NSW, Australia. CRPIT, 77. Harland, J. and Manyem, P., Eds., ACS. 97-106, January 2008.

  11. Y. Asahiro, E. Miyano, T. Murata and H. Ono, On Approximation of Bookmark Assignments, Lecture Notes in Computer Science 4708, Proceedings of 32nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2007), pp115--124, August 2007.

  12. S. Kawashimo, H. Ono, K. Sadakane, M. Yamashita, Dynamic Neighborhood Searches for Thermodynamically Designing DNA Sequence, to appear in Proceedings of the 13th International Meeting on DNA Computing (June 4-8, 2007, Memphis, Tennessee).

  13. K. Iwama, E. Miyano and H. Ono, Drawing Borders Efficiently, Lecture Notes in Computer Science 4475, Proceedings of Fourth International Conference on FUN WITH ALGORITHMS (FUN 2007), pp. 213--226, June 2007.

  14. Y. Asahiro, J. Jansson, E. Miyano, H. Ono and Z. Kouhei, Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree, Lecture Notes in Computer Science, 4508, Proceedings of The Third International Conference on Algorithmic Aspects in Information and Management (AAIM 2007), pp. 167--177, June 2007.

  15. Y. Kurumida, H. Ono, K. Sadakane and M. Yamashita, Forest Search: A Paradigm for Faster Exploration of Scale-Free Networks, Lecture Notes in Computer Science, 4330, Proceedings of Parallel and Distributed Processing and Applications, 4th International Symposium, ISPA 2006, pp. 39-50, Dec. 2006.

  16. Masashi Shiozaki, Hirotaka Ono, Kunihiko Sadakane and Masafumi Yamashita, A Probabilistic Model of DNA Conformational Change, Preproceedings of the 12th International Meeting on DNA Computing, DNA12, . (Also in Revised Selected Papers of the 12th International Meeting on DNA Computing, DNA12, Lecture Notes in Computer Science, 4287, pp. 274--285.

  17. Suguru Kawashimo, Hirotaka Ono, Kunihiko Sadakane and Masafumi Yamashita, DNA Sequence Design by Dynamic Neighborhood Searches, Preproceedings of the 12th International Meeting on DNA Computing, DNA12, to appear. (Also in Revised Selected Papers of the 12th International Meeting on DNA Computing, DNA12, Lecture Notes in Computer Science, 4287, pp. 157--171.

  18. Y. Kurumida, T. Ogata, H. Ono, K. Sadakane, M. Yamashita, A Generic Search Strategy for Large Scale Real World Networks, Proceedings of First International Conference on Scalable Information Systems (INFOSCALE), 2006. (PDF)QIR

  19. Y. Asahiro, E. Miyano, H. Ono, and K. Zenmyo Graph orientation algorithms to minimize the maximum outdegree , Proceedings of Computing: the Twelfth Australasian Theory Symposium (CATS 2006), pp. 11--20, 2006.

  20. Y. K. Ng, H. Ono, T. Shinohara. Measuring Over-generalization in the Minimal Multiple Generalizations of Biosequences, Lecture Notes in Artificial Intelligence, 3735, Proceedings of Discovery Science, 8th International Conference, DS 2005, Singapore, pp. 176--188, October 2005.

  21. Hirotaka Ono and Yen Kaow Ng. Best Fitting Fixed-Length Substring Patterns for a Set of Strings , Lecture Notes in Computer Science, 3595, the Proceedings of Computing and Combinatorics, 11th Annual International Conference, COCOON2005 Kunming, China, August 2005, pp. 240-250.

  22. T. Takeda, H. Ono, K. Sadakane and M.Yamashita, A Local Search Based Barrier Height Estimation Algorithm for DNA Molecular Transitions, Preproceedings of the 11th International Meeting on DNA Computing, DNA11, London, ON, Canada, June 2005 pp. 354-365. (Also in Revised Selected Papers of the 11th International Meeting on DNA Computing, DNA11, Lecture Notes in Computer Science, 3892, pp. 359--370.

  23. Shay Kutten, Hirotaka Ono, David Peleg, Kunihiko Sadakane and Masafumi Yamashita, Energy-Optimal Online Algorithms for Broadcasting in Wireless Networks, 2nd International Conference on Wireless on Demand Network Systems and Service WONS 2005, pp. 125-130, Jan. 2005.

  24. Yuichi Handa, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita, Neighborhood Composition: A Parallelization of Local Search Algorithms, Lecture Notes in Computer Science, 3241, 11th European PVM/MPI Users' Group Meeting, EuroPVM/MPI 2004, pp. 155--163, Sept. 2004. (PDF)QIR

  25. Y. Asahiro, T. Horiyama, K. Makino, H. Ono, T. Sakuma, and M. Yamashita, How to Collect Balls Moving in the Euclidean Plane Proc. Computing: The Australasian Theory Symposium (CATS), pp.1-16, Jan. 2004. (ps.gz)(Electronic Notes in Theoretical Computer Science, Volume 91, pp. 229-245.)

  26. H. C. Lau, Q. Z. Liu and H. Ono, Integrating Local Search and Network Flow to Solve the Inventory Routing Problem, Proc. 19th National Conf. on Artificial Intelligence (AAAI), Edmonton, Canada, July 2002, pp. 9-14. (PDF)

  27. H. Ono, M. Yagiura and T. Ibaraki, An Index for the Data Size to Extract Decomposable Structures in LAD , Lecture Notes in Computer Science, 2223, the Proceedings of Algorithms and Computation, 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 2001, pp. 279-290.

  28. H. Ono, K. Makino and T. Ibaraki, Logical Analysis of Data with Decomposable Structures, Lecture Notes in Computer Science, 1858, the Proceedings of Computing and Combinatorics, 6th Annual International Conference, COCOON2000 Sydney, Australia, July 2000, pp. 396-406.

Working Paper (Technical Report)

  1. Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno, A linear time algorithm for L(2,1)-labeling of trees, arXiv:0810.0906
GOTCS group's page
Hirotaka Ono(ono @ csce.kyushu-u.ac.jp)
Last Update: 2008.02.19
persons visit this page, since 25/6/2002.