An Index for the Data Size to Extract Decomposable Structures in LAD. - Hirotaka Ono 001; Mutsunori Yagiura; Toshihide Ibaraki (ISAAC, 2001)

Integrating Local Search and Network Flow to Solve the Inventory Routing Problem. - Hoong Chuin Lau; Qi Zhang Liu; Hirotaka Ono 001 (AAAI/IAAI, 2002)

Logical analysis of data with decomposable structures. - Hirotaka Ono 001; Kazuhisa Makino; Toshihide Ibaraki (Theor. Comput. Sci., 2002)

Interior and exterior functions of positive Boolean functions. - Kazuhisa Makino; Hirotaka Ono 001; Toshihide Ibaraki (Discret. Appl. Math., 2003)

Neighborhood Composition: A Parallelization of Local Search Algorithms. - Yuichi Handa; Hirotaka Ono 001; Kunihiko Sadakane; Masafumi Yamashita (PVM/MPI, 2004)

A decomposability index in logical analysis of data. - Hirotaka Ono 001; Mutsunori Yagiura; Toshihide Ibaraki (Discret. Appl. Math., 2004)

Best Fitting Fixed-Length Substring Patterns for a Set of Strings. - Hirotaka Ono 001; Yen Kaow Ng (COCOON, 2005)

Measuring Over-Generalization in the Minimal Multiple Generalizations of Biosequences. - Yen Kaow Ng; Hirotaka Ono 001; Takeshi Shinohara (Discovery Science, 2005)

A Local Search Based Barrier Height Estimation Algorithm for DNA Molecular Transitions. - Tsutomu Takeda; Hirotaka Ono 001; Kunihiko Sadakane; Masafumi Yamashita (DNA, 2005)

Energy-Optimal Online Algorithms for Broadcasting in Wireless Networks. - Shay Kutten; Hirotaka Ono 001; David Peleg; Kunihiko Sadakane; Masafumi Yamashita (WONS, 2005)

DNA Sequence Design by Dynamic Neighborhood Searches. - Suguru Kawashimo; Hirotaka Ono 001; Kunihiko Sadakane; Masafumi Yamashita (DNA, 2006)

A Probabilistic Model of the DNA Conformational Change. - Masashi Shiozaki; Hirotaka Ono 001; Kunihiko Sadakane; Masafumi Yamashita (DNA, 2006)

A generic search strategy for large-scale real-world networks. - Yuichi Kurumida; Tsukasa Ogata; Hirotaka Ono 001; Kunihiko Sadakane; Masafumi Yamashita (Infoscale, 2006)

Forest Search: A Paradigm for Faster Exploration of Scale-Free Networks. - Yuichi Kurumida; Hirotaka Ono 001; Kunihiko Sadakane; Masafumi Yamashita (ISPA, 2006)

How to collect balls moving in the Euclidean plane. - Yuichi Asahiro; Takashi Horiyama; Kazuhisa Makino; Hirotaka Ono 001; Toshinori Sakuma; Masafumi Yamashita (Discret. Appl. Math., 2006)

Dynamic Neighborhood Searches for Thermodynamically Designing DNA Sequence. - Suguru Kawashimo; Hirotaka Ono 001; Kunihiko Sadakane; Masafumi Yamashita (DNA, 2007)

On Approximation of Bookmark Assignments. - Yuichi Asahiro; Eiji Miyano; Toshihide Murata; Hirotaka Ono 001 (MFCS, 2007)

Graph Orientation Algorithms to minimize the Maximum Outdegree. - Yuichi Asahiro; Eiji Miyano; Hirotaka Ono 001; Kouhei Zenmyo (Int. J. Found. Comput. Sci., 2007)

Optimal Balanced Semi-Matchings for Weighted Bipartite Graphs. - Yuta Harada; Hirotaka Ono 001; Kunihiko Sadakane; Masafumi Yamashita (Inf. Media Technol., 2007)

