SOFSEM 2026 Poster

This page provides the extended abstract and poster presented during the poster session at SOFSEM 2026.

Materials

• Extended abstract: View on Google Drive
• Poster: View on Google Drive

References

• 2026/03 — [📚doi], [📄arXiv]
  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 — [📚doi], [📄arXiv]
  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 — [📚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. Lecture Notes in Computer Science 14752, 66–78.
• 1998/11 — [📚doi]
  Verma, S., Dessouky, M.,
  Single-Machine Scheduling of Unit-Time Jobs with Earliness and Tardiness Penalties,
  Mathematics of Operations Research, 23(4), 930–943.