業績一覧

目次

   [査読付き学術論文]    [査読付き会議論文]    [その他の論文]    [学位論文]

査読付き学術論文

[目次]

  1. Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki, and Youcef Tebbal. The complexity of dominating set reconfiguration. Theoretical Computer Science, Vol. 651, pp. 37 -- 49, (2016).
    [link]

  2. Toshimasa Ishii, Hirotaka Ono, and Yushi Uno. Subexponential fixed-parameter algorithms for partial vector domination. Discrete Optimization, Vol. 22, Part A, pp. 111 -- 121, (2016). SI: \{ISCO\} 2014.
    [link]

  3. Toshimasa Ishii, Hirotaka Ono, and Yushi Uno. (Total) Vector domination for graphs with bounded branchwidth. Discrete Applied Mathematics, Vol. 207, pp. 80 -- 89, (2016).
    [link]

  4. Yuichi Asahiro, Jesper Jansson, Eiji Miyano, and Hirotaka Ono. Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation. Theory of Computing Systems, Vol. 58, No. 1, pp. 60--93, (2016).
    [link]

  5. Yen Kaow Ng, Linzhi Yin, Hirotaka Ono, and Shuai Cheng Li. Finding All Longest Common Segments in Protein Structures Efficiently. IEEE/ACM Transactions on Computational Biology and Bioinformatics, Vol. 12, No. 03, pp. 644--655, (2015).

  6. Yuichi Asahiro, Jesper Jansson, Eiji Miyano, and Hirotaka Ono. Graph Orientations Optimizing the Number of Light or Heavy Vertices. Journal of Graph Algorithms and Applications, Vol. 19, No. 1, pp. 441--465, (2015).

  7. Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, and Takeshi Yamada. Linear-time algorithm for sliding tokens on trees. Theoretical Computer Science, Vol. 600, pp. 132 -- 142, (2015).
    [link]

  8. Dariusz Dereniowski, Hirotaka Ono, Ichiro Suzuki, Lukasz Wrona, Masafumi Yamashita, and Pawel Zylinski. The searchlight problem for road networks. Theoretical Computer Science, Vol. 591, pp. 28 -- 59, (2015).
    [link]

  9. Nao Fujinaga, Yukiko Yamauchi, Hirotaka Ono, Shuji Kijima, and Masafuji Yamashita. Pattern Formation By Oblivious Asynchronous Mobile Robots. SIAM Journal on Computing, Vol. 44, No. 3, pp. 740--785, (2015).
    [link]

  10. Kazuya Haraguchi and Hirotaka Ono. How Simple Algorithms Can Solve Latin Square Completion-Type Puzzles Approximately. Journal of Information Processing, Vol. 23, No. 3, pp. 276--283, (2015).

  11. Taisuke Izumi, Tomoko Izumi, Hirotaka Ono, and Koichi Wada. Approximability of minimum certificate dispersal with tree structures. Theoretical Computer Science, Vol. 591, pp. 5 -- 14, (2015).
    [link]

  12. Jun Hosoda, Juraj Hromkovi{\v{c}}, Taisuke Izumi, Hirotaka Ono, Monika Steinov{\'a}, and Koichi Wada. Corrigendum to On the approximability and hardness of minimum topic connected overlay and its special instances in Theoret. Comput. Sci. 429 (2012) 144--154]. Theoretical Computer Science, Vol. 562, pp. 660--661, (2015).

  13. Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, and Yushi Uno. Algorithmic aspects of distance constrained labeling: a survey. International Journal of Networking and Computing, Vol. 4, No. 2, pp. 251--259, (2014).

  14. Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, and Takeaki Uno. Base-object location problems for base-monotone regions. Theoretical Computer Science, Vol. 555, pp. 71--84, (2014).

  15. Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, and Koichi Yamazaki. Approximating the path-distance-width for AT-free graphs and graphs in related classes. Discrete Applied Mathematics, Vol. 168, pp. 69--77, (2014).

  16. Takehiro Ito, Kazuto Kawamura, Hirotaka Ono, and Xiao Zhou. Reconfiguration of list L (2, 1)-labelings in a graph. Theoretical Computer Science, Vol. 544, pp. 84--97, (2014).

  17. Yuichi Asahiro, Eiji Miyano, Toshihide Murata, and Hirotaka Ono. Optimal approximability of bookmark assignments. Discrete Applied Mathematics, Vol. 161, No. 16, pp. 2361--2366, (2013).

  18. Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, and Yushi Uno. A linear time algorithm for L (2, 1)-labeling of trees. Algorithmica, Vol. 66, No. 3, pp. 654--681, (2013).

  19. Kazuya Haraguchi and Hirotaka Ono. BlockSum is NP-Complete. IEICE TRANSACTIONS on Information and Systems, Vol. 96, No. 3, pp. 481--488, (2013).

  20. Colin Cooper, Robert Elsa sser, Hirotaka Ono, and Tomasz Radzik. Coalescing random walks and voting on connected graphs. SIAM Journal on Discrete Mathematics, Vol. 27, No. 4, pp. 1748--1758, (2013).

  21. Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, and Ryuhei Uehara. Route-enabling graph orientation problems. Algorithmica, Vol. 65, No. 2, pp. 317--338, (2013).

  22. Kazuhisa Makino and Hirotaka Ono. Deductive inference for the interiors and exteriors of Horn theories. ACM Transactions on Computational Logic (TOCL), Vol. 13, No. 3, p. 23, (2012).

  23. Jun Hosoda, Juraj Hromkovi{\v{c}}, Taisuke Izumi, Hirotaka Ono, Monika Steinov{\'a}, and Koichi Wada. On the approximability and hardness of minimum topic connected overlay and its special instances. Theoretical Computer Science, Vol. 429, pp. 144--154, (2012).

  24. Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, and Yushi Uno. The (p, q)-total labeling problem for trees. Discrete Mathematics, Vol. 312, No. 8, pp. 1407--1420, (2012).

  25. Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, and Yushi Uno. A tight upper bound on the (2, 1)-total labeling number of outerplanar graphs. Journal of Discrete Algorithms, Vol. 14, pp. 189--206, (2012).

  26. Ryu Mizoguchi, Hirotaka Ono, Shuji Kijima, and Masafumi Yamashita. On space complexity of self-stabilizing leader election in mediated population protocol. Distributed Computing, Vol. 25, No. 6, pp. 451--460, (2012).

  27. Ryotaro Okazaki, Hirotaka Ono, Taizo Sadahiro, and Masafumi Yamashita. Broadcastings and digit tilings on three-dimensional torus networks. Theoretical Computer Science, Vol. 412, No. 4, pp. 307--319, (2011).

  28. YUICHI ASAHIRO, JESPER JANSSON, EIJI MIYANO, and HIROTAKA ONO. Graph orientation to maximize the minimum weighted outdegree. International Journal of Foundations of Computer Science, Vol. 22, No. 3, p. 583, (2011).

  29. Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, and Kouhei Zenmyo. Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree. Journal of combinatorial optimization, Vol. 22, No. 1, pp. 78--96, (2011).

  30. Yuichi Asahiro, Eiji Miyano, and Hirotaka Ono. Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree. Discrete Applied Mathematics, Vol. 159, No. 7, pp. 498--508, (2011).

  31. Tomoko Izumi, Taisuke Izumi, Hirotaka Ono, and Koichi Wada. Approximability and inapproximability of the minimum certificate dispersal problem. Theoretical Computer Science, Vol. 411, No. 31, pp. 2773--2783, (2010).

  32. Fuminiko Nakano, Hirotaka Ono, and Taizo Sadahiro. Local move connectedness of domino tilings with diagonal impurities. Discrete Mathematics, Vol. 310, No. 13, pp. 1918--1931, (2010).

  33. Yoshiaki Nonaka, Hirotaka Ono, Kunihiko Sadakane, and Masafumi Yamashita. The hitting and cover times of Metropolis walks. Theoretical Computer Science, Vol. 411, No. 16, pp. 1889--1894, (2010).

  34. 田中洋輔, 小野廣隆, 定兼邦彦, 山下雅史. 高速復元可能な接尾辞配列圧縮法. 電子情報通信学会論文誌 D, Vol. 93, No. 8, pp. 1567--1575, (2010).

  35. Kazuo Iwama, Eiji Miyano, and Hirotaka Ono. Drawing borders efficiently. Theory of Computing Systems, Vol. 44, No. 2, pp. 230--244, (2009).

  36. Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, and Yushi Uno. An O(n1.75) algorithm for L(2,1)-labeling of trees. Theoretical Computer Science, Vol. 410, No. 38-40, pp. 3702--3710, (2009).

  37. Yuta Harada, Hirotaka Ono, Kunihiko Sadakane, and Masafumi Yamashita. Optimal balanced semi-matchings for weighted bipartite graphs. IPSJ Digital Courier, Vol. 3, pp. 693--702, (2007).

  38. 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).

  39. Hirotaka Ono, Mutsunori Yagiura, and Toshihide Ibaraki. A decomposability index in logical analysis of data. Discrete applied mathematics, Vol. 142, No. 1, pp. 165--180, (2004).

  40. 小林健了, 小野廣隆, 山下雅史. 量子回路における定数段加算器の設計. 情報処理学会論文誌, Vol. 45, No. 5, pp. 1326--1334, (2004).

  41. 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).
    [link]

  42. Hirotaka Ono, Kazuhisa Makino, and Toshihide Ibaraki. Logical analysis of data with decomposable structures. Theoretical Computer Science, Vol. 289, No. 2, pp. 977 -- 995, (2002). Computing and Combinatorics.
    [link]

  43. Kazuhisa Makino, Takashi Suda, Hirotaka Ono, and Toshihide Ibaraki. Data analysis by positive decision trees. IEICE Transactions on Information and Systems, Vol. 82, No. 1, pp. 76--88, (1999).