Speeding Up Local-Search Type Algorithms for Designing DNA Sequences under Thermodynamical Constraints. - Suguru Kawashimo; Yen Kaow Ng; Hirotaka Ono 001; Kunihiko Sadakane; Masafumi Yamashita (DNA, 2008)

The Balanced Edge Cover Problem. - Yuta Harada; Hirotaka Ono 001; Kunihiko Sadakane; Masafumi Yamashita (ISAAC, 2008)

An Algorithm for L(2, 1)-Labeling of Trees. - Toru Hasunuma; Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (SWAT, 2008)

A linear time algorithm for L(2,1)-labeling of trees - Toru Hasunuma; Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (CoRR, 2008)

Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem. - Tomoko Izumi; Taisuke Izumi; Hirotaka Ono 001; Koichi Wada 001 (COCOON, 2009)

A Linear Time Algorithm for L(2, 1)-Labeling of Trees. - Toru Hasunuma; Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (ESA, 2009)

A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems. - Ei Ando; Hirotaka Ono 001; Masafumi Yamashita (SAGA, 2009)

How to Design a Linear Cover Time Random Walk on a Finite Graph. - Yoshiaki Nonaka; Hirotaka Ono 001; Kunihiko Sadakane; Masafumi Yamashita (SAGA, 2009)

Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG. - Ei Ando; Hirotaka Ono 001; Kunihiko Sadakane; Masafumi Yamashita (TAMC, 2009)

A tight upper bound on the (2,1)-total labeling number of outerplanar graphs - Toru Hasunuma; Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (CoRR, 2009)

Drawing Borders Efficiently. - Kazuo Iwama; Eiji Miyano; Hirotaka Ono 001 (Theory Comput. Syst., 2009)

An O(n1.75) algorithm for L(2, 1)-labeling of trees. - Toru Hasunuma; Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (Theor. Comput. Sci., 2009)

The (p, q)-total Labeling Problem for Trees. - Toru Hasunuma; Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (ISAAC (2), 2010)

