Hirotaka Ono

ORCID

Publication Activity (10 Years)

Years Active: 2000-2023
Publications (10 Years): 101

Top Venues

Publications

Hirotaka Ono, Hisato Yamanaka
An 8-approximation algorithm for L(2,1)-labeling of unit disk graphs. Discret. Appl. Math. 341 (2023)
Kanae Yoshiwatari, Hironori Kiya, Koki Suetsugu, Tesshu Hanaka, Hirotaka Ono
Turning Tiles is PSPACE-complete. CoRR (2023)
Yuichi Asahiro, Hiroshi Eto, Mingyang Gong, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Shunichi Tanaka
Approximation Algorithms for the Longest Run Subsequence Problem. CPM (2023)
Tesshu Hanaka, Hirotaka Ono, Yota Otachi, Saeki Uda
Grouped Domination Parameterized by Vertex Cover, Twin Cover, and Beyond. CIAC (2023)
Tesshu Hanaka, Airi Ikeyama, Hirotaka Ono
Maximizing Utilitarian and Egalitarian Welfare of Fractional Hedonic Games on Tree-like Graphs. CoRR (2023)
Takehiro Ito, Hirotaka Ono, Yota Otachi
Reconfiguration of cliques in a graph. Discret. Appl. Math. 333 (2023)
Yasuaki Kobayashi, Kazuhiro Kurita, Yasuko Matsui, Hirotaka Ono
Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints. CoRR (2023)
Tesshu Hanaka, Hirotaka Ono, Kunihiko Sadakane, Kosuke Sugiyama
Shortest Beer Path Queries Based on Graph Decomposition. ISAAC (2023)
Mutsunori Banbara, Shin-ichi Minato, Hirotaka Ono, Ryuhei Uehara
On the Computational Complexity of Generalized Common Shape Puzzles. CoRR (2023)
Tesshu Hanaka, Hirotaka Ono, Kosuke Sugiyama
. IPDPS Workshops (2023)
Tesshu Hanaka, Hirotaka Ono, Yota Otachi, Saeki Uda
Grouped Domination Parameterized by Vertex Cover, Twin Cover, and Beyond. CoRR (2023)
Tesshu Hanaka, Hirotaka Ono, Kunihiko Sadakane, Kosuke Sugiyama
Shortest Beer Path Queries based on Graph Decomposition. CoRR (2023)
Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono, Yota Otachi
Structural Parameterizations of Vertex Integrity. CoRR (2023)
Hironori Kiya, Yuto Okada, Hirotaka Ono, Yota Otachi
Sequentially Swapping Tokens: Further on Graph Classes. SOFSEM (2023)
Tesshu Hanaka, Hirotaka Ono, Kosuke Sugiyama
Solving Distance-constrained Labeling Problems for Small Diameter Graphs via TSP. CoRR (2023)
Tesshu Hanaka, Kazuma Kawai, Hirotaka Ono
Computing L(p, 1)-Labeling with Combined Parameters. J. Graph Algorithms Appl. 26 (2) (2022)
Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi
Parameterized Complexity of (A, ℓ )-Path Packing. Algorithmica 84 (4) (2022)
Naoka Fukuzono, Tesshu Hanaka, Hironori Kiya, Hirotaka Ono
The existence of a pure Nash equilibrium in the two-player competitive diffusion game on graphs having chordality. Discret. Appl. Math. 321 (2022)
Tesshu Hanaka, Hironori Kiya, Hirotaka Ono, Kanae Yoshiwatari
Winner Determination Algorithms for Graph Games with Matching Structures. CoRR (2022)
Tesshu Hanaka, Toshiyuki Hirose, Hirotaka Ono
Capacitated Network Design Games on a Generalized Fair Allocation Model. AAMAS (2022)
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
Upper and lower degree-constrained graph orientation with minimum penalty. Theor. Comput. Sci. 900 (2022)
Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima
Polynomial-Time Equivalences and Refined Algorithms for Longest Common Subsequence Variants. CPM (2022)
Yuki Amano, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hirotaka Ono
Fair Ride Allocation on a Line. SAGT (2022)
Kanae Yoshiwatari, Hironori Kiya, Tesshu Hanaka, Hirotaka Ono
Winner Determination Algorithms for Graph Games with Matching Structures. IWOCA (2022)
Hironori Kiya, Yuto Okada, Hirotaka Ono, Yota Otachi
Sequentially Swapping Tokens: Further on Graph Classes. CoRR (2022)
Toshimasa Ishii, Jun Kawahara, Kazuhisa Makino, Hirotaka Ono
Reallocation Problems with Minimum Completion Time. COCOON (2022)
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
Graph Orientation with Edge Modifications. Int. J. Found. Comput. Sci. 32 (2) (2021)
Hironori Kiya, Katsuki Ohto, Hirotaka Ono
Computing the Winner of 2-Player TANHINMIN. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (9) (2021)
Tesshu Hanaka, Kazuma Kawai, Hirotaka Ono
Computing L(p, 1)-Labeling with Combined Parameters. WALCOM (2021)
Tesshu Hanaka, Toshiyuki Hirose, Hirotaka Ono
Capacitated Network Design Games on a Generalized Fair Allocation Model. CoRR (2021)
Toshimasa Ishii, Jun Kawahara, Kazuhisa Makino, Hirotaka Ono
Reallocation Problems with Minimum Completion Time. CoRR (2021)
Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi
Parameterized Complexity of (A, 𝓁)-Path Packing. CoRR (2020)
Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden
Hedonic Seat Arrangement Problems. AAMAS (2020)
Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi
Parameterized Complexity of (A, ℓ )-Path Packing. IWOCA (2020)
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hesam Nikpey, Hirotaka Ono
Graph orientation with splits. Theor. Comput. Sci. 844 (2020)
Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi
Parameterized Complexity of Safe Set. J. Graph Algorithms Appl. 24 (3) (2020)
Kohki Shibahara, Takayuki Mizuno, Hirotaka Ono, Kazuhide Nakajima, Yutaka Miyamoto
Long-Haul DMD-Unmanaged 6-Mode-Multiplexed Transmission Employing Cyclic Mode-Group Permutation. OFC (2020)
Yuki Amano, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hirotaka Ono
Fair Ride Allocation on a Line. CoRR (2020)
Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi
Independent Set Reconfiguration Parameterized by Modular-Width. Algorithmica 82 (9) (2020)
Masashi Kiyomi, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui
Space-Efficient Algorithms for Longest Increasing Subsequence. Theory Comput. Syst. 64 (3) (2020)
Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima
Exact algorithms for the repetition-bounded longest common subsequence problem. Theor. Comput. Sci. 838 (2020)
Naoka Fukuzono, Tesshu Hanaka, Hironori Kiya, Hirotaka Ono, Ryogo Yamaguchi
Two-Player Competitive Diffusion Game: Graph Classes and the Existence of a Nash Equilibrium. SOFSEM (2020)
Tesshu Hanaka, Kazuma Kawai, Hirotaka Ono
Computing L(p, 1)-Labeling with Combined Parameters. CoRR (2020)
Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden
Hedonic Seat Arrangement Problems. CoRR (2020)
Takehiro Ito, Marcin Jakub Kaminski, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, Katsuhisa Yamanaka
Parameterized complexity of independent set reconfiguration problems. Discret. Appl. Math. 283 (2020)
Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi
Independent Set Reconfiguration Parameterized by Modular-Width. CoRR (2019)
Tesshu Hanaka, Hans L. Bodlaender, Tom C. van der Zanden, Hirotaka Ono
On the maximum weight minimal separator. Theor. Comput. Sci. 796 (2019)
Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima
Exact Algorithms for the Bounded Repetition Longest Common Subsequence Problem. COCOA (2019)
Tesshu Hanaka, Hironori Kiya, Yasuhide Maei, Hirotaka Ono
Computational Complexity of Hedonic Games on Sparse Graphs. PRIMA (2019)
Tesshu Hanaka, Hironori Kiya, Yasuhide Maei, Hirotaka Ono
Computational Complexity of Hedonic Games on Sparse Graphs. CoRR (2019)
Tesshu Hanaka, Naomi Nishimura, Hirotaka Ono
On directed covering and domination problems. Discret. Appl. Math. 259 (2019)
Hitoshi Hayakawa, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
Settlement fund circulation problem. Discret. Appl. Math. 265 (2019)
Masahiro Okubo, Tesshu Hanaka, Hirotaka Ono
Optimal Partition of a Tree with Social Distance. WALCOM (2019)
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Sandhya T. P.
Graph Orientation with Edge Modifications. FAW (2019)
Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi
Parameterized Complexity of Safe Set. CIAC (2019)
Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi
Independent Set Reconfiguration Parameterized by Modular-Width. WG (2019)
Hirotaka Ono, Hisato Yamanaka
A 116/13-Approximation Algorithm for L(2, 1)-Labeling of Unit Disk Graphs. SOFSEM (2019)
Hirotaka Ono
Gain Control in Multi-Core EDFA with Hybrid-Pumping. OECC/PSC (2019)
Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi
Parameterized Complexity of Safe Set. CoRR (2019)
Kohki Shibahara, Takayuki Mizuno, Doowhan Lee, Yutaka Miyamoto, Hirotaka Ono, Kazuhide Nakajima, Yoshimichi Amma, Katsuhiro Takenaga, Kunimasa Saitoh
Iterative Unreplicated Parallel Interference Canceler for MDL-Tolerant Dense SDM 12-Core×3-Mode Transmission Over 3000 km. ECOC (2018)
Raquel Águeda, Nathann Cohen, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Leandro Montero, Reza Naserasr, Hirotaka Ono, Yota Otachi, Tadashi Sakuma, Zsolt Tuza, Renyu Xu
Safe sets in graphs: Graph classes and structural parameters. J. Comb. Optim. 36 (4) (2018)
Hans L. Bodlaender, Hirotaka Ono, Yota Otachi
A faster parameterized algorithm for Pseudoforest Deletion. Discret. Appl. Math. 236 (2018)
Masashi Kiyomi, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui
Space-Efficient Algorithms for Longest Increasing Subsequence. STACS (2018)
Hans L. Bodlaender, Hirotaka Ono, Yota Otachi
Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity. Algorithmica 80 (7) (2018)
Masahiro Okubo, Tesshu Hanaka, Hirotaka Ono
Optimal Partition of a Tree with Social Distance. CoRR (2018)
Kohki Shibahara, Takayuki Mizuno, L. Doowhan, Yutaka Miyamoto, Hirotaka Ono, Kazuhide Nakajima, S. Saitoh, Katsuhiro Takenaga, Kunimasa Saitoh
DMD-Unmanaged Long-Haul SDM Transmission Over 2500-km 12-core × 3-mode MC-FMF and 6300-km 3-mode FMF Employing Intermodal Interference Cancelling Technique. OFC (2018)
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hesam Nikpey, Hirotaka Ono
Graph Orientation with Splits. ISCO (2018)
Takayuki Mizuno, Kohki Shibahara, Hirotaka Ono, Yutaka Miyamoto
Long-Distance PDM-32QAM 3-Mode Fibre Transmission Over 1000 km Using Hybrid Multicore EDFA/Raman Repeated Amplification with Cyclic Mode Permutation. ECOC (2018)
Mitsumasa Nakajima, Kenya Suzuki, Keita Yamaguchi, Hirotaka Ono, Hiroki Kawahara, Mitsunori Fukutoku, Takayuki Mizuno, Yutaka Miyamoto, Toshikazu Hashimoto
SDM-compatible dynamic gain equalizer using spatial and planar optical circuit. OFC (2017)
Tesshu Hanaka, Hans L. Bodlaender, Tom C. van der Zanden, Hirotaka Ono
On the Maximum Weight Minimal Separator. TAMC (2017)
Hitoshi Hayakawa, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
Settlement Fund Circulation Problem. ISAAC (2017)
Masashi Kiyomi, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui
Space-Efficient Algorithms for Longest Increasing Subsequence. CoRR (2017)
Kota Shikama, Yoshiteru Abe, Hirotaka Ono, Atsushi Aratake
Low-loss fiber-bundle-type fan-in/fan-out device for 6-mode 19-core fiber. OFC (2017)
Tesshu Hanaka, Naomi Nishimura, Hirotaka Ono
On Directed Covering and Domination Problems. ISAAC (2017)
Takayuki Mizuno, Akira Isoda, Kohki Shibahara, Hirotaka Ono, Mitsunori Fukutoku, Yutaka Miyamoto
Hybrid Cladding-pumped EDFA/Raman for SDM Transmission Systems Using Core-by-core Gain Control Scheme. ECOC (2017)
Toshimasa Ishii, Hirotaka Ono, Yushi Uno
(Total) Vector domination for graphs with bounded branchwidth. Discret. Appl. Math. 207 (2016)
Takayuki Mizuno, Kohki Shibahara, Hirotaka Ono, Y. Abe, Yutaka Miyamoto, F. Ye, Toshio Morioka, Yusuke Sasaki, Yoshimichi Amma, Katsuhiro Takenaga, S. Matsuo, Kazuhiko Aikawa, Kunimasa Saitoh, Yongmin Jung, David J. Richardson, Klaus Pulverer, Marc Bohn, M. Yamada
32-core Dense SDM unidirectional transmission of PDM-16QAM signals over 1600 km using crosstalk-managed single-mode heterogeneous multicore transmission line. OFC (2016)
Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki, Youcef Tebbal
The complexity of dominating set reconfiguration. Theor. Comput. Sci. 651 (2016)
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation. Theory Comput. Syst. 58 (1) (2016)
Toshimasa Ishii, Hirotaka Ono, Yushi Uno
Subexponential fixed-parameter algorithms for partial vector domination. Discret. Optim. 22 (2016)
Hans L. Bodlaender, Hirotaka Ono, Yota Otachi
A Faster Parameterized Algorithm for Pseudoforest Deletion. IPEC (2016)
Md. Al-Amin Khandaker, Hirotaka Ono, Yasuyuki Nogami, Masaaki Shirase, Sylvain Duquesne
An Improvement of Optimal Ate Pairing on KSS Curve with Pseudo 12-Sparse Multiplication. ICISC (2016)
Hans L. Bodlaender, Hirotaka Ono, Yota Otachi
Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity. ISAAC (2016)
Dariusz Dereniowski, Hirotaka Ono, Ichiro Suzuki, Lukasz Wrona, Masafumi Yamashita, Pawel Zylinski
The searchlight problem for road networks. Theor. Comput. Sci. 591 (2015)
Tadashi Wadayama, Taisuke Izumi, Hirotaka Ono
Subgraph domatic problem and writing capacity of memory devices with restricted state transitions. ISIT (2015)
Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki, Youcef Tebbal
The Complexity of Dominating Set Reconfiguration. WADS (2015)
Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki, Youcef Tebbal
The complexity of dominating set reconfiguration. CoRR (2015)
Tesshu Hanaka, Hirotaka Ono
A Fixed-Parameter Algorithm for Max Edge Domination. SOFSEM (Student Research Forum Papers / Posters) (2015)
Binay K. Bhattacharya, Sandip Das, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh, Hirotaka Ono, Yota Otachi
Geometric k-Center Problems with Centers Constrained to Two Lines. CoRR (2015)
Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada
Corrigendum to "On the approximability and hardness of minimum topic connected overlay and its special instances" [Theoret. Comput. Sci. 429(2012) 144-154]. Theor. Comput. Sci. 562 (2015)
Tadashi Wadayama, Taisuke Izumi, Hirotaka Ono
Subgraph Domatic Problem and Writing Capacity of Memory Devises with Restricted State Transitions. CoRR (2015)
Omar Rifki, Hirotaka Ono
A Hybrid Approach of Optimization and Sampling for Robust Portfolio Selection. OR (2015)
Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada
Linear-time algorithm for sliding tokens on trees. Theor. Comput. Sci. 600 (2015)
Kohki Shibahara, Takayuki Mizuno, Hidehiko Takara, Akihide Sano, H. Kawakami, D. Lee, Yutaka Miyamoto, Hirotaka Ono, Manabu Oguma, Yoshiteru Abe, Takayuki Kobayashi, Takashi Matsui, Ryohei Fukumoto, Yoshimichi Amma, T. Hosokawa, S. Matsuo, Kunimasa Saitoh, H. Nasu, Toshio Morioka
Dense SDM (12-core × 3-mode) transmission over 527 km with 33.2-ns mode-dispersion employing low-complexity parallel MIMO frequency-domain equalization. OFC (2015)
Nao Fujinaga, Yukiko Yamauchi, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita
Pattern Formation by Oblivious Asynchronous Mobile Robots. SIAM J. Comput. 44 (3) (2015)
Yen Kaow Ng, Linzhi Yin, Hirotaka Ono, Shuai Cheng Li
Finding All Longest Common Segments in Protein Structures Efficiently. IEEE ACM Trans. Comput. Biol. Bioinform. 12 (3) (2015)
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
Graph Orientations Optimizing the Number of Light or Heavy Vertices. J. Graph Algorithms Appl. 19 (1) (2015)
Taisuke Izumi, Tomoko Izumi, Hirotaka Ono, Koichi Wada
Approximability of minimum certificate dispersal with tree structures. Theor. Comput. Sci. 591 (2015)
Kazuya Haraguchi, Hirotaka Ono
How Simple Algorithms Can Solve Latin Square Completion-Type Puzzles Approximately. J. Inf. Process. 23 (3) (2015)
T. Mizuno, H. Takara, Kohki Shibahara, Yutaka Miyamoto, Manabu Oguma, Hirotaka Ono, Y. Abe, Takashi Matsui, S. Matsuo, Kunimasa Saitoh, Y. Kimura
Mode dependent loss equaliser and impact of MDL on PDM-16QAM few-mode fibre transmission. ECOC (2015)

Hirotaka Ono.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Hirotaka Ono