査読付き会議論文

[目次]

  1. Hans L. Bodlaender, Hirotaka Ono, and Yota Otachi. Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity. In Seok-Hee Hong, editor, 27th International Symposium on Algorithms and Computation (ISAAC 2016), Vol. 64 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 20:1--20:12, Dagstuhl, Germany, (2016). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik.
    [link]

  2. Tadashi Wadayama, Taisuke Izumi, and Hirotaka Ono. Subgraph domatic problem and writing capacity of memory devices with restricted state transitions. In Information Theory (ISIT), 2015 IEEE International Symposium on, pp. 1307--1311, (2015).

  3. Arash Haddadan, Takehiro Ito, AmerE. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki, and Youcef Tebbal. The Complexity of Dominating Set Reconfiguration. In Frank Dehne, J\ddot{o}rg-R\ddot{u}diger Sack, and Ulrike Stege, editors, Algorithms and Data Structures, Vol. 9214 of Lecture Notes in Computer Science, pp. 398--409. Springer International Publishing, (2015).
    [link]

  4. Takehiro Ito, Hirotaka Ono, and Yota Otachi. Reconfiguration of Cliques in a Graph. In Rahul Jain, Sanjay Jain, and Frank Stephan, editors, Theory and Applications of Models of Computation, Vol. 9076 of Lecture Notes in Computer Science, pp. 212--223. Springer International Publishing, (2015).
    [link]

  5. Tesshu Hanaka and Hirotaka Ono. A Fixed-Parameter Algorithm for Max Edge Domination. In Proceedings of Student Research Forum Papers and Posters at SOFSEM 2015, the 41st International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2015) , Pec pod Snezkou, Czech Republic, January 24-29, 2015., pp. 31--40, (2015).
    [link]

  6. Omar Rifki and Hirotaka Ono. Robustness Analysis of Evolutionary Algorithms to Portfolio Optimization Against Errors in Asset Means. In Dennis Huisman, Ilse Louwerse, and Albert P.M. Wagelmans, editors, Operations Research Proceedings 2013, Operations Research Proceedings, pp. 369--375. Springer International Publishing, (2014).
    [link]

  7. Erik D Demaine, Martin L Demaine, Eli Fox-Epstein, Duc A Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, and Takeshi Yamada. Polynomial-Time Algorithm for Sliding Tokens on Trees. In Hee-Kap Ahn and Chan-Su Shin, editors, Algorithms and Computation, Vol. 8889 of Lecture Notes in Computer Science, pp. 389--400. Springer International Publishing, (2014).
    [link]

  8. Yuichi Asahiro, Jesper Jansson, Eiji Miyano, and Hirotaka Ono. Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation. In Christos Kaklamanis and Kirk Pruhs, editors, Approximation and Online Algorithms, Vol. 8447 of Lecture Notes in Computer Science, pp. 24--36. Springer International Publishing, (2014).
    [link]

  9. Kazuya Haraguchi and Hirotaka Ono. Approximability of Latin Square Completion-Type Puzzles. In Alfredo Ferro, Fabrizio Luccio, and Peter Widmayer, editors, Fun with Algorithms, Vol. 8496 of Lecture Notes in Computer Science, pp. 218--229. Springer International Publishing, (2014).
    [link]

  10. Toshimasa Ishii, Hirotaka Ono, and Yushi Uno. Subexponential Fixed-Parameter Algorithms for Partial Vector Domination. In Pierre Fouilhoux, Luis Eduardo Neves Gouveia, A. Ridha Mahjoub, and Vangelis T. Paschos, editors, Combinatorial Optimization, Vol. 8596 of Lecture Notes in Computer Science, pp. 292--304. Springer International Publishing, (2014).
    [link]

  11. Tetsuo Asano, Taisuke Izumi, Masashi Kiyomi, Matsuo Konagaya, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui, and Ryuhei Uehara. Depth-First Search Using O(n) Bits. In Hee-Kap Ahn and Chan-Su Shin, editors, Algorithms and Computation, Vol. 8889 of Lecture Notes in Computer Science, pp. 553--564. Springer International Publishing, (2014).
    [link]

  12. Toshimasa Ishii, Hirotaka Ono, and Yushi Uno. (Total) Vector Domination for Graphs with Bounded Branchwidth. In Alberto Pardo and Alfredo Viola, editors, LATIN 2014: Theoretical Informatics, Vol. 8392 of Lecture Notes in Computer Science, pp. 238--249. Springer Berlin Heidelberg, (2014).
    [link]

  13. Takehiro Ito, Marcin Kami{\'n}ki, and Hirotaka Ono. Fixed-Parameter Tractability of Token Jumping on Planar Graphs. In Hee-Kap Ahn and Chan-Su Shin, editors, Algorithms and Computation, Vol. 8889 of Lecture Notes in Computer Science, pp. 208--219. Springer International Publishing, (2014).
    [link]

  14. Takehiro Ito, Marcin Kami{\'n}ki, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, and Katsuhisa Yamanaka. On the Parameterized Complexity for Token Jumping on Graphs. In T.V. Gopal, Manindra Agrawal, Angsheng Li, and S.Barry Cooper, editors, Theory and Applications of Models of Computation, Vol. 8402 of Lecture Notes in Computer Science, pp. 341--351. Springer International Publishing, (2014).
    [link]

  15. Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, and Takeaki Uno. Base Location Problems for Base-Monotone Regions. In SubirKumar Ghosh and Takeshi Tokuyama, editors, WALCOM: Algorithms and Computation, Vol. 7748 of Lecture Notes in Computer Science, pp. 53--64. Springer Berlin Heidelberg, (2013).
    [link]

  16. Yusuke Hosaka, Yukiko Yamauchi, Shuji Kijima, Hirotaka Ono, and Masafumi Yamashita. An Extension of Matthews' Bound to Multiplex Random Walks. In Parallel and Distributed Processing Symposium Workshops PhD Forum (IPDPSW), 2012 IEEE 26th International, pp. 872--877, (2012).
    [link]

  17. Yuichi Asahiro, Jesper Jansson, Eiji Miyano, and Hirotaka Ono. Graph Orientations Optimizing the Number of Light or Heavy Vertices. In A.Ridha Mahjoub, Vangelis Markakis, Ioannis Milis, and VangelisTh. Paschos, editors, Combinatorial Optimization, Vol. 7422 of Lecture Notes in Computer Science, pp. 332--343. Springer Berlin Heidelberg, (2012).
    [link]

  18. Yen Kaow Ng, Hirotaka Ono, Ling Ge, and Shuai Cheng Li. Finding Longest Common Segments in Protein Structures in Nearly Linear Time. In Combinatorial Pattern Matching, Vol. 7354 of Lecture Notes in Computer Science, pp. 334--348. Springer Berlin Heidelberg, (2012).
    [link]

  19. Taisuke Izumi, Tomoko Izumi, Hirotaka Ono, and Koichi Wada. Minimum Certificate Dispersal with Tree Structures. In Manindra Agrawal, S.Barry Cooper, and Angsheng Li, editors, Theory and Applications of Models of Computation, Vol. 7287 of Lecture Notes in Computer Science, pp. 548--559. Springer Berlin Heidelberg, (2012).
    [link]

  20. Yuichi Asahiro, Jesper Jansson, Eiji Miyano, and Hirotaka Ono. Upper and Lower Degree Bounded Graph Orientation with Minimum Penalty. In J. Mestre, editor, Computing: The Australasian Theory Symposium (CATS 2012), Vol. 128 of CRPIT, pp. 139--146, Melbourne, Australia, (2012). ACS.
    [link]

  21. Colin Cooper, Robert Els\"{a}sser, Hirotaka Ono, and Tomasz Radzik. Coalescing Random Walks and Voting on Graphs. In Proceedings of the 2012 ACM Symposium on Principles of Distributed Computing, PODC '12, pp. 47--56, New York, NY, USA, (2012). ACM.
    [link]

  22. Takehiro Ito, Kazuto Kawamura, Hirotaka Ono, and Xiao Zhou. Reconfiguration of List L(2,1)-Labelings in a Graph. In Kun-Mao Chao, Tsan-sheng Hsu, and Der-Tsai Lee, editors, Algorithms and Computation, Vol. 7676 of Lecture Notes in Computer Science, pp. 34--43. Springer Berlin Heidelberg, (2012).
    [link]

  23. Eiji Miyano and Hirotaka Ono. Maximum Domination Problem. In Alex Potanin and Taso Viglas, editors, Computing: The Australasian Theory Symposium (CATS 2011), Vol. 119 of CRPIT, pp. 55--62, Perth, Australia, (2011). ACS.
    [link]

  24. Jun Hosoda, Juraj Hromkovi{\v{c}}, Taisuke Izumi, Hirotaka Ono, Monika Steinov{\'a}, and Koichi Wada. On the Approximability of Minimum Topic Connected Overlay and Its Special Instances. In Filip Murlak and Piotr Sankowski, editors, Mathematical Foundations of Computer Science 2011, Vol. 6907 of Lecture Notes in Computer Science, pp. 376--387. Springer Berlin Heidelberg, (2011).
    [link]

  25. Yoshiaki Nonaka, Hirotaka Ono, Shuji Kijima, and Masafumi Yamashita. How Slow, or Fast, Are Standard Random Walks? Analyses of Hitting and Cover Times on Tree. In Alex Potanin and Taso Viglas, editors, Computing: The Australasian Theory Symposium (CATS 2011), Vol. 119 of CRPIT, pp. 63--68, Perth, Australia, (2011). ACS.
    [link]

  26. Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, and Yushi Uno. The (2,1)-Total Labeling Number of Outerplanar Graphs Is at Most $Delta$+2. In CostasS. Iliopoulos and WilliamF. Smyth, editors, Combinatorial Algorithms, Vol. 6460 of Lecture Notes in Computer Science, pp. 103--106. Springer Berlin Heidelberg, (2011).
    [link]

  27. Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, and Koichi Yamazaki. Approximability of the Path-Distance-Width for AT-free Graphs. In Graph-Theoretic Concepts in Computer Science, Vol. 6986 of Lecture Notes in Computer Science, pp. 271--282. Springer Berlin Heidelberg, (2011).
    [link]

  28. Ryu Mizoguchi, Hirotaka Ono, Shuji Kijima, and Masafumi Yamashita. Upper and Lower Bounds of Space Complexity of Self-Stabilizing Leader Election in Mediated Population Protocol. In Chenyang Lu, Toshimitsu Masuzawa, and Mohamed Mosbah, editors, Principles of Distributed Systems, Vol. 6490 of Lecture Notes in Computer Science, pp. 491--503. Springer Berlin Heidelberg, (2010).
    [link]

  29. Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, and Yushi Uno. The (p,q)-total Labeling Problem for Trees. In Otfried Cheong, Kyung-Yong Chwa, and Kunsoo Park, editors, Algorithms and Computation, Vol. 6507 of Lecture Notes in Computer Science, pp. 49--60. Springer Berlin Heidelberg, (2010).
    [link]

  30. Nao Fujinaga, Hirotaka Ono, Shuji Kijima, and Masafumi Yamashita. Pattern Formation through Optimum Matching by Oblivious CORDA Robots. In Chenyang Lu, Toshimitsu Masuzawa, and Mohamed Mosbah, editors, Principles of Distributed Systems, Vol. 6490 of Lecture Notes in Computer Science, pp. 1--15. Springer Berlin Heidelberg, (2010).
    [link]

  31. Yuichi Asahiro, Jesper Jansson, Eiji Miyano, and Hirotaka Ono. Graph orientation to maximize the minimum weighted outdegree. In Parallel Distributed Processing, 2009. IPDPS 2009. IEEE International Symposium on, pp. 1--8, (2009).
    [link]

  32. Ei Ando, Hirotaka Ono, Kunihiko Sadakane, and Masafumi Yamashita. Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG. In Jianer Chen and S.Barry Cooper, editors, Theory and Applications of Models of Computation, Vol. 5532 of Lecture Notes in Computer Science, pp. 98--107. Springer Berlin Heidelberg, (2009).
    [link]

  33. Ei Ando, Hirotaka Ono, and Masafumi Yamashita. A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems. In Osamu Watanabe and Thomas Zeugmann, editors, Stochastic Algorithms: Foundations and Applications, Vol. 5792 of Lecture Notes in Computer Science, pp. 89--103. Springer Berlin Heidelberg, (2009).
    [link]

  34. Tomoko Izumi, Taisuke Izumi, Hirotaka Ono, and Koichi Wada. Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem. In HungQ. Ngo, editor, Computing and Combinatorics, Vol. 5609 of Lecture Notes in Computer Science, pp. 56--65. Springer Berlin Heidelberg, (2009).
    [link]

  35. Yoshiaki Nonaka, Hirotaka Ono, Kunihiko Sadakane, and Masafumi Yamashita. How to Design a Linear Cover Time Random Walk on a Finite Graph. In Osamu Watanabe and Thomas Zeugmann, editors, Stochastic Algorithms: Foundations and Applications, Vol. 5792 of Lecture Notes in Computer Science, pp. 104--116. Springer Berlin Heidelberg, (2009).
    [link]

  36. Suguru Kawashimo, Yen Kaow Ng, Hirotaka Ono, Kunihiko Sadakane, and Masafumi Yamashita. Speeding Up Local-Search Type Algorithms for Designing DNA Sequences under Thermodynamical Constraints. In DNA Computing, Vol. 5347 of Lecture Notes in Computer Science, pp. 168--178. Springer Berlin Heidelberg, (2009).
    [link]

  37. Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, and Yushi Uno. A Linear Time Algorithm for L(2,1)-Labeling of Trees. In Amos Fiat and Peter Sanders, editors, Algorithms - ESA 2009, Vol. 5757 of Lecture Notes in Computer Science, pp. 35--46. Springer Berlin Heidelberg, (2009).
    [link]

  38. Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, and Ryuhei Uehara. Route-Enabling Graph Orientation Problems. In Yingfei Dong, Ding-Zhu Du, and Oscar Ibarra, editors, Algorithms and Computation, Vol. 5878 of Lecture Notes in Computer Science, pp. 403--412. Springer Berlin Heidelberg, (2009).
    [link]

  39. Ei Ando, Hirotaka Ono, Kunihiko Sadakane, and Masafumi Yamashita. A Counting-Based Approximation the Distribution Function of the Longest Path Length in Directed Acyclic Graphs. Proceedings of the 7th Forum on Information Technology, pp. 7--8, (2008).

  40. Yuta Harada, Hirotaka Ono, Kunihiko Sadakane, and Masafumi Yamashita. The Balanced Edge Cover Problem. In Seok-Hee Hong, Hiroshi Nagamochi, and Takuro Fukunaga, editors, Algorithms and Computation, Vol. 5369 of Lecture Notes in Computer Science, pp. 246--257. Springer Berlin Heidelberg, (2008).
    [link]

  41. Kazuhisa Makino and Hirotaka Ono. Deductive Inference for the Interiors and Exteriors of Horn Theories. In Seok-Hee Hong, Hiroshi Nagamochi, and Takuro Fukunaga, editors, Algorithms and Computation, Vol. 5369 of Lecture Notes in Computer Science, pp. 390--401. Springer Berlin Heidelberg, (2008).
    [link]

  42. Ei Ando, Hirotaka Ono, Kunihiko Sadakane, and Masafumi Yamashita. The space complexity of the leader election in anonymous networks. In Parallel and Distributed Processing, 2008. IPDPS 2008. IEEE International Symposium on, pp. 1--8. IEEE, (2008).

  43. Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, and Yushi Uno. An O(n^1.75) Algorithm for L(2,1)-Labeling of Trees. In Joachim Gudmundsson, editor, Algorithm Theory -- SWAT 2008, Vol. 5124 of Lecture Notes in Computer Science, pp. 185--197. Springer Berlin Heidelberg, (2008).
    [link]

  44. Suguru Kawashimo, Hirotaka Ono, Kunihiko Sadakane, and Masafumi Yamashita. Dynamic Neighborhood Searches for Thermodynamically Designing DNA Sequence. In MaxH. Garzon and Hao Yan, editors, DNA Computing, Vol. 4848 of Lecture Notes in Computer Science, pp. 130--139. Springer Berlin Heidelberg, (2008).
    [link]

  45. Yuichi Asahiro, Eiji Miyano, and Hirotaka Ono. Graph Classes and the Complexity of the Graph Orientation Minimizing the Maximum Weighted Outdegree. In James Harland and Prabhu Manyem, editors, Fourteenth Computing: The Australasian Theory Symposium (CATS 2008), Vol. 77 of CRPIT, pp. 97--106, Wollongong, NSW, Australia, (2008). ACS.
    [link]

  46. Yuichi Asahiro, Eiji Miyano, Toshihide Murata, and Hirotaka Ono. On Approximation of Bookmark Assignments. In Mathematical Foundations of Computer Science 2007, Vol. 4708 of Lecture Notes in Computer Science, pp. 115--124. Springer Berlin Heidelberg, (2007).
    [link]

  47. Kazuo Iwama, Eiji Miyano, and Hirotaka Ono. Drawing Borders Efficiently. In Pierluigi Crescenzi, Giuseppe Prencipe, and Geppino Pucci, editors, Fun with Algorithms, Vol. 4475 of Lecture Notes in Computer Science, pp. 213--226. Springer Berlin Heidelberg, (2007).
    [link]

  48. Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, and Kouhei Zenmyo. Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree. In Ming-Yang Kao and Xiang-Yang Li, editors, Algorithmic Aspects in Information and Management, Vol. 4508 of Lecture Notes in Computer Science, pp. 167--177. Springer Berlin Heidelberg, (2007).
    [link]

  49. Tsutomu Takeda, Hirotaka Ono, Kunihiko Sadakane, and Masafumi Yamashita. A Local Search Based Barrier Height Estimation Algorithm for DNA Molecular Transitions. In Alessandra Carbone and NilesA. Pierce, editors, DNA Computing, Vol. 3892 of Lecture Notes in Computer Science, pp. 359--370. Springer Berlin Heidelberg, (2006).
    [link]

  50. Masashi Shiozaki, Hirotaka Ono, Kunihiko Sadakane, and Masafumi Yamashita. A Probabilistic Model of the DNA Conformational Change. In Chengde Mao and Takashi Yokomori, editors, DNA Computing, Vol. 4287 of Lecture Notes in Computer Science, pp. 274--285. Springer Berlin Heidelberg, (2006).
    [link]

  51. Yuichi Kurumida, Hirotaka Ono, Kunihiko Sadakane, and Masafumi Yamashita. Forest Search: A Paradigm for Faster Exploration of Scale-Free Networks. In Minyi Guo, LaurenceT. Yang, Beniamino Di Martino, HansP. Zima, Jack Dongarra, and Feilong Tang, editors, Parallel and Distributed Processing and Applications, Vol. 4330 of Lecture Notes in Computer Science, pp. 39--50. Springer Berlin Heidelberg, (2006).
    [link]

  52. Yuichi Kurumida, Tsukasa Ogata, Hirotaka Ono, Kunihiko Sadakane, and Masafumi Yamashita. A Generic Search Strategy for Large-scale Real-world Networks. In Proceedings of the 1st International Conference on Scalable Information Systems, InfoScale '06, New York, NY, USA, (2006). ACM.
    [link]

  53. Suguru Kawashimo, Hirotaka Ono, Kunihiko Sadakane, and Masafumi Yamashita. DNA Sequence Design by Dynamic Neighborhood Searches. In Chengde Mao and Takashi Yokomori, editors, DNA Computing, Vol. 4287 of Lecture Notes in Computer Science, pp. 157--171. Springer Berlin Heidelberg, (2006).
    [link]

  54. Yuichi Asahiro, Eiji Miyano, Hirotaka Ono, and Kouhei Zenmyo. Graph Orientation Algorithms to Minimize the Maximum Outdegree. In Joachim Gudmundsson and Barry Jay, editors, Twelfth Computing: The Australasian Theory Symposium (CATS2006), Vol. 51 of CRPIT, pp. 11--20, Hobart, Australia, (2006). ACS.
    [link]

  55. Shay Kutten, Hirotaka Ono, David Peleg, Kunihiko Sadakane, and Masafumi Yamashita. Energy-Optimal Online Algorithms for Broadcasting in Wireless Networks. In Wireless on Demand Network Systems and Service, International Conference on, Vol. 0, pp. 125--130, Los Alamitos, CA, USA, (2005). IEEE Computer Society.

  56. YenKaow Ng, Hirotaka Ono, and Takeshi Shinohara. Measuring Over-Generalization in the Minimal Multiple Generalizations of Biosequences. In Achim Hoffmann, Hiroshi Motoda, and Tobias Scheffer, editors, Discovery Science, Vol. 3735 of Lecture Notes in Computer Science, pp. 176--188. Springer Berlin Heidelberg, (2005).
    [link]

  57. Hirotaka Ono and YenKaow Ng. Best Fitting Fixed-Length Substring Patterns for a Set of Strings. In Lusheng Wang, editor, Computing and Combinatorics, Vol. 3595 of Lecture Notes in Computer Science, pp. 240--250. Springer Berlin Heidelberg, (2005).
    [link]

  58. Yuichi Asahiro, Takashi Horiyama, Kazuhisa Makino, Hirotaka Ono, Toshinori Sakuma, and Masafumi Yamashita. How to collect balls moving in the Euclidean plane. Electronic Notes in Theoretical Computer Science, Vol. 91, pp. 229--245, (2004).

  59. Yuichi Handa, Hirotaka Ono, Kunihiko Sadakane, and Masafumi Yamashita. Neighborhood Composition: A Parallelization of Local Search Algorithms. In Recent Advances in Parallel Virtual Machine and Message Passing Interface, Vol. 3241 of Lecture Notes in Computer Science, pp. 155--163. Springer Berlin Heidelberg, (2004).
    [link]

  60. Hoong Chuin Lau, Qizhang Liu, and Hirotaka Ono. Integrating local search and network flow to solve the inventory routing problem. In AAAI/IAAI, pp. 9--14, (2002).
    [link]

  61. Hirotaka Ono, Mutunori Yagiura, and Toshihide Ibaraki. An Index for the Data Size to Extract Decomposable Structures in LAD. In Peter Eades and Tadao Takaoka, editors, Algorithms and Computation, Vol. 2223 of Lecture Notes in Computer Science, pp. 279--290. Springer Berlin Heidelberg, (2001).
    [link]

  62. Hirotaka Ono, Kazuhisa Makino, and Toshihide Ibaraki. Logical Analysis of Data with Decomposable Structures. In Ding-Zhu Du, Peter Eades, Vladimir Estivill-Castro, Xuemin Lin, and Arun Sharma, editors, Computing and Combinatorics, Vol. 1858 of Lecture Notes in Computer Science, pp. 396--406. Springer Berlin Heidelberg, (2000).
    [link]

その他の論文

[目次]

  1. Hirotaka Ono. Recent advances on distance constrained labeling problems. In Computing and Networking (CANDAR), 2013 First International Symposium on, pp. 26--29. IEEE (チュートリアル講演), (2013).

  2. Hirotaka Ono. Fast random walks on finite graphs and graph topological information. In Networking and Computing (ICNC), 2011 Second International Conference on, pp. 360--363. IEEE (招待講演), (2011).

  3. 朝廣雄一, 小野廣隆, 宮野英次, 山下雅史. 移動物体回収問題. 電子情報通信学会誌 (招待解説記事), Vol. 90, No. 3, pp. 245--247, (2007).

学位論文

[目次]

  1. Hirotaka Ono. Structural Studies of Boolean Functions with Applications to Data Analysis. PhD thesis, Graduateschool of Informatics, Kyoto University, Japan, (2002).

(This list is generated by bunkenhtml-xref based on bunkenhtml.)