🥼 Research Overview

My research began in computational geometry, with the separability of planar point sets using rectilinear convex hulls. I have also studied the tractability and intractability of job-scheduling variants. My current work is close to the computational complexity of graph-modification problems on geometric intersection graphs, particularly edge modification, graph edit distance, and edit operations defined through geometric transformations.

Research interests: Computational geometry; graph modification; graph theory; geometric intersection graphs; parameterised complexity; geometric optimisation; rectilinear convex hulls; separability; coverage; task scheduling


🗞️ Articles, Conference Papers and Preprints

Article Conference paper Preprint

  • 2026/09/22 — [📄arXiv]
    Tesshu Hanaka, Nicolás Honorato-Droguett, Hirotaka Ono, Samuel Wolf, Alexander Wolff,
    Moving Geometric Objects to Render Their Intersection Graph Connected or Locally Dense.
  • 2026/08/23 — [📄arXiv]
    Nicolás Honorato-Droguett,
    Linear-Time Transformations Between Connectivity Maintenance and Points Spreading on Linear and Cyclic Domains.
  • 2026/03/06 — [📚doi], [📄arXiv], [👨🏻‍🏫Slides]
    Nicolás Honorato-Droguett, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono, Alexander Wolff,
    Further Results on Rendering Geometric Intersection Graphs Sparse by Dispersion,
    20th International Conference and Workshops on Algorithms and Computation (WALCOM 2026), Perugia, Italy. Lecture Notes in Computer Science 16444, 451–466.
  • 2025/08/11 — [📚doi], [📄arXiv], [👨🏻‍🏫Slides]
    Nicolás Honorato-Droguett, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono,
    On the Complexity of Minimising the Moving Distance for Dispersing Objects,
    19th International Symposium on Algorithms and Data Structures (WADS 2025), Toronto, Canada. Leibniz International Proceedings in Informatics (LIPIcs) 349, Article 36, 36:1–36:14.
  • 2024/07/29 — [📚doi], [👨🏻‍🏫Slides]
    Nicolás Honorato-Droguett, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono,
    Algorithms for Optimally Shifting Intervals under Intersection Graph Models,
    International Joint Conference on Theoretical Computer Science – Frontier of Algorithmic Wisdom (IJTCS-FAW 2024), Hong Kong, China. Lecture Notes in Computer Science 14752, 66–78.
  • 2024/03 — [📚doi]
    Tesshu Hanaka, Nicolás Honorato-Droguett, Kazuhiro Kurita, Hirotaka Ono, Yota Otachi,
    Collecting Balls on a Line by Robots with Limited Energy,
    IEICE Transactions on Information and Systems, E107-D(3), 325–327.

🌏📄 Talks and Extended Abstracts

🏠 Domestic Conferences and Workshops

🖍️ Seminars

🎒 Other Academic Activities