🥼 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

🗞️ Journal Articles

• 2024/03 — [📚doi]
  Hanaka, T., Honorato-Droguett, N., Kurita, K., Ono, H., Otachi, Y.,
  Collecting Balls on a Line by Robots with Limited Energy,
  IEICE Transactions on Information and Systems, E107-D(3), 325–327.

🌏📝 Peer-Reviewed Conference Papers

• 2026/03/06 — [📚doi], [📄arXiv], [👨🏻‍🏫Slides]
  Honorato-Droguett, N., Kurita, K., Hanaka, T., Ono, H., Wolff, A.,
  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]
  Honorato-Droguett, N., Kurita, K., Hanaka, T., Ono, H.,
  On the Complexity of Minimising the Moving Distance for Dispersing Objects,
  19th International Symposium on Algorithms and Data Structures (WADS 2025), York University, Toronto, Canada. Leibniz International Proceedings in Informatics (LIPIcs) 349, Article 36, 36:1–36:14.
• 2024/07/29 — [📚doi], [👨🏻‍🏫Slides]
  Honorato-Droguett, N., Kurita, K., Hanaka, T., Ono, H.,
  Algorithms for Optimally Shifting Intervals under Intersection Graph Models,
  International Joint Conference on Theoretical Computer Science – Frontier of Algorithmic Wisdom (IJTCS-FAW 2024), The Hong Kong Polytechnic University, Hong Kong SAR, China. Lecture Notes in Computer Science 14752, 66–78.

🌏📄 Talks and Extended Abstracts

• 2025/06/24 — [📍link], [👨🏻‍🏫Slides]
  Honorato-Droguett, N., Kurita, K., Hanaka, T., Ono, H.,
  On the Complexity of Minimising the Moving Distance for Dispersing Objects,
  Computational Geometry: Young Researchers Forum 2025 (CG:YRF 2025), Kanazawa, Japan.
• 2025/03/29 — [📍link], [👨🏻‍🏫Slides]
  Honorato-Droguett, N., Kurita, K., Hanaka, T., Ono, H.,
  On the Complexity of Minimising the Moving Distance for Dispersing Objects,
  International Workshop on Discrete Mathematics and Algorithms 2025 (DMA 2025), Okinawa Prefecture Municipal Center, Okinawa, Japan.
• 2024/08/03 — [📍link], [👨🏻‍🏫Slides]
  Honorato-Droguett, N., Kurita, K., Hanaka, T., Ono, H.,
  An Edit Model and Algorithms for Achieving Properties on Intersection Graphs,
  24th Japan–Korea Joint Workshop on Algorithms and Computation (WAAC 2024), Sungshin Women’s University, Seoul, Korea.
• 2023/06/24 — [📍link], [👨🏻‍🏫Slides]
  Honorato-Droguett, N., Kurita, K., Hanaka, T., Otachi, Y., Ono, H.,
  Collecting Balls on a Line by Robots with Limited Energy,
  23rd Japan–Korea Joint Workshop on Algorithms and Computation (WAAC 2023), Nagoya University, Nagoya, Japan.

🏠 Domestic Conferences and Workshops

• 2025/03/26 — [📍link], [👨🏻‍🏫Slides]
  Honorato-Droguett, N., Kurita, K., Hanaka, T., Ono, H.,
  On the Complexity of Minimising the Moving Distance for Dispersing Objects,
  COMP-AFSA学生シンポジウム, 東京都市大学, 東京.
• 2025/01/15 — [📍link], [👨🏻‍🏫Slides]
  Honorato-Droguett, N., Kurita, K., Hanaka, T., Ono, H.,
  On the Complexity of Minimising the Moving Distance for Dispersing Objects,
  第201回AL研究発表会, くまもと県民交流館パレア, 熊本.
• 2024/03/21 — [📍link], [👨🏻‍🏫Slides]
  Honorato-Droguett, N., Kurita, K., Hanaka, T., Ono, H.,
  An Edit Model and Algorithms for Achieving Properties on Intersection Graphs,
  第197回AL研究発表会, JAIST 金沢駅前オフィス, 金沢.
• 2024/02/20 — [📍link], [👨🏻‍🏫Slides]
  Honorato-Droguett, N., Kurita, K., Hanaka, T., Ono, H.,
  An Edit Model and Algorithms for Achieving Properties on Intersection Graphs,
  2023年度冬のLAシンポジウム, 京都大学数理解析研究所, 京都.
• 2023/12/22 — [📍link], [👨🏻‍🏫Slides]
  Honorato-Droguett, N., Kurita, K., Hanaka, T., Ono, H.,
  Algorithms for Optimally Shifting Intervals under Intersection Graph Models,
  コンピュテーション研究会（COMP）, 宮崎大学まちなかキャンパス, 宮崎県宮崎市.
• 2023/10/29 — [📍link], [👨🏻‍🏫Slides]
  Honorato-Droguett, N., Kurita, K., Hanaka, T., Ono, H.,
  Algorithms for Optimally Shifting Intervals under Intersection Graph Models,
  日本オペレーションズ・リサーチ学会 九州支部, FITセミナーハウス（福岡工業大学）, 大分県由布市湯布院町.
• 2023/09/13 — [📍link], [👨🏻‍🏫Slides]
  Honorato-Droguett, N., Kurita, K., Hanaka, T., Ono, H.,
  Algorithms for Optimally Shifting Intervals under Intersection Graph Models,
  第19回 情報科学ワークショップ, ルートイングランティア太宰府, 福岡県太宰府市.
• 2023/07/04 — [📍link], [👨🏻‍🏫Slides]
  Honorato-Droguett, N., Kurita, K., Hanaka, T., Ono, H.,
  Optimally Shifting Intervals under Intersection Graph Models,
  2023年度夏のLAシンポジウム, 函館市大森町2番14号.
• 2023/01/31 — [📍link], [👨🏻‍🏫Slides]
  Honorato-Droguett, N., Kurita, K., Hanaka, T., Otachi, Y., Ono, H.,
  Collecting Balls on a Line by Robots with Limited Energy,
  2022年度冬のLAシンポジウム, 京都大学数理解析研究所, 京都.

🖍️ Seminars

• 2025/11/05 — [👨🏻‍🏫Slides]
  Honorato-Droguett, N., Geometric Graph Modification: Modelling and Algorithms,
  京大・名大・大公大合同セミナー, 京都大学 （Kyoto University）, Kyoto, Japan.
• 2025/05/10 — [👨🏻‍🏫Slides]
  Honorato-Droguett, N., Geometric Graph Modification: Modelling and Algorithms,
  組合せ最適化セミナー, National Institute of Informatics （国立情報学研究所）, Tokyo, Japan.

🎒 Other Academic Activities

• 2026/02/09 ➡️ 2026/02/13 — [📍link]
  51st International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2026), Jagiellonian University, Kraków, Poland. (Poster Session)
• 2024/03/18 ➡️ 2024/03/20 — [📍link]
  18th International Conference and Workshops on Algorithms and Computation (WALCOM 2024), Kanazawa Bunka Hall, Kanazawa, Japan.
• 2023/08/07 ➡️ 2023/08/09 — [📍link]
  RIMS 共同研究「組合せ最適化セミナー」(第20回), 京都大学数理解析研究所, 京都.