Faculty Profiles - ONO Hirotaka

Papers - ONO Hirotaka

Division display 61 - 80 of about 236 ／ All the affair displays >>

Reallocation Problems with Minimum Completion Time.

Toshimasa Ishii, Jun Kawahara, Kazuhisa Makino, Hirotaka Ono

CoRR Vol. abs/2111.02579 2021

Graph orientation with splits Reviewed International coauthorship Open Access

Asahiro, Y., Jansson, J., Miyano, E., Nikpey, H., Ono, H.

Theoretical Computer Science Vol. 844 page： 16 - 25 2020.12

Exact algorithms for the repetition-bounded longest common subsequence problem Reviewed International coauthorship Open Access

Asahiro, Y., Jansson, J., Lin, G., Miyano, E., Ono, H., Utashima, T.

Theoretical Computer Science Vol. 838 page： 238 - 249 2020.10

Parameterized complexity of independent set reconfiguration problems Reviewed International coauthorship

Takehiro Ito, Marcin Kamiński, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, Katsuhisa Yamanaka

Discrete Applied Mathematics Vol. 283 page： 336 - 345 2020.9

Independent Set Reconfiguration Parameterized by Modular-Width Reviewed

Belmonte, R., Hanaka, T., Lampis, M., Ono, H., Otachi, Y.

Algorithmica Vol. 82 ( 9 ) page： 2586 - 2605 2020.9

Parameterized Complexity of $$(A,\ell )$$-Path Packing Reviewed International coauthorship

Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi

Lecture Notes in Computer Science Vol. 12126 LNCS page： 43 - 55 2020.6

Parameterized Complexity of Safe Set Reviewed International coauthorship

Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi

Journal of Graph Algorithms and Applications Vol. 24 ( 3 ) page： 215 - 245 2020.4

Space-Efficient Algorithms for Longest Increasing Subsequence Reviewed International coauthorship

Kiyomi, M., Ono, H., Otachi, Y., Schweitzer, P., Tarui, J.

Theory of Computing Systems Vol. 64 ( 3 ) page： 522 - 541 2020.4

Hedonic Seat Arrangement Problems. Reviewed International journal

Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden

AAMAS '20: Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems page： 1777 - 1779 2020

The computational complexity of the gear placement problem Open Access

HAMA Vitor Mitsuo FUKUSHIGUE, KANAZAWA Shogo, HU Yannan, IMAHORI Shinji, ONO Hirotaka, YAGIURA Mutsunori

Journal of Advanced Mechanical Design, Systems, and Manufacturing Vol. 14 ( 5 ) page： JAMDSM0069 - JAMDSM0069 2020

Language：English Publishing type：Research paper (scientific journal) Publisher：The Japan Society of Mechanical Engineers

<p>In this paper, we analyze the complexity of the gear placement problem (GPP). In the GPP, we are given a rectangular plane, called a gearbox, on which a torque generator source and a set of gears, called target gears, are placed. The task is to find a placement of a set of gears called sub-gears, to connect every target gear to the torque generator source so that every target gear rotates in a given direction. The objective is to minimize the number of sub-gears to be used. We prove that the GPP is NP-hard by giving a reduction from the Hamiltonian path problem on 3-regular planar graphs, which is known to be NP-complete, to the GPP. We also present an upper bound for the number of sub-gears to be placed.</p>

DOI： 10.1299/jamdsm.2020jamdsm0069

Two-Player Competitive Diffusion Game: Graph Classes and the Existence of a Nash Equilibrium Reviewed

Naoka Fukuzono, Tesshu Hanaka, Hironori Kiya, Hirotaka Ono, Ryogo Yamaguchi

SOFSEM 2020: Theory and Practice of Computer Science Vol. 12011 page： 627 - 635 2020

Fair Ride Allocation on a Line.

Yuki Amano, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hirotaka Ono

CoRR Vol. abs/2007.08045 2020

A faster parameterized algorithm for PSEUDOFOREST DELETION Reviewed

Bodlaender Hans L., Ono Hirotaka, Otachi Yota

DISCRETE APPLIED MATHEMATICS Vol. 236 page： 42-56 2018.2

Finding environmentally critical transmission sectors, transactions, and paths in global supply chain networks Reviewed

Hanaka Tesshu, Kagawa Shigemi, Ono Hirotaka, Kanemoto Keiichiro

ENERGY ECONOMICS Vol. 68 page： 44-52 2017.10

Combinatorial Structure Extraction from Large-Scale Data by String Compression

page： 1-8 2017

Subexponential fixed-parameter algorithms for partial vector domination Reviewed

Ishii Toshimasa, Ono Hirotaka, Uno Yushi

DISCRETE OPTIMIZATION Vol. 22 page： 111-121 2016.11

The complexity of dominating set reconfiguration Reviewed

Haddadan Arash, Ito Takehiro, Mouawad Amer E., Nishimura Naomi, Ono Hirotaka, Suzuki Akira, Tebbal Youcef

THEORETICAL COMPUTER SCIENCE Vol. 651 page： 37-49 2016.10

On the Maximum Weight Minimal Separator (コンピュテーション)

土中哲秀, Bodlaender Hans L., Zanden T. C. van der, 小野廣隆

電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 Vol. 116 ( 116 ) page： 81-87 2016.6

情報の窓 2015年秋季シンポジウムルポ(第74回)

小野廣隆

オペレーションズ・リサーチ Vol. 61 ( 2 ) page： 109-111 2016.2

Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation Reviewed

Asahiro Yuichi, Jansson Jesper, Miyano Eiji, Ono Hirotaka

THEORY OF COMPUTING SYSTEMS Vol. 58 ( 1 ) page： 60-93 2016.1

　 PREV - NEXT 　

<ONO Hirotaka>

Papers - ONO Hirotaka