Hirotaka Ono
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
82
Venues
30
Active years
2000–2026
Best venue rank
A*
Where they publish
- BISAAC14 papers
- BSOFSEM8 papers
- CIWOCA5 papers
- BWALCOM5 papers
- NationalCOCOON5 papers
- CTAMC5 papers
- BDNA5 papers
- BCPM3 papers
- BPRIMA2 papers
- BWADS2 papers
- A*AAAI2 papers
- NationalFAW2 papers
- CCIAC2 papers
- CCOCOA2 papers
- BWG2 papers
- NationalFUN2 papers
- BMFCS2 papers
- BOPODIS2 papers
- CWABI1 paper
- BSAGT1 paper
- ASTACS1 paper
- NationalICISC1 paper
- BISIT1 paper
- BLATIN1 paper
- BWAOA1 paper
- A*PODC1 paper
- AESA1 paper
- CAAIM1 paper
- CISPA1 paper
- ADIS1 paper
Papers
82 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | IWOCA | Minimum Clique Bicoloring. | Shunsuke Hamada, Yuto Okada, Hirotaka Ono, Yota Otachi |
| 2026 | SOFSEM | Finding a HIST: Chordality, Structural Parameters, and Diameter. | Tesshu Hanaka, Hironori Kiya, Hirotaka Ono |
| 2026 | WALCOM | Further Results on Rendering Geometric Intersection Graphs Sparse by Dispersion. | Nicols Honorato Droguett, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono, Alexander Wolff |
| 2025 | ISAAC | Structural Parameters for Steiner Orientation. | Tesshu Hanaka, Michael Lampis, Nikolaos Melissinos, Edouard Nemery, Hirotaka Ono, Manolis Vasilakis |
| 2025 | PRIMA | Colored Node Kayles: Algorithms and Computational Complexity. | Tesshu Hanaka, Hirotaka Ono, Kanae Yoshiwatari |
| 2025 | SOFSEM | Shortest Longest-Path Graph Orientations for Trees. | Yuichi Asahiro, Jesper Jansson, Avraham A. Melkman, Eiji Miyano, Hirotaka Ono, Quan Xue, Yoshichika Yano, Shay Zakov |
| 2025 | WABI | Approximability of Longest Run Subsequence and Complementary Minimization Problems. | Yuichi Asahiro, Mingyang Gong, Jesper Jansson, Guohui Lin, Sichen Lu, Eiji Miyano, Hirotaka Ono, Toshiki Saitoh, Shunichi Tanaka |
| 2025 | WADS | On the Complexity of Minimising the Moving Distance for Dispersing Objects. | Nicols Honorato Droguett, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono |
| 2024 | AAAI | Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover. | Takashi Horiyama, Yasuaki Kobayashi, Hirotaka Ono, Kazuhisa Seto, Ryu Suzuki |
| 2024 | FAW | Algorithms for Optimally Shifting Intervals Under Intersection Graph Models. | Nicols Honorato Droguett, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono |
| 2024 | IWOCA | Enumerating Minimal Vertex Covers and Dominating Sets with Capacity and/or Connectivity Constraints. | Yasuaki Kobayashi, Kazuhiro Kurita, Yasuko Matsui, Hirotaka Ono |
| 2024 | SOFSEM | On the Computational Complexity of Generalized Common Shape Puzzles. | Mutsunori Banbara, Shin-ichi Minato, Hirotaka Ono, Ryuhei Uehara |
| 2024 | SOFSEM | Faster Winner Determination Algorithms for (Colored) Arc Kayles. | Tesshu Hanaka, Hironori Kiya, Michael Lampis, Hirotaka Ono, Kanae Yoshiwatari |
| 2024 | WALCOM | Structural Parameterizations of Vertex Integrity. | Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono, Yota Otachi |
| 2023 | CIAC | Grouped Domination Parameterized by Vertex Cover, Twin Cover, and Beyond. | Tesshu Hanaka, Hirotaka Ono, Yota Otachi, Saeki Uda |
| 2023 | COCOA | Maximizing Utilitarian and Egalitarian Welfare of Fractional Hedonic Games on Tree-Like Graphs. | Tesshu Hanaka, Airi Ikeyama, Hirotaka Ono |
| 2023 | COCOON | Shortest Longest-Path Graph Orientations. | Yuichi Asahiro, Jesper Jansson, Avraham A. Melkman, Eiji Miyano, Hirotaka Ono, Quan Xue, Shay Zakov |
| 2023 | CPM | Approximation Algorithms for the Longest Run Subsequence Problem. | Yuichi Asahiro, Hiroshi Eto, Mingyang Gong, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Shunichi Tanaka |
| 2023 | ISAAC | Shortest Beer Path Queries Based on Graph Decomposition. | Tesshu Hanaka, Hirotaka Ono, Kunihiko Sadakane, Kosuke Sugiyama |
| 2023 | SOFSEM | Sequentially Swapping Tokens: Further on Graph Classes. | Hironori Kiya, Yuto Okada, Hirotaka Ono, Yota Otachi |
| 2022 | COCOON | Reallocation Problems with Minimum Completion Time. | Toshimasa Ishii, Jun Kawahara, Kazuhisa Makino, Hirotaka Ono |
| 2022 | CPM | Polynomial-Time Equivalences and Refined Algorithms for Longest Common Subsequence Variants. | Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima |
| 2022 | IWOCA | Winner Determination Algorithms for Graph Games with Matching Structures. | Kanae Yoshiwatari, Hironori Kiya, Tesshu Hanaka, Hirotaka Ono |
| 2022 | SAGT | Fair Ride Allocation on a Line. | Yuki Amano, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hirotaka Ono |
| 2021 | WALCOM | Computing L(p, 1)-Labeling with Combined Parameters. | Tesshu Hanaka, Kazuma Kawai, Hirotaka Ono |
| 2020 | IWOCA | Parameterized Complexity of (A, ℓ )-Path Packing. | Rmy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Michael Lampis, Hirotaka Ono, Yota Otachi |
| 2020 | SOFSEM | Two-Player Competitive Diffusion Game: Graph Classes and the Existence of a Nash Equilibrium. | Naoka Fukuzono, Tesshu Hanaka, Hironori Kiya, Hirotaka Ono, Ryogo Yamaguchi |
| 2019 | CIAC | Parameterized Complexity of Safe Set. | Rmy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Hirotaka Ono, Yota Otachi |
| 2019 | COCOA | Exact Algorithms for the Bounded Repetition Longest Common Subsequence Problem. | Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima |
| 2019 | FAW | Graph Orientation with Edge Modifications. | Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Sandhya T. P. |
| 2019 | PRIMA | Computational Complexity of Hedonic Games on Sparse Graphs. | Tesshu Hanaka, Hironori Kiya, Yasuhide Maei, Hirotaka Ono |
| 2019 | SOFSEM | A 116/13-Approximation Algorithm for L(2, 1)-Labeling of Unit Disk Graphs. | Hirotaka Ono, Hisato Yamanaka |
| 2019 | WALCOM | Optimal Partition of a Tree with Social Distance. | Masahiro Okubo, Tesshu Hanaka, Hirotaka Ono |
| 2019 | WG | Independent Set Reconfiguration Parameterized by Modular-Width. | Rmy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi |
| 2018 | STACS | Space-Efficient Algorithms for Longest Increasing Subsequence. | Masashi Kiyomi, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui |
| 2017 | ISAAC | On Directed Covering and Domination Problems. | Tesshu Hanaka, Naomi Nishimura, Hirotaka Ono |
| 2017 | ISAAC | Settlement Fund Circulation Problem. | Hitoshi Hayakawa, Toshimasa Ishii, Hirotaka Ono, Yushi Uno |
| 2017 | TAMC | On the Maximum Weight Minimal Separator. | Tesshu Hanaka, Hans L. Bodlaender, Tom C. van der Zanden, Hirotaka Ono |
| 2016 | ICISC | An Improvement of Optimal Ate Pairing on KSS Curve with Pseudo 12-Sparse Multiplication. | Md. Al-Amin Khandaker, Hirotaka Ono, Yasuyuki Nogami, Masaaki Shirase, Sylvain Duquesne |
| 2016 | ISAAC | Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity. | Hans L. Bodlaender, Hirotaka Ono, Yota Otachi |
| 2015 | ISIT | Subgraph domatic problem and writing capacity of memory devices with restricted state transitions. | Tadashi Wadayama, Taisuke Izumi, Hirotaka Ono |
| 2015 | SOFSEM | A Fixed-Parameter Algorithm for Max Edge Domination. | Tesshu Hanaka, Hirotaka Ono |
| 2015 | TAMC | Reconfiguration of Cliques in a Graph. | Takehiro Ito, Hirotaka Ono, Yota Otachi |
| 2015 | WADS | The Complexity of Dominating Set Reconfiguration. | Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki, Youcef Tebbal |
| 2014 | FUN | Approximability of Latin Square Completion-Type Puzzles. | Kazuya Haraguchi, Hirotaka Ono |
| 2014 | ISAAC | Depth-First Search Using O(n) Bits. | Tetsuo Asano, Taisuke Izumi, Masashi Kiyomi, Matsuo Konagaya, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui, Ryuhei Uehara |
| 2014 | ISAAC | Polynomial-Time Algorithm for Sliding Tokens on Trees. | Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada |
| 2014 | ISAAC | Fixed-Parameter Tractability of Token Jumping on Planar Graphs. | Takehiro Ito, Marcin Jakub Kaminski, Hirotaka Ono |
| 2014 | LATIN | (Total) Vector Domination for Graphs with Bounded Branchwidth. | Toshimasa Ishii, Hirotaka Ono, Yushi Uno |
| 2014 | TAMC | On the Parameterized Complexity for Token Jumping on Graphs. | Takehiro Ito, Marcin Kaminski, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, Katsuhisa Yamanaka |
| 2013 | WALCOM | Base Location Problems for Base-Monotone Regions. | Jinhee Chun, Takashi Horiyama, Takehiro Ito, Natsuda Kaothanthong, Hirotaka Ono, Yota Otachi, Takeshi Tokuyama, Ryuhei Uehara, Takeaki Uno |
| 2013 | WAOA | Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation. | Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono |
| 2012 | CPM | Finding Longest Common Segments in Protein Structures in Nearly Linear Time. | Yen Kaow Ng, Hirotaka Ono, Ling Ge, Shuai Cheng Li |
| 2012 | ISAAC | Reconfiguration of List L(2, 1)-Labelings in a Graph. | Takehiro Ito, Kazuto Kawamura, Hirotaka Ono, Xiao Zhou |
| 2012 | PODC | Coalescing random walks and voting on graphs. | Colin Cooper, Robert Elssser, Hirotaka Ono, Tomasz Radzik |
| 2012 | TAMC | Minimum Certificate Dispersal with Tree Structures. | Taisuke Izumi, Tomoko Izumi, Hirotaka Ono, Koichi Wada |
| 2011 | MFCS | On the Approximability of Minimum Topic Connected Overlay and Its Special Instances. | Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinov, Koichi Wada |
| 2011 | WG | Approximability of the Path-Distance-Width for AT-free Graphs. | Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, Koichi Yamazaki |
| 2010 | ISAAC | The ( | Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno |
| 2010 | IWOCA | The (2, 1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2. | Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno |
| 2010 | OPODIS | Pattern Formation through Optimum Matching by Oblivious CORDA Robots. | Nao Fujinaga, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita |
| 2010 | OPODIS | Upper and Lower Bounds of Space Complexity of Self-Stabilizing Leader Election in Mediated Population Protocol. | Ryu Mizoguchi, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita |
| 2009 | COCOON | Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem. | Tomoko Izumi, Taisuke Izumi, Hirotaka Ono, Koichi Wada |
| 2009 | ESA | A Linear Time Algorithm for | Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno |
| 2009 | ISAAC | Route-Enabling Graph Orientation Problems. | Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, Ryuhei Uehara |
| 2009 | TAMC | Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG. | Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita |
| 2008 | DNA | Speeding Up Local-Search Type Algorithms for Designing DNA Sequences under Thermodynamical Constraints. | Suguru Kawashimo, Yen Kaow Ng, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita |
| 2008 | ISAAC | The Balanced Edge Cover Problem. | Yuta Harada, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita |
| 2008 | ISAAC | Deductive Inference for the Interiors and Exteriors of Horn Theories. | Kazuhisa Makino, Hirotaka Ono |
| 2007 | AAIM | Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree. | Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo |
| 2007 | DNA | Dynamic Neighborhood Searches for Thermodynamically Designing DNA Sequence. | Suguru Kawashimo, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita |
| 2007 | FUN | Drawing Borders Efficiently. | Kazuo Iwama, Eiji Miyano, Hirotaka Ono |
| 2007 | MFCS | On Approximation of Bookmark Assignments. | Yuichi Asahiro, Eiji Miyano, Toshihide Murata, Hirotaka Ono |
| 2006 | DNA | DNA Sequence Design by Dynamic Neighborhood Searches. | Suguru Kawashimo, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita |
| 2006 | DNA | A Probabilistic Model of the DNA Conformational Change. | Masashi Shiozaki, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita |
| 2006 | ISPA | Forest Search: A Paradigm for Faster Exploration of Scale-Free Networks. | Yuichi Kurumida, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita |
| 2005 | COCOON | Best Fitting Fixed-Length Substring Patterns for a Set of Strings. | Hirotaka Ono, Yen Kaow Ng |
| 2005 | DIS | Measuring Over-Generalization in the Minimal Multiple Generalizations of Biosequences. | Yen Kaow Ng, Hirotaka Ono, Takeshi Shinohara |
| 2005 | DNA | A Local Search Based Barrier Height Estimation Algorithm for DNA Molecular Transitions. | Tsutomu Takeda, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita |
| 2002 | AAAI | Integrating Local Search and Network Flow to Solve the Inventory Routing Problem. | Hoong Chuin Lau, Qi Zhang Liu, Hirotaka Ono |
| 2001 | ISAAC | An Index for the Data Size to Extract Decomposable Structures in LAD. | Hirotaka Ono, Mutsunori Yagiura, Toshihide Ibaraki |
| 2000 | COCOON | Logical Analysis of Data with Decomposable Structures. | Hirotaka Ono, Kazuhisa Makino, Toshihide Ibaraki |