Program of WAAC 2025

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

Day 1 (Tuesday, August 19)

[9:20 - ] Registration

[10:25 - 10:35] Opening

[10:35 - 11:50] Session 1: Data Structures and String Processing (Chair: Hideo Bannai)

• (CANCELLED) Yu Nakahata.
  On the Size of ZDDs and the Computational Complexity of Their Operations
• Taiki Kaneda, Yasuaki Kobayashi, Hiroki Arimura.
  Simple and Efficient Dynamic and Persistent Data Structures for Dynamic Strings Based on Balanced Search Trees
• Sankardeep Chakraborty, Seungbum Jo, Geunho Kim, Kunihiko Sadakane.
  Succinct Data Structures for Baxter Permutation and Related Families
• Hiroki Shibata, Yuto Nakashima, Yutaro Yamaguchi, Shunsuke Inenaga.
  LZSE: an LZ-style compressor supporting \(O(\log n)\)-time random access

[11:50 - 13:50] Lunch & Discussion (Lunch will be on your own.)

[13:50 - 14:50] Session 2: Invited talk (Chair: Sang Won Bae)

• Seungbum Jo.
  Space-efficient representations for graphs

[14:50 - 15:05] Break

[15:05 - 16:45] Session 3: Computational Geometry (Chair: Kazuya Haraguchi)

• Mook Kwon Jung, Seokyun Kang, Hee-Kap Ahn.
  Minimum Convex Hull of Two Convex Polytopes
• Hyo Jeong An, Jaegun Lee, Hwi Kim, Hee-Kap Ahn.
  Monotone Partitions of Simple Polygons
• Taehoon Ahn, Sang Won Bae, Sang Duk Yoon.
  The Orthogonal Two-Line Center Problem
• Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Jie Xue, Meirav Zehavi.
  Crossing Number in Slightly Superexponential Time

[16:50 - 16:55] Group Photo

[18:00 -] Banquet

Venue: Sapporo Garden Palace, Room Heian, 4th Floor.

Day 2 (Wednesday, August 20)

[10:00 - 12:05] Session 4: Graph Algorithms (Chair: Eunjung Kim)

• Tatsuya Gima, Yasuaki Kobayashi, Yuto Okada.
  New Hardness Results for \(k\)-Planarity
• Tatsuya Gima, Yasuaki Kobayashi, Yuto Okada, Yota Otachi, Hayato Takaike.
  Hitting Geodesic Intervals in Structurally Restricted Graphs
• Fumiya Sakamoto, Ryu Suzuki, Kazuhisa Seto, Takashi Horiyama.
  The Complexity of Computing Pre-assignments for Uniquifying Minimum Vertex Cover on Planar Graphs with Maximum Degree 3
• Yutaro Fuse, Tomomi Matsui, Nobutaka Shimizu, Akiyoshi Shioura.
  An Efficient Algorithm for Computing Average Network Flow
• Toshihiko Kimura, Yonghwan Kim, Yoshiaki Katayama.
  On the General Position Number for Cactus Graphs

[12:05 - 14:00] Lunch & Discussion (Lunch will be on your own.)

[14:00 - 15:15] Session 5: Enumeration and Pattern Matching (Chair: Peaker Guo)

• Seokchul Kang, Joong Chae Na, Jeong Seop Sim.
  3-Partition Order-Preserving Pattern Matching
• Sanghun Ahn, Seokchul Kang, Jeong Seop Sim.
  Comparative Analysis of Data Structures for Multiple Order-Preserving Pattern Matching
• Yuki Nishimura, Kazuya Haraguchi.
  Enumeration of Bases in Matroid with Exponentially Large Ground Set

[15:15-15:30] Break

[15:30 - 16:45] Session 6: Distributed Multi-Agent Systems and Game Theory (Chair: Takumi Shiota)

• Andrea Aliberti, Yonghwan Kim, Yoshiaki Katayama.
  The Impossibilities of the Gathering Problems in Defected View Model under Weaker Schedulers
• Haruki Toyoizumi, Youghwan Kim, Yoshiaki Katayama.
  An Object Finding and a Shortest Path Construction by Autonomous Mobile Robots on a Finite Grid
• Shunta Yamazaki, Tomomi Matsui.
  Shapley Value in Rectified Linear Function Games

[16:45 - 16:55] Closing