Papers - ONO Hirotaka

Hedonic Seat Arrangement Problems Reviewed International coauthorship

小野 廣隆

Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, AAMAS '20, Auckland, New Zealand   Vol. -   page： 1777 - 1779   2020

　More details

CiNii Research

Sequentially swapping tokens: Further on graph classes

Hironori Kiya, Yuto Okada, Hirotaka Ono, Yota Otachi

Journal of Computer and System Sciences   Vol. 155   page： 103691 - 103691   2026.2

　More details

Publishing type：Research paper (scientific journal)   Publisher：Elsevier BV  

DOI： 10.1016/j.jcss.2025.103691

Web of Science

Scopus

Colored Node Kayles: Algorithms and Computational Complexity

Tesshu Hanaka, Hirotaka Ono, Kanae Yoshiwatari

  Vol. 16366 LNAI   page： 461 - 478   2026

　More details

DOI： 10.1007/978-3-032-13562-9_36

Scopus

Further Results on Rendering Geometric Intersection Graphs Sparse by Dispersion

Nicolás Honorato-Droguett, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono, Alexander Wolff

  Vol. 16444 LNCS   page： 451 - 466   2026

　More details

DOI： 10.1007/978-981-95-7127-7_30

Scopus

Finding a HIST: Chordality, Structural Parameters, and Diameter

Tesshu Hanaka, Hironori Kiya, Hirotaka Ono

  Vol. 16448 LNCS   page： 303 - 316   2026

　More details

DOI： 10.1007/978-3-032-17801-5_23

Scopus

Reallocation Problems with Minimum Completion Time

Toshimasa Ishii, Jun Kawahara, Kazuhisa Makino, Hirotaka Ono

Algorithmica   Vol. 87 ( 9 ) page： 1311 - 1339   2025.9

　More details

Publishing type：Research paper (scientific journal)   Publisher：Springer Science and Business Media LLC  

DOI： 10.1007/s00453-025-01320-0

Web of Science

Scopus

Other Link： https://link.springer.com/article/10.1007/s00453-025-01320-0/fulltext.html

Hedonic seat arrangement problems. Open Access

Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono 0001, Yota Otachi, Tom C. van der Zanden

Autonomous Agents and Multi-Agent Systems   Vol. 39 ( 2 ) page： 33 - 33   2025.7

　More details

Publishing type：Research paper (scientific journal)  

DOI： 10.1007/s10458-025-09711-x

Web of Science

Scopus

Fair Ride Allocation on a Line Open Access

Yuki Amano, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hirotaka Ono

ACM Transactions on Economics and Computation   Vol. 13 ( 1 )   2025.3

　More details

Publishing type：Research paper (scientific journal)  

DOI： 10.1145/3708491

Open Access

Web of Science

Scopus

Fair Ride Allocation on a Line Reviewed

Yuki Amano, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hirotaka Ono

ACM Transactions on Economics and Computation     2025.2

　More details

Language：English  

DOI： https://doi.org/10.1145/3708491

Enumerating Minimal Vertex Covers and Dominating Sets with Capacity and/or Connectivity Constraints. Reviewed Open Access

Yasuaki Kobayashi, Kazuhiro Kurita, Kevin Mann, Yasuko Matsui, Hirotaka Ono 0001

Algorithms   Vol. 18 ( 2 ) page： 112 - 112   2025.2

　More details

Language：English   Publishing type：Research paper (scientific journal)  

DOI： 10.3390/a18020112

Open Access

Web of Science

Scopus

An improved spectral lower bound of treewidth. Reviewed

Tatsuya Gima, Tesshu Hanaka, Kohei Noro, Hirotaka Ono 0001, Yota Otachi

Information Processing Letters   Vol. 188   page： 106536 - 106536   2025.2

　More details

Language：English   Publishing type：Research paper (scientific journal)  

DOI： 10.1016/j.ipl.2024.106536

Web of Science

Scopus

On the Complexity of Minimising the Moving Distance for Dispersing Objects.

Nicolás Honorato Droguett, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono 0001

CoRR   Vol. abs/2502.12903   2025.2

　More details

Publishing type：Research paper (scientific journal)  

DOI： 10.48550/arXiv.2502.12903

Shortest Longest-Path Graph Orientations for Trees. Reviewed

Yuichi Asahiro, Jesper Jansson 0001, Avraham A. Melkman, Eiji Miyano, Hirotaka Ono 0001, Quan Xue, Yoshichika Yano, Shay Zakov

SOFSEM (1)   Vol. 15538   page： 51 - 64   2025

　More details

Language：English   Publishing type：Research paper (international conference proceedings)  

