Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHirotaka Ono
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j62]Takehiro Ito, Hirotaka Ono, Yota Otachi:
Reconfiguration of cliques in a graph. Discret. Appl. Math. 333: 43-58 (2023)- [c103]Tesshu Hanaka
, Hirotaka Ono, Yota Otachi, Saeki Uda:
Grouped Domination Parameterized by Vertex Cover, Twin Cover, and Beyond. CIAC 2023: 263-277 - [c102]Hironori Kiya, Yuto Okada, Hirotaka Ono, Yota Otachi:
Sequentially Swapping Tokens: Further on Graph Classes. SOFSEM 2023: 222-235 - [i29]Tesshu Hanaka, Hirotaka Ono, Yota Otachi, Saeki Uda:
Grouped Domination Parameterized by Vertex Cover, Twin Cover, and Beyond. CoRR abs/2302.06983 (2023) - [i28]Tesshu Hanaka, Hirotaka Ono, Kosuke Sugiyama:
Solving Distance-constrained Labeling Problems for Small Diameter Graphs via TSP. CoRR abs/2303.01290 (2023) - [i27]Mutsunori Banbara, Shin-ichi Minato, Hirotaka Ono, Ryuhei Uehara:
On the Computational Complexity of Generalized Common Shape Puzzles. CoRR abs/2305.10749 (2023) - 2022
- [j61]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): 871-895 (2022) - [j60]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: 281-294 (2022) - [j59]Tesshu Hanaka, Kazuma Kawai, Hirotaka Ono:
Computing L(p, 1)-Labeling with Combined Parameters. J. Graph Algorithms Appl. 26(2): 241-255 (2022) - [j58]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Upper and lower degree-constrained graph orientation with minimum penalty. Theor. Comput. Sci. 900: 53-78 (2022) - [c101]Tesshu Hanaka, Toshiyuki Hirose, Hirotaka Ono:
Capacitated Network Design Games on a Generalized Fair Allocation Model. AAMAS 2022: 1616-1617 - [c100]Toshimasa Ishii, Jun Kawahara, Kazuhisa Makino, Hirotaka Ono:
Reallocation Problems with Minimum Completion Time. COCOON 2022: 292-304 - [c99]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: 15:1-15:17 - [c98]Kanae Yoshiwatari, Hironori Kiya, Tesshu Hanaka, Hirotaka Ono:
Winner Determination Algorithms for Graph Games with Matching Structures. IWOCA 2022: 509-522 - [c97]Yuki Amano, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hirotaka Ono:
Fair Ride Allocation on a Line. SAGT 2022: 421-435 - [i26]Hironori Kiya, Yuto Okada, Hirotaka Ono, Yota Otachi:
Sequentially Swapping Tokens: Further on Graph Classes. CoRR abs/2210.02835 (2022) - [i25]Tesshu Hanaka, Hironori Kiya, Hirotaka Ono, Kanae Yoshiwatari:
Winner Determination Algorithms for Graph Games with Matching Structures. CoRR abs/2211.05307 (2022) - 2021
- [j57]Hironori Kiya, Katsuki Ohto, Hirotaka Ono:
Computing the Winner of 2-Player TANHINMIN. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 104-A(9): 1134-1141 (2021) - [j56]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Graph Orientation with Edge Modifications. Int. J. Found. Comput. Sci. 32(2): 209-233 (2021) - [c96]Tesshu Hanaka, Kazuma Kawai, Hirotaka Ono:
Computing L(p, 1)-Labeling with Combined Parameters. WALCOM 2021: 208-220 - [i24]Tesshu Hanaka, Toshiyuki Hirose, Hirotaka Ono:
Capacitated Network Design Games on a Generalized Fair Allocation Model. CoRR abs/2107.03040 (2021) - [i23]Toshimasa Ishii, Jun Kawahara, Kazuhisa Makino, Hirotaka Ono:
Reallocation Problems with Minimum Completion Time. CoRR abs/2111.02579 (2021) - 2020
- [j55]Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi:
Independent Set Reconfiguration Parameterized by Modular-Width. Algorithmica 82(9): 2586-2605 (2020) - [j54]Takehiro Ito, Marcin Jakub Kaminski, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, Katsuhisa Yamanaka:
Parameterized complexity of independent set reconfiguration problems. Discret. Appl. Math. 283: 336-345 (2020) - [j53]Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi:
Parameterized Complexity of Safe Set. J. Graph Algorithms Appl. 24(3): 215-245 (2020) - [j52]Masashi Kiyomi, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui:
Space-Efficient Algorithms for Longest Increasing Subsequence. Theory Comput. Syst. 64(3): 522-541 (2020) - [j51]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: 238-249 (2020) - [j50]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hesam Nikpey, Hirotaka Ono:
Graph orientation with splits. Theor. Comput. Sci. 844: 16-25 (2020) - [c95]Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden:
Hedonic Seat Arrangement Problems. AAMAS 2020: 1777-1779 - [c94]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: 43-55 - [c93]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: 1-3 - [c92]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: 627-635 - [i22]Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden:
Hedonic Seat Arrangement Problems. CoRR abs/2002.10898 (2020) - [i21]Yuki Amano, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hirotaka Ono:
Fair Ride Allocation on a Line. CoRR abs/2007.08045 (2020) - [i20]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 abs/2008.03448 (2020) - [i19]Tesshu Hanaka, Kazuma Kawai, Hirotaka Ono:
Computing L(p, 1)-Labeling with Combined Parameters. CoRR abs/2009.10502 (2020)
2010 – 2019
- 2019
- [j49]Tesshu Hanaka, Naomi Nishimura, Hirotaka Ono:
On directed covering and domination problems. Discret. Appl. Math. 259: 76-99 (2019) - [j48]Hitoshi Hayakawa, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
Settlement fund circulation problem. Discret. Appl. Math. 265: 86-103 (2019) - [j47]Tesshu Hanaka, Hans L. Bodlaender, Tom C. van der Zanden, Hirotaka Ono:
On the maximum weight minimal separator. Theor. Comput. Sci. 796: 294-308 (2019) - [c91]Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi:
Parameterized Complexity of Safe Set. CIAC 2019: 38-49 - [c90]Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima:
Exact Algorithms for the Bounded Repetition Longest Common Subsequence Problem. COCOA 2019: 1-12 - [c89]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Sandhya T. P.:
Graph Orientation with Edge Modifications. FAW 2019: 38-50 - [c88]Tesshu Hanaka, Hironori Kiya, Yasuhide Maei, Hirotaka Ono:
Computational Complexity of Hedonic Games on Sparse Graphs. PRIMA 2019: 576-584 - [c87]Hirotaka Ono:
Gain Control in Multi-Core EDFA with Hybrid-Pumping. OECC/PSC 2019: 1-3 - [c86]Hirotaka Ono, Hisato Yamanaka:
A 116/13-Approximation Algorithm for L(2, 1)-Labeling of Unit Disk Graphs. SOFSEM 2019: 379-391 - [c85]Masahiro Okubo, Tesshu Hanaka, Hirotaka Ono:
Optimal Partition of a Tree with Social Distance. WALCOM 2019: 121-132 - [c84]Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi:
Independent Set Reconfiguration Parameterized by Modular-Width. WG 2019: 285-297 - [i18]Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi:
Parameterized Complexity of Safe Set. CoRR abs/1901.09434 (2019) - [i17]Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi:
Independent Set Reconfiguration Parameterized by Modular-Width. CoRR abs/1905.00340 (2019) - [i16]Tesshu Hanaka, Hironori Kiya, Yasuhide Maei, Hirotaka Ono:
Computational Complexity of Hedonic Games on Sparse Graphs. CoRR abs/1908.11554 (2019) - 2018
- [j46]Hans L. Bodlaender, Hirotaka Ono, Yota Otachi:
Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity. Algorithmica 80(7): 2160-2180 (2018) - [j45]Hans L. Bodlaender, Hirotaka Ono, Yota Otachi:
A faster parameterized algorithm for Pseudoforest Deletion. Discret. Appl. Math. 236: 42-56 (2018) - [j44]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): 1221-1242 (2018) - [c83]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: 1-3 - [c82]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: 1-3 - [c81]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hesam Nikpey, Hirotaka Ono:
Graph Orientation with Splits. ISCO 2018: 52-63 - [c80]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: 1-3 - [c79]Masashi Kiyomi, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui:
Space-Efficient Algorithms for Longest Increasing Subsequence. STACS 2018: 44:1-44:15 - [i15]Masahiro Okubo, Tesshu Hanaka, Hirotaka Ono:
Optimal Partition of a Tree with Social Distance. CoRR abs/1809.03392 (2018) - 2017
- [c78]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: 1-3 - [c77]Tesshu Hanaka, Naomi Nishimura, Hirotaka Ono:
On Directed Covering and Domination Problems. ISAAC 2017: 45:1-45:12 - [c76]Hitoshi Hayakawa, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
Settlement Fund Circulation Problem. ISAAC 2017: 46:1-46:13 - [c75]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: 1-3 - [c74]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: 1-3 - [c73]Tesshu Hanaka, Hans L. Bodlaender, Tom C. van der Zanden, Hirotaka Ono:
On the Maximum Weight Minimal Separator. TAMC 2017: 304-318 - [i14]Masashi Kiyomi, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui:
Space-Efficient Algorithms for Longest Increasing Subsequence. CoRR abs/1712.09230 (2017) - 2016
- [j43]Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
(Total) Vector domination for graphs with bounded branchwidth. Discret. Appl. Math. 207: 80-89 (2016) - [j42]Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
Subexponential fixed-parameter algorithms for partial vector domination. Discret. Optim. 22: 111-121 (2016) - [j41]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation. Theory Comput. Syst. 58(1): 60-93 (2016) - [j40]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: 37-49 (2016) - [c72]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: 208-219 - [c71]Hans L. Bodlaender, Hirotaka Ono, Yota Otachi:
Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity. ISAAC 2016: 20:1-20:12 - [c70]Hans L. Bodlaender, Hirotaka Ono, Yota Otachi:
A Faster Parameterized Algorithm for Pseudoforest Deletion. IPEC 2016: 7:1-7:12 - [c69]Takayuki Mizuno, Kohki Shibahara, Hirotaka Ono, Y. Abe, Yutaka Miyamoto, Feihong Ye, Toshio Morioka, Yusuke Sasaki, Yoshimichi Amma, Katsuhiro Takenaga, S. Matsuo, Kazuhiko Aikawa, Kunimasa Saitoh, Yongmin Jung, David J. Richardson, Klaus Pulverer, Marc Bohn, Makoto 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: 1-3 - 2015
- [j39]Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Graph Orientations Optimizing the Number of Light or Heavy Vertices. J. Graph Algorithms Appl. 19(1): 441-465 (2015) - [j38]Kazuya Haraguchi, Hirotaka Ono:
How Simple Algorithms Can Solve Latin Square Completion-Type Puzzles Approximately. J. Inf. Process. 23(3): 276-283 (2015) - [j37]Nao Fujinaga, Yukiko Yamauchi, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita:
Pattern Formation by Oblivious Asynchronous Mobile Robots. SIAM J. Comput. 44(3): 740-785 (2015) - [j36]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): 644-655 (2015) - [j35]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: 660-661 (2015) - [j34]Taisuke Izumi, Tomoko Izumi, Hirotaka Ono, Koichi Wada:
Approximability of minimum certificate dispersal with tree structures. Theor. Comput. Sci. 591: 5-14 (2015) - [j33]Dariusz Dereniowski, Hirotaka Ono, Ichiro Suzuki, Lukasz Wrona, Masafumi Yamashita, Pawel Zylinski:
The searchlight problem for road networks. Theor. Comput. Sci. 591: 28-59 (2015) - [j32]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: 132-142 (2015) - [c68]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: 1-3 - [c67]Tadashi Wadayama, Taisuke Izumi, Hirotaka Ono:
Subgraph domatic problem and writing capacity of memory devices with restricted state transitions. ISIT 2015: 1307-1311 - [c66]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: 1-3 - [c65]Omar Rifki, Hirotaka Ono:
A Hybrid Approach of Optimization and Sampling for Robust Portfolio Selection. OR 2015: 317-324 - [c64]Tesshu Hanaka, Hirotaka Ono:
A Fixed-Parameter Algorithm for Max Edge Domination. SOFSEM (Student Research Forum Papers / Posters) 2015: 31-40 - [c63]Takehiro Ito, Hirotaka Ono, Yota Otachi:
Reconfiguration of Cliques in a Graph. TAMC 2015: 212-223 - [c62]Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki, Youcef Tebbal:
The Complexity of Dominating Set Reconfiguration. WADS 2015: 398-409 - [i13]Tadashi Wadayama, Taisuke Izumi, Hirotaka Ono:
Subgraph Domatic Problem and Writing Capacity of Memory Devises with Restricted State Transitions. CoRR abs/1501.04402 (2015) - [i12]Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki, Youcef Tebbal:
The complexity of dominating set reconfiguration. CoRR abs/1503.00833 (2015) - [i11]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 abs/1512.07533 (2015) - 2014
- [j31]Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, Koichi Yamazaki:
Approximating the path-distance-width for AT-free graphs and graphs in related classes. Discret. Appl. Math. 168: 69-77 (2014) - [j30]Hirotaka Ono:
Foreword. IEICE Trans. Inf. Syst. 97-D(3): 391 (2014) - [j29]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
Algorithmic aspects of distance constrained labeling: a survey. Int. J. Netw. Comput. 4(2): 251-259 (2014) - [j28]Takehiro Ito, Kazuto Kawamura, Hirotaka Ono, Xiao Zhou:
Reconfiguration of list L(2,1)-labelings in a graph. Theor. Comput. Sci. 544: 84-97 (2014) - [j27]Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno:
Base-object location problems for base-monotone regions. Theor. Comput. Sci. 555: 71-84 (2014) - [c61]Hidehiko Takara, Takayuki Mizuno, H. Kawakami, Yutaka Miyamoto, Hiroji Masuda, K. Kitamura, Hirotaka Ono, S. Asakawa, Yoshimichi Amma, Keisuke Hirakawa, S. Matsuo, K. Tsujikawa, Makoto Yamada:
120.7-Tb/s (7 SDM/180 WDM/95.8 Gb/s) MCF-ROPA un epeatered transmission of PDM-32QAM channels over 204 km. ECOC 2014: 1-3 - [c60]Kazuya Haraguchi, Hirotaka Ono:
Approximability of Latin Square Completion-Type Puzzles. FUN 2014: 218-229 - [c59]Takehiro Ito, Marcin Jakub Kaminski, Hirotaka Ono:
Fixed-Parameter Tractability of Token Jumping on Planar Graphs. ISAAC 2014: 208-219 - [c58]Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada:
Polynomial-Time Algorithm for Sliding Tokens on Trees. ISAAC 2014: 389-400 - [c57]Tetsuo Asano, Taisuke Izumi, Masashi Kiyomi, Matsuo Konagaya, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui, Ryuhei Uehara:
Depth-First Search Using O(n) Bits. ISAAC 2014: 553-564 - [c56]Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
Subexponential Fixed-Parameter Algorithms for Partial Vector Domination. ISCO 2014: 292-304 - [c55]Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
(Total) Vector Domination for Graphs with Bounded Branchwidth. LATIN 2014: 238-249 - [c54]Makoto Yamada, Hirotaka Ono, K. Ohta, Shinichi Aozasa, T. Tanaka, K. Senda, Y. Maeda, Osanori Koyama, Jun Ono:
1.7 µm band optical fiber amplifier. OFC 2014: 1-3 - [c53]Takehiro Ito, Marcin Kaminski, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, Katsuhisa Yamanaka:
On the Parameterized Complexity for Token Jumping on Graphs. TAMC 2014: 341-351 - [i10]Takehiro Ito, Marcin Kaminski, Hirotaka Ono:
Fixed-Parameter Tractability of Token Jumping on Planar Graphs. CoRR abs/1406.6567 (2014) - [i9]Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada:
Polynomial-Time Algorithm for Sliding Tokens on Trees. CoRR abs/1406.6576 (2014) - [i8]Takehiro Ito, Hirotaka Ono, Yota Otachi:
Reconfiguration of Cliques in a Graph. CoRR abs/1412.3976 (2014) - 2013
- [j26]Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, Ryuhei Uehara:
Route-Enabling Graph Orientation Problems. Algorithmica 65(2): 317-338 (2013) - [j25]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
A Linear Time Algorithm for L(2, 1)-Labeling of Trees. Algorithmica 66(3): 654-681 (2013) - [j24]Yuichi Asahiro, Eiji Miyano, Toshihide Murata, Hirotaka Ono:
Optimal approximability of bookmark assignments. Discret. Appl. Math. 161(16-17): 2361-2366 (2013) - [j23]Kazuya Haraguchi, Hirotaka Ono:
BLOCKSUM is NP-Complete. IEICE Trans. Inf. Syst. 96-D(3): 481-488 (2013) - [j22]