Poster

• Extended Abstract: Link (Google Drive)
• Poster: Link (Google Drive)

References

• 2026/03 — [📄arXiv]
  Honorato-Droguett, N., Kurita, K., Hanaka T., Ono H., Wolff A.,
  Further Results on Rendering Geometric Intersection Graphs Sparse by Dispersion,
  The 20th International Conference and Workshops on Algorithms and Computation (WALCOM 2026), Perugia, Italia. (accepted)
• 2025/08 — [📚doi], [📄arXiv]
  Honorato-Droguett, N., Kurita, K., Hanaka T., Ono H.,
  On the Complexity of Minimising the Moving Distance for Dispersing Objects,
  The 19th Algorithms and Data Structures Symposium (WADS 2025), York University, Toronto, Canada.
• 2024/07 —[📚doi]
  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.
• 1998/11 —[📚doi]
  Verma S. and Dessouky M.,
  Single-Machine Scheduling of Unit-Time Jobs with Earliness and Tardiness Penalties,
  Mathematics of Operations Research 23(4):930-943.