DOI： 10.1007/978-3-031-82670-2_5

Web of Science

Scopus

Other Link： https://dblp.uni-trier.de/db/conf/sofsem/sofsem2025-1.html#AsahiroJMMOXYZ25

On the Complexity of Minimising the Moving Distance for Dispersing Objects. Open Access

Nicolás Honorato Droguett, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono 0001

19th International Symposium on Algorithms and Data Structures(WADS)   Vol. 349   page： 36 - 14   2025

　More details

Publishing type：Research paper (international conference proceedings)   Publisher：Schloss Dagstuhl - Leibniz-Zentrum für Informatik  

DOI： 10.4230/LIPIcs.WADS.2025.36

Open Access

Scopus

Other Link： https://dblp.uni-trier.de/db/conf/wads/wads2025.html#DroguettKH025

Enumeration of Ordered Trees with Leaf Restrictions.

Yasuaki Kobayashi, Dominik Köppl, Yasuko Matsui, Hirotaka Ono 0001, Toshiki Saitoh, Yushi Uno

From Strings to Graphs, and Back Again: A Festschrift for Roberto Grossi's 60th Birthday     page： 8 - 19   2025

　More details

Publishing type：Research paper (international conference proceedings)   Publisher：Schloss Dagstuhl - Leibniz-Zentrum für Informatik  

DOI： 10.4230/OASIcs.Grossi.8

Other Link： https://dblp.uni-trier.de/db/conf/birthday/grossi2025.html#KobayashiKM0SU25

Computational complexity of Turning Tiles

Tesshu Hanaka, Hironori Kiya, Hirotaka Ono, Koki Suetsugu, Kanae Yoshiwatari

International Journal of Game Theory   Vol. 53 ( 4 ) page： 1211 - 1222   2024.12

　More details

Publishing type：Research paper (scientific journal)   Publisher：Springer Science and Business Media LLC  

DOI： 10.1007/s00182-024-00908-0

Web of Science

Scopus

Other Link： https://link.springer.com/article/10.1007/s00182-024-00908-0/fulltext.html

Safe sets and in-dominating sets in digraphs.

Yandong Bai, Jørgen Bang-Jensen, Shinya Fujita 0001, Hirotaka Ono 0001, Anders Yeo

Discrete Applied Mathematics   Vol. 346   page： 215 - 227   2024.3

　More details

Publishing type：Research paper (scientific journal)  

DOI： 10.1016/j.dam.2023.12.012

Web of Science

Scopus

Collecting Balls on a Line by Robots with Limited Energy

HANAKA Tesshu, HONORATO DROGUETT Nicolás, KURITA Kazuhiro, ONO Hirotaka, OTACHI Yota

IEICE Transactions on Information and Systems   Vol. E107.D ( 3 ) page： 325 - 327   2024.3

　More details

Language：English   Publishing type：Research paper (scientific journal)   Publisher：The Institute of Electronics, Information and Communication Engineers  

<p>In this paper, we study BALL COLLECTING WITH LIMITED ENERGY, which is a problem of scheduling robots with limited energy confined to a line to catch moving balls that eventually cross the line. For this problem, we show the NP-completeness of the general case and some algorithmic results for some cases with a small number of robots.</p>

DOI： 10.1587/transinf.2023fcl0003

Web of Science

Scopus

CiNii Research

On a Spectral Lower Bound of Treewidth

GIMA Tatsuya, HANAKA Tesshu, NORO Kohei, ONO Hirotaka, OTACHI Yota

IEICE Transactions on Information and Systems   Vol. E107.D ( 3 ) page： 328 - 330   2024.3

　More details

Language：English   Publishing type：Research paper (scientific journal)   Publisher：The Institute of Electronics, Information and Communication Engineers  

<p>In this letter, we present a new lower bound for the treewidth of a graph in terms of the second smallest eigenvalue of its Laplacian matrix. Our bound slightly improves the lower bound given by Chandran and Subramanian [Inf. Process. Lett., 87 (2003)].</p>

DOI： 10.1587/transinf.2023fcl0002

Web of Science

Scopus

CiNii Research

On the Computational Complexity of Generalized Common Shape Puzzles.

Mutsunori Banbara, Shin-ichi Minato, Hirotaka Ono 0001, Ryuhei Uehara

SOFSEM   Vol. 14519   page： 55 - 68   2024

　More details

Publishing type：Research paper (international conference proceedings)  

DOI： 10.1007/978-3-031-52113-3_4

Web of Science

Scopus

Other Link： https://dblp.uni-trier.de/db/conf/sofsem/sofsem2024.html#BanbaraMOU24