The (2, 1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2. - Toru Hasunuma; Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (IWOCA, 2010)

Pattern Formation through Optimum Matching by Oblivious CORDA Robots. - Nao Fujinaga; Hirotaka Ono 001; Shuji Kijima; Masafumi Yamashita (OPODIS, 2010)

Upper and Lower Bounds of Space Complexity of Self-Stabilizing Leader Election in Mediated Population Protocol. - Ryu Mizoguchi; Hirotaka Ono 001; Shuji Kijima; Masafumi Yamashita (OPODIS, 2010)

Local move connectedness of domino tilings with diagonal impurities. - Fuminiko Nakano; Hirotaka Ono 001; Taizo Sadahiro (Discret. Math., 2010)

The Space Complexity of Leader Election in Anonymous Networks. - Ei Ando; Hirotaka Ono 001; Kunihiko Sadakane; Masafumi Yamashita (Int. J. Found. Comput. Sci., 2010)

Approximability and inapproximability of the minimum certificate dispersal problem. - Tomoko Izumi; Taisuke Izumi; Hirotaka Ono 001; Koichi Wada 001 (Theor. Comput. Sci., 2010)

The hitting and cover times of Metropolis walks. - Yoshiaki Nonaka; Hirotaka Ono 001; Kunihiko Sadakane; Masafumi Yamashita (Theor. Comput. Sci., 2010)

Maximum Domination Problem. - Eiji Miyano; Hirotaka Ono 001 (CATS, 2011)

How Slow, or Fast, Are Standard Random Walks? - Analyses of Hitting and Cover Times on Tree. - Yoshiaki Nonaka; Hirotaka Ono 001; Shuji Kijima; Masafumi Yamashita (CATS, 2011)

Fast Random Walks on Finite Graphs and Graph Topological Information. - Hirotaka Ono 001 (ICNC, 2011)

On the Approximability of Minimum Topic Connected Overlay and Its Special Instances. - Jun Hosoda; Juraj Hromkovic; Taisuke Izumi; Hirotaka Ono 001; Monika Steinová; Koichi Wada 001 (MFCS, 2011)

Approximability of the Path-Distance-Width for AT-free Graphs. - Yota Otachi; Toshiki Saitoh; Katsuhisa Yamanaka; Shuji Kijima; Yoshio Okamoto; Hirotaka Ono 001; Yushi Uno; Koichi Yamazaki (WG, 2011)

Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree. - Yuichi Asahiro; Eiji Miyano; Hirotaka Ono 001 (Discret. Appl. Math., 2011)

Graph Orientation to Maximize the Minimum Weighted Outdegree. - Yuichi Asahiro; Jesper Jansson 001; Eiji Miyano; Hirotaka Ono 001 (Int. J. Found. Comput. Sci., 2011)

Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree. - Yuichi Asahiro; Jesper Jansson 001; Eiji Miyano; Hirotaka Ono 001; Kouhei Zenmyo (J. Comb. Optim., 2011)

Broadcastings and digit tilings on three-dimensional torus networks. - Ryotaro Okazaki; Hirotaka Ono 001; Taizo Sadahiro; Masafumi Yamashita (Theor. Comput. Sci., 2011)

Upper and Lower Degree Bounded Graph Orientation with Minimum Penalty. - Yuichi Asahiro; Jesper Jansson 001; Eiji Miyano; Hirotaka Ono 001 (CATS, 2012)

Finding Longest Common Segments in Protein Structures in Nearly Linear Time. - Yen Kaow Ng; Hirotaka Ono 001; Ling Ge; Shuai Cheng Li 001 (CPM, 2012)

An Extension of Matthews' Bound to Multiplex Random Walks. - Yusuke Hosaka; Yukiko Yamauchi; Shuji Kijima; Hirotaka Ono 001; Masafumi Yamashita (IPDPS Workshops, 2012)

Reconfiguration of List L(2, 1)-Labelings in a Graph. - Takehiro Ito; Kazuto Kawamura; Hirotaka Ono 001; Xiao Zhou 001 (ISAAC, 2012)

Coalescing random walks and voting on graphs. - Colin Cooper; Robert Elsässer; Hirotaka Ono 001; Tomasz Radzik (PODC, 2012)

Minimum Certificate Dispersal with Tree Structures. - Taisuke Izumi; Tomoko Izumi; Hirotaka Ono 001; Koichi Wada 001 (TAMC, 2012)

On space complexity of self-stabilizing leader election in mediated population protocol. - Ryu Mizoguchi; Hirotaka Ono 001; Shuji Kijima; Masafumi Yamashita (Distributed Comput., 2012)

The (p, q)-total labeling problem for trees. - Toru Hasunuma; Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (Discret. Math., 2012)

A tight upper bound on the (2, 1)-total labeling number of outerplanar graphs. - Toru Hasunuma; Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (J. Discrete Algorithms, 2012)

On the approximability and hardness of minimum topic connected overlay and its special instances. - Jun Hosoda; Juraj Hromkovic; Taisuke Izumi; Hirotaka Ono 001; Monika Steinová; Koichi Wada 001 (Theor. Comput. Sci., 2012)

Deductive inference for the interiors and exteriors of horn theories. - Kazuhisa Makino; Hirotaka Ono 001 (ACM Trans. Comput. Log., 2012)

Recent Advances on Distance Constrained Labeling Problems. - Hirotaka Ono 001 (CANDAR, 2013)

Robustness Analysis of Evolutionary Algorithms to Portfolio Optimization Against Errors in Asset Means. - Omar Rifki; Hirotaka Ono 001 (OR, 2013)

Base Location Problems for Base-Monotone Regions. - Jinhee Chun; Takashi Horiyama; Takehiro Ito; Natsuda Kaothanthong; Hirotaka Ono 001; Yota Otachi; Takeshi Tokuyama; Ryuhei Uehara; Takeaki Uno (WALCOM, 2013)

A Linear Time Algorithm for L(2, 1)-Labeling of Trees. - Toru Hasunuma; Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (Algorithmica, 2013)

Route-Enabling Graph Orientation Problems. - Takehiro Ito; Yuichiro Miyamoto; Hirotaka Ono 001; Hisao Tamaki; Ryuhei Uehara (Algorithmica, 2013)

Optimal approximability of bookmark assignments. - Yuichi Asahiro; Eiji Miyano; Toshihide Murata; Hirotaka Ono 001 (Discret. Appl. Math., 2013)

BLOCKSUM is NP-Complete. - Kazuya Haraguchi; Hirotaka Ono 001 (IEICE Trans. Inf. Syst., 2013)

Coalescing Random Walks and Voting on Connected Graphs. - Colin Cooper; Robert Elsässer; Hirotaka Ono 001; Tomasz Radzik (SIAM J. Discret. Math., 2013)

Approximability of Latin Square Completion-Type Puzzles. - Kazuya Haraguchi; Hirotaka Ono 001 (FUN, 2014)

Depth-First Search Using O(n) Bits. - Tetsuo Asano; Taisuke Izumi; Masashi Kiyomi; Matsuo Konagaya; Hirotaka Ono 001; Yota Otachi; Pascal Schweitzer; Jun Tarui; Ryuhei Uehara (ISAAC, 2014)

Polynomial-Time Algorithm for Sliding Tokens on Trees. - Erik D. Demaine; Martin L. Demaine; Eli Fox-Epstein; Duc A. Hoang 001; Takehiro Ito; Hirotaka Ono 001; Yota Otachi; Ryuhei Uehara; Takeshi Yamada (ISAAC, 2014)

Fixed-Parameter Tractability of Token Jumping on Planar Graphs. - Takehiro Ito; Marcin Jakub Kaminski; Hirotaka Ono 001 (ISAAC, 2014)

On the Parameterized Complexity for Token Jumping on Graphs. - Takehiro Ito; Marcin Kaminski 001; Hirotaka Ono 001; Akira Suzuki 001; Ryuhei Uehara; Katsuhisa Yamanaka (TAMC, 2014)

Approximating the path-distance-width for AT-free graphs and graphs in related classes. - Yota Otachi; Toshiki Saitoh; Katsuhisa Yamanaka; Shuji Kijima; Yoshio Okamoto; Hirotaka Ono 001; Yushi Uno; Koichi Yamazaki (Discret. Appl. Math., 2014)

Foreword. - Hirotaka Ono 001 (IEICE Trans. Inf. Syst., 2014)

Algorithmic aspects of distance constrained labeling: a survey. - Toru Hasunuma; Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (Int. J. Netw. Comput., 2014)

Base-object location problems for base-monotone regions. - Jinhee Chun; Takashi Horiyama; Takehiro Ito; Natsuda Kaothanthong; Hirotaka Ono 001; Yota Otachi; Takeshi Tokuyama; Ryuhei Uehara; Takeaki Uno (Theor. Comput. Sci., 2014)

Reconfiguration of list L(2,1)-labelings in a graph. - Takehiro Ito; Kazuto Kawamura; Hirotaka Ono 001; Xiao Zhou 001 (Theor. Comput. Sci., 2014)

Subgraph domatic problem and writing capacity of memory devices with restricted state transitions. - Tadashi Wadayama; Taisuke Izumi; Hirotaka Ono 001 (ISIT, 2015)

A Hybrid Approach of Optimization and Sampling for Robust Portfolio Selection. - Omar Rifki; Hirotaka Ono 001 (OR, 2015)

A Fixed-Parameter Algorithm for Max Edge Domination. - Tesshu Hanaka; Hirotaka Ono 001 (SOFSEM (Student Research Forum Papers / Posters), 2015)

Subgraph Domatic Problem and Writing Capacity of Memory Devises with Restricted State Transitions. - Tadashi Wadayama; Taisuke Izumi; Hirotaka Ono 001 (CoRR, 2015)

Graph Orientations Optimizing the Number of Light or Heavy Vertices. - Yuichi Asahiro; Jesper Jansson 001; Eiji Miyano; Hirotaka Ono 001 (J. Graph Algorithms Appl., 2015)

How Simple Algorithms Can Solve Latin Square Completion-Type Puzzles Approximately. - Kazuya Haraguchi; Hirotaka Ono 001 (J. Inf. Process., 2015)

Pattern Formation by Oblivious Asynchronous Mobile Robots. - Nao Fujinaga; Yukiko Yamauchi; Hirotaka Ono 001; Shuji Kijima; Masafumi Yamashita (SIAM J. Comput., 2015)

Finding All Longest Common Segments in Protein Structures Efficiently. - Yen Kaow Ng; Linzhi Yin; Hirotaka Ono 001; Shuai Cheng Li 001 (IEEE ACM Trans. Comput. Biol. Bioinform., 2015)

Linear-time algorithm for sliding tokens on trees. - Erik D. Demaine; Martin L. Demaine; Eli Fox-Epstein; Duc A. Hoang 001; Takehiro Ito; Hirotaka Ono 001; Yota Otachi; Ryuhei Uehara; Takeshi Yamada (Theor. Comput. Sci., 2015)

The searchlight problem for road networks. - Dariusz Dereniowski; Hirotaka Ono 001; Ichiro Suzuki; Lukasz Wrona; Masafumi Yamashita; Pawel Zylinski (Theor. Comput. Sci., 2015)

Corrigendum to "On the approximability and hardness of minimum topic connected overlay and its special instances" [Theoret. Comput. Sci. 429(2012) 144-154]. - Jun Hosoda; Juraj Hromkovic; Taisuke Izumi; Hirotaka Ono 001; Monika Steinová; Koichi Wada 001 (Theor. Comput. Sci., 2015)

Approximability of minimum certificate dispersal with tree structures. - Taisuke Izumi; Tomoko Izumi; Hirotaka Ono 001; Koichi Wada 001 (Theor. Comput. Sci., 2015)

(Total) Vector domination for graphs with bounded branchwidth. - Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (Discret. Appl. Math., 2016)

Subexponential fixed-parameter algorithms for partial vector domination. - Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (Discret. Optim., 2016)

Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation. - Yuichi Asahiro; Jesper Jansson 001; Eiji Miyano; Hirotaka Ono 001 (Theory Comput. Syst., 2016)

The complexity of dominating set reconfiguration. - Arash Haddadan; Takehiro Ito; Amer E. Mouawad; Naomi Nishimura; Hirotaka Ono 001; Akira Suzuki 001; Youcef Tebbal (Theor. Comput. Sci., 2016)

Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity. - Hans L. Bodlaender; Hirotaka Ono 001; Yota Otachi (Algorithmica, 2018)

A faster parameterized algorithm for Pseudoforest Deletion. - Hans L. Bodlaender; Hirotaka Ono 001; Yota Otachi (Discret. Appl. Math., 2018)

Safe sets in graphs: Graph classes and structural parameters. - Raquel Águeda; Nathann Cohen; Shinya Fujita 001; Sylvain Legay; Yannis Manoussakis; Yasuko Matsui; Leandro Montero; Reza Naserasr; Hirotaka Ono 001; Yota Otachi; Tadashi Sakuma; Zsolt Tuza; et al. (J. Comb. Optim., 2018)

Exact Algorithms for the Bounded Repetition Longest Common Subsequence Problem. - Yuichi Asahiro; Jesper Jansson 001; Guohui Lin; Eiji Miyano; Hirotaka Ono 001; Tadatoshi Utashima (COCOA, 2019)

Graph Orientation with Edge Modifications. - Yuichi Asahiro; Jesper Jansson 001; Eiji Miyano; Hirotaka Ono 001; Sandhya T. P. 001 (FAW, 2019)

Computational Complexity of Hedonic Games on Sparse Graphs. - Tesshu Hanaka; Hironori Kiya; Yasuhide Maei; Hirotaka Ono 001 (PRIMA, 2019)

A 116/13-Approximation Algorithm for L(2, 1)-Labeling of Unit Disk Graphs. - Hirotaka Ono 001; Hisato Yamanaka (SOFSEM, 2019)

Optimal Partition of a Tree with Social Distance. - Masahiro Okubo; Tesshu Hanaka; Hirotaka Ono 001 (WALCOM, 2019)

On directed covering and domination problems. - Tesshu Hanaka; Naomi Nishimura; Hirotaka Ono 001 (Discret. Appl. Math., 2019)

Settlement fund circulation problem. - Hitoshi Hayakawa; Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (Discret. Appl. Math., 2019)

On the maximum weight minimal separator. - Tesshu Hanaka; Hans L. Bodlaender; Tom C. van der Zanden; Hirotaka Ono 001 (Theor. Comput. Sci., 2019)

Two-Player Competitive Diffusion Game: Graph Classes and the Existence of a Nash Equilibrium. - Naoka Fukuzono; Tesshu Hanaka; Hironori Kiya; Hirotaka Ono 001; Ryogo Yamaguchi (SOFSEM, 2020)

Independent Set Reconfiguration Parameterized by Modular-Width. - Rémy Belmonte; Tesshu Hanaka; Michael Lampis; Hirotaka Ono 001; Yota Otachi (Algorithmica, 2020)

Parameterized complexity of independent set reconfiguration problems. - Takehiro Ito; Marcin Jakub Kaminski; Hirotaka Ono 001; Akira Suzuki 001; Ryuhei Uehara; Katsuhisa Yamanaka (Discret. Appl. Math., 2020)

Parameterized Complexity of Safe Set. - Rémy Belmonte; Tesshu Hanaka; Ioannis Katsikarelis; Michael Lampis; Hirotaka Ono 001; Yota Otachi (J. Graph Algorithms Appl., 2020)

Space-Efficient Algorithms for Longest Increasing Subsequence. - Masashi Kiyomi; Hirotaka Ono 001; Yota Otachi; Pascal Schweitzer; Jun Tarui (Theory Comput. Syst., 2020)

Exact algorithms for the repetition-bounded longest common subsequence problem. - Yuichi Asahiro; Jesper Jansson 001; Guohui Lin; Eiji Miyano; Hirotaka Ono 001; Tadatoshi Utashima (Theor. Comput. Sci., 2020)

Graph orientation with splits. - Yuichi Asahiro; Jesper Jansson 001; Eiji Miyano; Hesam Nikpey; Hirotaka Ono 001 (Theor. Comput. Sci., 2020)

Computing the Winner of 2-Player TANHINMIN. - Hironori Kiya; Katsuki Ohto; Hirotaka Ono 001 (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021)

Graph Orientation with Edge Modifications. - Yuichi Asahiro; Jesper Jansson 001; Eiji Miyano; Hirotaka Ono 001 (Int. J. Found. Comput. Sci., 2021)

Capacitated Network Design Games on a Generalized Fair Allocation Model. - Tesshu Hanaka; Toshiyuki Hirose; Hirotaka Ono 001 (AAMAS, 2022)

Parameterized Complexity of (A, ℓ )-Path Packing. - Rémy Belmonte; Tesshu Hanaka; Masaaki Kanzaki; Masashi Kiyomi; Yasuaki Kobayashi; Yusuke Kobayashi 001; Michael Lampis; Hirotaka Ono 001; Yota Otachi (Algorithmica, 2022)

The existence of a pure Nash equilibrium in the two-player competitive diffusion game on graphs having chordality. - Naoka Fukuzono; Tesshu Hanaka; Hironori Kiya; Hirotaka Ono 001 (Discret. Appl. Math., 2022)

Computing L(p, 1)-Labeling with Combined Parameters. - Tesshu Hanaka; Kazuma Kawai; Hirotaka Ono 001 (J. Graph Algorithms Appl., 2022)

Upper and lower degree-constrained graph orientation with minimum penalty. - Yuichi Asahiro; Jesper Jansson 001; Eiji Miyano; Hirotaka Ono 001 (Theor. Comput. Sci., 2022)

Shortest Longest-Path Graph Orientations. - Yuichi Asahiro; Jesper Jansson 001; Avraham A. Melkman; Eiji Miyano; Hirotaka Ono 001; Quan Xue; Shay Zakov (COCOON (1), 2023)

Approximation Algorithms for the Longest Run Subsequence Problem. - Yuichi Asahiro; Hiroshi Eto; Mingyang Gong; Jesper Jansson 001; Guohui Lin; Eiji Miyano; Hirotaka Ono 001; Shunichi Tanaka (CPM, 2023)

Solving Distance-constrained Labeling Problems for Small Diameter Graphs via TSP*. - Tesshu Hanaka; Hirotaka Ono 001; Kosuke Sugiyama (IPDPS Workshops, 2023)

Shortest Beer Path Queries Based on Graph Decomposition. - Tesshu Hanaka; Hirotaka Ono 001; Kunihiko Sadakane; Kosuke Sugiyama (ISAAC, 2023)

Turning Tiles is PSPACE-complete. - Kanae Yoshiwatari; Hironori Kiya; Koki Suetsugu; Tesshu Hanaka; Hirotaka Ono 001 (CoRR, 2023)

Reconfiguration of cliques in a graph. - Takehiro Ito; Hirotaka Ono 001; Yota Otachi (Discret. Appl. Math., 2023)

An 8-approximation algorithm for L(2,1)-labeling of unit disk graphs. - Hirotaka Ono 001; Hisato Yamanaka (Discret. Appl. Math., 2023)

Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover. - Takashi Horiyama; Yasuaki Kobayashi; Hirotaka Ono 001; Kazuhisa Seto; Ryu Suzuki (AAAI, 2024)

Algorithms for Optimally Shifting Intervals Under Intersection Graph Models. - Nicolás Honorato Droguett; Kazuhiro Kurita; Tesshu Hanaka; Hirotaka Ono 001 (IJTCS-FAW, 2024)

Enumerating Minimal Vertex Covers and Dominating Sets with Capacity and/or Connectivity Constraints. - Yasuaki Kobayashi; Kazuhiro Kurita; Yasuko Matsui; Hirotaka Ono 001 (IWOCA, 2024)

On the Computational Complexity of Generalized Common Shape Puzzles. - Mutsunori Banbara; Shin-ichi Minato; Hirotaka Ono 001; Ryuhei Uehara (SOFSEM, 2024)

Faster Winner Determination Algorithms for (Colored) Arc Kayles. - Tesshu Hanaka; Hironori Kiya; Michael Lampis; Hirotaka Ono 001; Kanae Yoshiwatari (SOFSEM, 2024)

On the complexity of finding a spanning even tree in a graph. - Tesshu Hanaka; Yasuaki Kobayashi; Kazuhiro Kurita; Yasuko Matsui; Atsuki Nagao; Hirotaka Ono 001; Kazuhisa Seto (CoRR, 2024)

Polynomial-time equivalences and refined algorithms for longest common subsequence variants. - Yuichi Asahiro; Jesper Jansson 001; Guohui Lin; Eiji Miyano; Hirotaka Ono 001; Tadatoshi Utashima (Discret. Appl. Math., 2024)

Safe sets and in-dominating sets in digraphs. - Yandong Bai; Jørgen Bang-Jensen; Shinya Fujita 001; Hirotaka Ono 001; Anders Yeo (Discret. Appl. Math., 2024)

On a Spectral Lower Bound of Treewidth. - Tatsuya Gima; Tesshu Hanaka; Kohei Noro; Hirotaka Ono 001; Yota Otachi (IEICE Trans. Inf. Syst., 2024)

Collecting Balls on a Line by Robots with Limited Energy. - Tesshu Hanaka; Nicolás Honorato Droguett; Kazuhiro Kurita; Hirotaka Ono 001; Yota Otachi (IEICE Trans. Inf. Syst., 2024)

Solving Distance-constrained Labeling Problems for Small Diameter Graphs via TSP. - Tesshu Hanaka; Hirotaka Ono 001; Kosuke Sugiyama (Int. J. Netw. Comput., 2024)

Grouped domination parameterized by vertex cover, twin cover, and beyond. - Tesshu Hanaka; Hirotaka Ono 001; Yota Otachi; Saeki Uda (Theor. Comput. Sci., 2024)

Winner Determination Algorithms for Graph Games with Matching Structures. - Tesshu Hanaka; Hironori Kiya; Hirotaka Ono 001; Kanae Yoshiwatari (Algorithmica, 2024)

Computational complexity of Turning Tiles. - Tesshu Hanaka; Hironori Kiya; Hirotaka Ono 001; Koki Suetsugu; Kanae Yoshiwatari (Int. J. Game Theory, 2024)

Enumeration of Ordered Trees with Leaf Restrictions. - Yasuaki Kobayashi; Dominik Köppl; Yasuko Matsui; Hirotaka Ono 001; Toshiki Saitoh; Yushi Uno (From Strings to Graphs, and Back Again, 2025)

Shortest Longest-Path Graph Orientations for Trees. - Yuichi Asahiro; Jesper Jansson 001; Avraham A. Melkman; Eiji Miyano; Hirotaka Ono 001; Quan Xue; Yoshichika Yano; Shay Zakov (SOFSEM (1), 2025)

Approximability of Longest Run Subsequence and Complementary Minimization Problems. - Yuichi Asahiro; Mingyang Gong; Jesper Jansson 001; Guohui Lin; Sichen Lu; Eiji Miyano; Hirotaka Ono 001; Toshiki Saitoh; Shunichi Tanaka (WABI, 2025)

On the Complexity of Minimising the Moving Distance for Dispersing Objects. - Nicolás Honorato Droguett; Kazuhiro Kurita; Tesshu Hanaka; Hirotaka Ono 001 (WADS, 2025)

An improved spectral lower bound of treewidth. - Tatsuya Gima; Tesshu Hanaka; Kohei Noro; Hirotaka Ono 001; Yota Otachi (Inf. Process. Lett., 2025)

Structural parameterizations of vertex integrity. - Tatsuya Gima; Tesshu Hanaka; Yasuaki Kobayashi; Ryota Murai; Hirotaka Ono 001; Yota Otachi (Theor. Comput. Sci., 2025)

Fair Ride Allocation on a Line. - Yuki Amano; Ayumi Igarashi 001; Yasushi Kawase; Kazuhisa Makino; Hirotaka Ono 001 (ACM Trans. Economics and Comput., 2025)

Maximizing utilitarian and Egalitarian welfare of fractional hedonic games on tree-like graphs. - Tesshu Hanaka; Airi Ikeyama; Hirotaka Ono 001 (J. Comb. Optim., 2025)

Battle Sheep is PSPACE-complete. - Kyle Burke; Hirotaka Ono 001 (CoRR, 2025)

Structural Parameters for Steiner Orientation. - Tesshu Hanaka; Michael Lampis; Nikolaos Melissinos; Edouard Nemery; Hirotaka Ono 001; Manolis Vasilakis (CoRR, 2025)

Reallocation Problems with Minimum Completion Time. - Toshimasa Ishii; Jun Kawahara; Kazuhisa Makino; Hirotaka Ono 001 (Algorithmica, 2025)

Hedonic seat arrangement problems. - Hans L. Bodlaender; Tesshu Hanaka; Lars Jaffke; Hirotaka Ono 001; Yota Otachi; Tom C. van der Zanden (Auton. Agents Multi Agent Syst., 2025)

Sequentially swapping tokens: Further on graph classes. - Hironori Kiya; Yuto Okada; Hirotaka Ono 001; Yota Otachi (J. Comput. Syst. Sci., 2026)