Program of WAAC 2026

Each speaker of a regular talk has 20 minutes, including Q&A (and changeover).

Day 1 (Aug 19)

[09:30-10:30] Registration desk open

[10:30-10:40] Opening

[10:40-12:00] Session 1 (4 talks)

• Minju Song, Mook Kwon Jung and Hee-Kap Ahn.
  Farthest-point Voronoi Diagrams in the Hilbert Metric
• Jaegun Lee, Chaeyoon Chung and Hee-Kap Ahn.
  Bichromatic Classifications of Points using Strips
• Chaeyoon Chung, Michiel Smid and Anil Maheshwari.
  Linear-Time (1+ε)-Approximation Algorithms for Two-Line-Center Problems
• Jaehoon Chung.
  Orthogonal Strip Partitioning of Simple Polygons: A Lattice-Theoretic Algorithm

[12:00-14:00] Lunch

[14:00-15:00] Invited Talk

• Takehiro Ito.
  Invitation to Combinatorial Reconfiguration

[15:00-15:20] Coffee Break

[15:20-16:20] Session 2 (3 talks)

• Dominik Köppl and Gregory Kucherov.
  Near-real-time Solutions for Online String Problems
• Hokuto Fukuoka, Takashi Horiyama and Kazuhisa Seto.
  A Lower Bound on the Number of Maximal α-gapped Repeats in the Fibonacci String
• Shuta Yasui and Takuya Kida.
  PPM Using a Static Dictionary as Prior Knowledge

[18:00-21:00] Banquet

Day 2 (Aug 20)

[09:00-10:20] Session 3 (4 talks)

• Hiroshi Eto, Shuya Yoshida, Eiji Miyano and Pradeesha Ashok.
  The (B, r)-Periodic s-t Path Problem
• Tesshu Hanaka, Ryotatsu Okano, Hirotaka Ono and Suguru Yamada.
  Computational Complexity of Dynamic s-t Path and Edge-Cut Problems
• Hans L. Bodlaender, Tatsuya Gima, Yasuaki Kobayashi, Futaba Mizuno, Yuto Okada and Yota Otachi.
  On the Parameterized Complexity of Orientable Domination Number
• Tatsuya Gima, Yasuaki Kobayashi, Hiraku Morimoto and Yota Otachi.
  On Structural Parameterizations of Minimum (s,t)-Cut Prevention

[10:20-10:40] Coffee Break

[10:40-12:00] Session 4 (4 talks)

• Tatsuya Gima, Yasuaki Kobayashi and Hankyeol Lee.
  Structural Parameterizations of Crossing Minimization Problems for 2-Layer Drawings
• Tesshu Hanaka, Suguru Yamada and Hirotaka Ono.
  Set Function Maximization with Locality over Graphs
• Ryoma Aoshima, Takashi Horiyama, Atsuki Nagao, Fumiya Sakamoto, Hibiki Sato, Kazuhisa Seto and Karin Umebayashi.
  On Forcing Unique Perfect Matchings in Bipartite Graphs
• Atsuki Nagao and Karin Umebayashi.
  Computational Complexity of the Hamiltonian Cycle Problem on Regular Line Graphs

[12:00-14:00] Lunch

[14:00-15:20] Session 5 (4 talks)

• Kenta Komoto, Kazuhiro Kurita and Hirotaka Ono.
  The Hardness of Frequent Ordered Tree Mining on Bounded-Height Trees
• Jaden Jorradol, Alexander Stoimenov and Martin Ziegler.
  Calculation of the signature with Gordon-Litherland formula
• Jihoon Hyun.
  Branching with Intersection of Clauses
• Jaegun Lee, Seokyun Kang, Hyeonseok Lee, Hyeyun Yang and Taehoon Ahn.
  CG#Hunters Approach to Central Triangulation Under Parallel Flip Operations

[15:20-15:30] Closing