Hirotaka Ono

Yukiko Yamauchi, Masafumi Yamashita, Hirotaka Ono, 2012, 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum.

Collecting Moving Objects

Masafumi Yamashita, Yuichi Asahiro, Hirotaka Ono, 2007 .

A survey of computational approaches to portfolio optimization by genetic algorithms

Hirotaka Ono, Omar Rifki, H. Ono, 2012 .

Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree

Yuichi Asahiro, Hirotaka Ono, Eiji Miyano, 2007, AAIM.

Foreword

Hirotaka Ono, H. Ono, 2020, IEICE Trans. Inf. Syst..

Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG

Kunihiko Sadakane, Masafumi Yamashita, Hirotaka Ono, 2009, TAMC.

Independent Set Reconfiguration Parameterized by Modular-Width

Yota Otachi, Hirotaka Ono, Michael Lampis, 2020, Algorithmica.

FPT Algorithms for Token Jumping on Graphs (コンピュテーション)

Takehiro Ito, Hirotaka Ono, Marcin Kamiński, 2014 .

The (2, 1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2

Hirotaka Ono, Toshimasa Ishii, Yushi Uno, 2010, IWOCA.

On the approximability and hardness of minimum topic connected overlay and its special instances

Monika Steinová, Koichi Wada, Juraj Hromkovic, 2011, Theor. Comput. Sci..

Minimum Certificate Dispersal with Tree Structures

Tomoko Izumi, Koichi Wada, Hirotaka Ono, 2012, TAMC.

C- and L-Band Parallel Configuration Optical Fiber Amplifier Employing Bundled Er3+-Doped Fiber

Makoto Yamada, Hirotaka Ono, Masaharu Uno, 2012, IEICE Trans. Commun..

Dense SDM (12-Core $\times$ 3-Mode) Transmission Over 527 km With 33.2-ns Mode-Dispersion Employing Low-Complexity Parallel MIMO Frequency-Domain Equalization

Toshio Morioka, Takayuki Kobayashi, Yutaka Miyamoto, 2016, Journal of Lightwave Technology.

Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity

Yota Otachi, Hirotaka Ono, Hans L. Bodlaender, 2016, Algorithmica.

The searchlight problem for road networks

Pawel Zylinski, Masafumi Yamashita, Ichiro Suzuki, 2015, Theor. Comput. Sci..

1.01-Pb/s (12 SDM/222 WDM/456 Gb/s) Crosstalk-managed Transmission with 91.4-b/s/Hz Aggregate Spectral Efficiency

Toshio Morioka, Takayuki Kobayashi, Yoshiteru Abe, 2012 .

Upper and Lower Degree Bounded Graph Orientation with Minimum Penalty

Yuichi Asahiro, Hirotaka Ono, Eiji Miyano, 2011, CATS.

Polynomial-Time Algorithm for Sliding Tokens on Trees

Yota Otachi, Takehiro Ito, Erik D. Demaine, 2014, ISAAC.

A Linear Time Algorithm for L(2,1)-Labeling of Trees

Hirotaka Ono, Toshimasa Ishii, Yushi Uno, 2012, Algorithmica.

A tight upper bound on the (2, 1)-total labeling number of outerplanar graphs pdf

Hirotaka Ono, Toshimasa Ishii, Yushi Uno, 2012, J. Discrete Algorithms.

Graph orientation to maximize the minimum weighted outdegree

Yuichi Asahiro, Hirotaka Ono, Eiji Miyano, 2009, IPDPS.

The (p, q)-total labeling problem for trees

Hirotaka Ono, Toshimasa Ishii, Yushi Uno, 2012, Discret. Math..

Maximum Domination Problem

Hirotaka Ono, Eiji Miyano, 2011, CATS.

Deductive inference for the interiors and exteriors of horn theories pdf

Kazuhisa Makino, Hirotaka Ono, 2012, TOCL.

On space complexity of self-stabilizing leader election in mediated population protocol

Masafumi Yamashita, Hirotaka Ono, Shuji Kijima, 2012, Distributed Computing.

Iterative Unreplicated Parallel Interference Canceler for MDL-Tolerant Dense SDM (12-Core × 3-Mode) Transmission Over 3000 km

Yutaka Miyamoto, Kazuhide Nakajima, Kunimasa Saitoh, 2019, Journal of Lightwave Technology.

10th workshop on Advances in Parallel and Distributed Computational Models - APDCM'08

Arnold L. Rosenberg, Oscar H. Ibarra, Albert Y. Zomaya, 2008, IPDPS.

Novel Crosstalk Measurement Method for Multi-Core Fiber Fan-In/Fan-Out Devices

Toshio Morioka, Makoto Yamada, Yoshiteru Abe, 2016, IEEE Photonics Technology Letters.

Parameterized Complexity of Safe Set

Yota Otachi, Hirotaka Ono, Michael Lampis, 2019, CIAC.

Long-Distance PDM-32QAM 3-Mode Fibre Transmission Over 1000 km Using Hybrid Multicore EDFA/Raman Repeated Amplification with Cyclic Mode Permutation

Takayuki Mizuno, Yutaka Miyamoto, Kohki Shibahara, 2018, 2018 European Conference on Optical Communication (ECOC).

Hybrid Cladding-pumped EDFA/Raman for SDM Transmission Systems Using Core-by-core Gain Control Scheme

Mitsunori Fukutoku, Yutaka Miyamoto, Kohki Shibahara, 2017, 2017 European Conference on Optical Communication (ECOC).

Integrating local search and network flow to solve the inventory routing problem

Hoong Chuin Lau, Hirotaka Ono, Qi Zhang Liu, 2002, AAAI/IAAI.

SDM-compatible dynamic gain equalizer using spatial and planar optical circuit

Mitsunori Fukutoku, Yutaka Miyamoto, Hirotaka Ono, 2017, 2017 Optical Fiber Communications Conference and Exhibition (OFC).

How to Collect Balls Moving in the Euclidean Plane

Kazuhisa Makino, Takashi Horiyama, Masafumi Yamashita, 2004, CATS.

A-023 Compressing a Suffix Tree by Converting it to a Binary Tree and Using Succinct Data Structures

Masafumi Yamashita, Hirotaka Ono, Masahiro Baba, 2010 .

Self-Indexed Grammar-Based Compression by Edit Sensitive Parsing

Hiroshi Sakamoto, Kunihiko Sadakane, Masafumi Yamashita, 2010 .

Iterative Unreplicated Parallel Interference Canceler for MDL-Tolerant Dense SDM $(12-\text{Core}\times 3-\text{Mode})$ Transmission Over 3000 km

Takayuki Mizuno, Yutaka Miyamoto, Kazuhide Nakajima, 2018, 2018 European Conference on Optical Communication (ECOC).

Pattern Formation by Oblivious Asynchronous Mobile Robots

Yukiko Yamauchi, Masafumi Yamashita, Hirotaka Ono, 2015, SIAM J. Comput..

An Improvement of Optimal Ate Pairing on KSS Curve with Pseudo 12-Sparse Multiplication

Masaaki Shirase, Yasuyuki Nogami, Hirotaka Ono, 2016, ICISC.

The Complexity of Dominating Set Reconfiguration

Takehiro Ito, Naomi Nishimura, Amer E. Mouawad, 2015, WADS.

Extracting Hierarchical Knowledge Structures in Logical Analysis of Data

Hirotaka Ono, 廣隆小野, H. Ono, 2006 .

Graph Orientations Optimizing the Number of Light or Heavy Vertices

Yuichi Asahiro, Hirotaka Ono, Eiji Miyano, 2012, J. Graph Algorithms Appl..

Graph Orientation with Splits

Yuichi Asahiro, Hirotaka Ono, Eiji Miyano, 2018, ISCO.

Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree

Yuichi Asahiro, Hirotaka Ono, Eiji Miyano, 2008, Discret. Appl. Math..

Exact Algorithms for the Bounded Repetition Longest Common Subsequence Problem

Guohui Lin, Yuichi Asahiro, Hirotaka Ono, 2019, COCOA.

(Total) Vector domination for graphs with bounded branchwidth pdf

Hirotaka Ono, Toshimasa Ishii, Yushi Uno, 2013, Discret. Appl. Math..

Neighborhood Composition: A Parallelization of Local Search Algorithms

Kunihiko Sadakane, Masafumi Yamashita, Hirotaka Ono, 2004, PVM/MPI.

The Balanced Edge Cover Problem

Kunihiko Sadakane, Masafumi Yamashita, Hirotaka Ono, 2008, ISAAC.

Dynamic Neighborhood Searches for Thermodynamically Designing DNA Sequence

Kunihiko Sadakane, Masafumi Yamashita, Hirotaka Ono, 2007, DNA.

Approximating the path-distance-width for AT-free graphs and graphs in related classes

Yota Otachi, Koichi Yamazaki, Yoshio Okamoto, 2014, Discret. Appl. Math..

Finding Longest Common Segments in Protein Structures in Nearly Linear Time

Shuai Cheng Li, Hirotaka Ono, Ling Ge, 2012, CPM.

Upper and Lower Bounds of Space Complexity of Self-Stabilizing Leader Election in Mediated Population Protocol

Masafumi Yamashita, Hirotaka Ono, Shuji Kijima, 2010, OPODIS.

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

Hirotaka Ono, Tesshu Hanaka, Naoka Fukuzono, 2020, SOFSEM.

Graph orientation to maximize the minimum weighted outdegree

Yuichi Asahiro, Hirotaka Ono, Eiji Miyano, 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.

Approximability and inapproximability of the minimum certificate dispersal problem

Tomoko Izumi, Koichi Wada, Hirotaka Ono, 2010, Theor. Comput. Sci..

Space-Efficient Algorithms for Longest Increasing Subsequence

Yota Otachi, Masashi Kiyomi, Hirotaka Ono, 2018, STACS.

How to Design a Linear Cover Time Random Walk on a Finite Graph

Kunihiko Sadakane, Masafumi Yamashita, Yoshiaki Nonaka, 2009, SAGA.

Linear-time algorithm for sliding tokens on trees

Yota Otachi, Takehiro Ito, Erik D. Demaine, 2014, Theor. Comput. Sci..

Route-Enabling Graph Orientation Problems

Takehiro Ito, Ryuhei Uehara, Hisao Tamaki, 2009, ISAAC.

Coalescing random walks and voting on graphs pdf

Colin Cooper, Robert Elsässer, Hirotaka Ono, 2012, PODC '12.

A decomposability index in logical analysis of data

Toshihide Ibaraki, Mutsunori Yagiura, Hirotaka Ono, 2004, Discret. Appl. Math..

32-core Inline Multicore Fiber Amplifier for Dense Space Division Multiplexed Transmission Systems: Post Deadline session.

Toshio Morioka, David J. Richardson, Yusuke Sasaki, 2016 .

A Faster Parameterized Algorithm for Pseudoforest Deletion

Yota Otachi, Hirotaka Ono, Hans L. Bodlaender, 2016, IPEC.

Approximating the path-distance-width for $k$-cocomparability graphs (Mathematical Foundations and Applications of Computer Science and Algorithms)

Yota Otachi, Koichi Yamazaki, Yoshio Okamoto, 2011 .

100 Gbit/s x 10 channel OTDM/WDM Transmission using a Single Supercontinuum WDM Source

Toshio Morioka, Masatoshi Saruwatari, Hidehiko Takara, 1996 .

Gain Control in Multi-Core EDFA with Hybrid-Pumping

Hirotaka Ono, 2019, 2019 24th OptoElectronics and Communications Conference (OECC) and 2019 International Conference on Photonics in Switching and Computing (PSC).

Drawing Borders Efficiently

Hirotaka Ono, Kazuo Iwama, Eiji Miyano, 2007, FUN.

Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation

Yuichi Asahiro, Hirotaka Ono, Eiji Miyano, 2014, Theory of Computing Systems.

Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree

Yuichi Asahiro, Hirotaka Ono, Eiji Miyano, 2011, J. Comb. Optim..

Optimal Balanced Semi-Matchings for Weighted Bipartite Graphs

Kunihiko Sadakane, Masafumi Yamashita, Hirotaka Ono, 2007 .

Multicore EDFA for long-distance transmission

Makoto Yamada, Shoichiro Matsuo, Hirotaka Ono, 2013, Photonics West - Optoelectronic Materials and Devices.

Deductive Inference for the Interiors and Exteriors of Horn Theories

Kazuhisa Makino, Hirotaka Ono, 2008, ISAAC.

Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem

Tomoko Izumi, Koichi Wada, Hirotaka Ono, 2009, COCOON.

Safe sets in graphs: Graph classes and structural parameters

Zsolt Tuza, Yota Otachi, Tadashi Sakuma, 2018, J. Comb. Optim..

How to Collect Balls Moving in the Euclidean Plane

Kazuhisa Makino, Takashi Horiyama, Masafumi Yamashita, 2004, Electron. Notes Theor. Comput. Sci..

A Hybrid Approach of Optimization and Sampling for Robust Portfolio Selection

Hirotaka Ono, Omar Rifki, 2015, OR.

Erratum to: "On the Approximability and Hardness of Minimum Topic Connected Overlay and Its Special Instances"

Monika Steinová, Koichi Wada, Hirotaka Ono, 2012 .

Advances in parallel and distributed computing models - APDCM

Lali Barrière, Henri Casanova, Paola Flocchini, 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.

A Fixed-Parameter Algorithm for Max Edge Domination

Hirotaka Ono, Tesshu Hanaka, 2015, SOFSEM.

An O(n1.75) algorithm for L(2, 1)-labeling of trees

Hirotaka Ono, Toshimasa Ishii, Yushi Uno, 2009, Theor. Comput. Sci..

Subexponential fixed-parameter algorithms for partial vector domination

Hirotaka Ono, Toshimasa Ishii, Yushi Uno, 2016, Discret. Optim..

Parameterized complexity of independent set reconfiguration problems

Takehiro Ito, Ryuhei Uehara, Akira Suzuki, 2020, Discret. Appl. Math..

Space-Efficient Algorithms for Longest Increasing Subsequence

Yota Otachi, Masashi Kiyomi, Hirotaka Ono, 2017, Theory of Computing Systems.

Hedonic Seat Arrangement Problems

Yota Otachi, Hirotaka Ono, Hans L. Bodlaender, 2020, AAMAS.

1580 nm band all-optical ADM node prototype equipped with past automatic level control

M. Fukui, Masahiko Jinno, K. Oguchi, 1998, 24th European Conference on Optical Communication. ECOC '98 (IEEE Cat. No.98TH8398).

Energy-optimal online algorithms for broadcasting in wireless networks

Shay Kutten, David Peleg, Kunihiko Sadakane, 2005, Second Annual Conference on Wireless On-demand Network Systems and Services.

Local move connectedness of domino tilings with diagonal impurities

Hirotaka Ono, Taizo Sadahiro, Fuminiko Nakano, 2010, Discret. Math..

Base-object location problems for base-monotone regions

Yota Otachi, Takehiro Ito, Takashi Horiyama, 2014, Theor. Comput. Sci..

Computational Complexity of Hedonic Games on Sparse Graphs pdf

Hirotaka Ono, Tesshu Hanaka, Hironori Kiya, 2019, PRIMA.

Approximability of minimum certificate dispersal with tree structures

Tomoko Izumi, Koichi Wada, Hirotaka Ono, 2015, Theor. Comput. Sci..

An Algorithm for L(2, 1)-Labeling of Trees

Hirotaka Ono, Toshimasa Ishii, Yushi Uno, 2008, SWAT.

Novel fiber amplifier technology

Shinichi Aozasa, Hirotaka Ono, Makoto Yamada, 2003, SPIE ITCom.

Subexponential fixed-parameter algorithms for partial vector domination

Hirotaka Ono, Toshimasa Ishii, Yushi Uno, 2014, Discret. Optim..

A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems

Masafumi Yamashita, Hirotaka Ono, Ei Ando, 2009, SAGA.

A generic search strategy for large-scale real-world networks

Kunihiko Sadakane, Masafumi Yamashita, Hirotaka Ono, 2006, InfoScale '06.

Computing the Distribution Function of the Stochastic Longest Path Length in a DAG with Continuously Distributed Edge Lengths (Theoretical Computer Science and Its Applications)

Masafumi Yamashita, Hirotaka Ono, Ei Ando, 2009 .

Algorithms and Computation, 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings

Hirotaka Ono, Naoki Katoh, Toshihide Ibaraki, 2003 .

Graph Orientation with Edge Modifications

Yuichi Asahiro, Hirotaka Ono, Eiji Miyano, 2019, FAW.

B LOCK S UM is NP-Complete

Hirotaka Ono, Kazuya Haraguchi, 2013 .

A 116/13-Approximation Algorithm for L(2, 1)-Labeling of Unit Disk Graphs

Hirotaka Ono, Hisato Yamanaka, 2019, SOFSEM.

Approximability of the Path-Distance-Width for AT-free Graphs

Yota Otachi, Koichi Yamazaki, Yoshio Okamoto, 2011, WG.

The hitting and cover times of Metropolis walks

Kunihiko Sadakane, Masafumi Yamashita, Yoshiaki Nonaka, 2010, Theor. Comput. Sci..

Complexity of minimum certificate dispersal problem with tree structure (コンピュテーション)

Tomoko Izumi, Hirotaka Ono, Taisuke Izumi, 2011 .

The (p, q)-total Labeling Problem for Trees

Hirotaka Ono, Toshimasa Ishii, Yushi Uno, 2010, ISAAC.

DNA Sequence Design by Dynamic Neighborhood Searches

Kunihiko Sadakane, Masafumi Yamashita, Hirotaka Ono, 2006, DNA.

Fast Random Walks on Finite Graphs and Graph Topological Information

Hirotaka Ono, 2011, 2011 Second International Conference on Networking and Computing.

The space complexity of the leader election in anonymous networks

Kunihiko Sadakane, Masafumi Yamashita, Hirotaka Ono, 2008, 2008 IEEE International Symposium on Parallel and Distributed Processing.

First demonstration of 1580 nm wavelength band WDM transmission for doubling usable bandwidth and suppressing FWM in DSF

M. Fukui, Masahiko Jinno, K. Oguchi, 1997 .

On directed covering and domination problems

Naomi Nishimura, Hirotaka Ono, Tesshu Hanaka, 2019, Discret. Appl. Math..

Pattern Formation through Optimum Matching by Oblivious CORDA Robots

Masafumi Yamashita, Hirotaka Ono, Shuji Kijima, 2010, OPODIS.

Optimal Partition of a Tree with Social Distance

Hirotaka Ono, Tesshu Hanaka, Masahiro Okubo, 2018, WALCOM.

Coalescing Random Walks and Voting on Connected Graphs

Colin Cooper, Robert Elsässer, Hirotaka Ono, 2012, SIAM J. Discret. Math..

Fixed-Parameter Tractability of Token Jumping on Planar Graphs pdf

Takehiro Ito, Marcin Kaminski, Hirotaka Ono, 2014, ISAAC.

Foreword: Special section on foundations of computer science - New trends in theory of computation and algorithm-

Hirotaka Ono, 2014 .

Drawing Borders Efficiently

Hirotaka Ono, Kazuo Iwama, Eiji Miyano, 2008, Theory of Computing Systems.

On Approximation of Bookmark Assignments

Yuichi Asahiro, Hirotaka Ono, Eiji Miyano, 2007, MFCS.

On Directed Covering and Domination Problems

Naomi Nishimura, Hirotaka Ono, Tesshu Hanaka, 2017, ISAAC.

Recent Advances on Distance Constrained Labeling Problems

Hirotaka Ono, 2013, 2013 First International Symposium on Computing and Networking.

The complexity of dominating set reconfiguration pdf

Takehiro Ito, Naomi Nishimura, Amer E. Mouawad, 2015, Theor. Comput. Sci..

DNA Sequence Desgin Using Hidden Markov Models

Masafumi Yamashita, Hirotaka Ono, Kunihiko Sadakane, 2006 .

A Faster Parameterized Algorithm for Pseudoforest Deletion

Yota Otachi, Hirotaka Ono, Hans L. Bodlaender, 2017, IPEC.

On the Parameterized Complexity for Token Jumping on Graphs

Takehiro Ito, Ryuhei Uehara, Marcin Kaminski, 2014, TAMC.

Low-loss fiber-bundle-type fan-in/fan-out device for 6-mode 19-core fiber

Yoshiteru Abe, Hirotaka Ono, Kota Shikama, 2017, 2017 Optical Fiber Communications Conference and Exhibition (OFC).

Settlement Fund Circulation Problem

Hirotaka Ono, Toshimasa Ishii, Yushi Uno, 2019, ISAAC.