Program of WAAC 2024

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

Day 1 (Friday, August 2)

[10:00-10:45] Session 1 (Chair: Sang Duk Yoon)

• Chaeyoon Chung, Antoine Vigneron and Hee-Kap Ahn.
  Maximum Coverage by k Lines
• Byeonguk Kang, Junhyeok Choi, Jeesun Han and Hee-Kap Ahn.
  Guarding Points on a Terrain by Watchtowers
• Taehoon Ahn, Chaeyoon Chung, Hee-Kap Ahn, Sang Won Bae, Otfried Cheong and Sang Duk Yoon.
  Minimum-Width Double-Slabs and Widest Empty Slabs in High Dimensions

[11:00-12:00] Session 2: Invited talk (Chair: Hee-Kap Ahn)

• Herbert Edelsbrunner
  Merge Trees of Periodic Filtrations

[12:00-14:00] Lunch

[14:00-14:45] Session 3 (Chair: Seungbum Jo)

• Wonseok Shin, Siwoo Song, Kunsoo Park and Wook-Shin Han.
  Approximate Counting of Subgraph Isomorphisms
• Haruya Imamura, Yota Otachi and Toshiki Saitoh.
  On the Complexity of Ordered Subgraph Isomorphism and Maximum Common Induced Subgraph
• Seunghwan Min, Jihoon Jang, Kunsoo Park, Dora Giammarresi, Giuseppe Italano and Wook-Shin Han.
  Dynamic Subgraph Matching with Time Constraints

[15:00-16:45] Session 4 (Chair: Donghoon Shin)

• Daisuke Tsuru and Tesshu Hanaka.
  The short secluded path problem parameterized by neighborhood diversity and twin cover number
• Keita Maeda, Yuta Fujioka, Takumi Iwasaki, Takumi Shiota and Toshiki Saitoh.
  Divide-and-conquer Algorithms for Counting Paths using Zero-suppressed Binary Decision Diagrams
• Risa Ishikawa and Yuya Higashikawa.
  Solving the Mixed Evacuation Problem on Path Networks in General Settings

[16:00-17:00] Session 5 (Chair: Antoine Vigneron)

• Yuichi Asahiro, Hiroshi Eto, Haruna Kouroki, Guohui Lin and Eiji Miyano.
  Clique under a Change Constraint from an Initial Solution
• Yudai Egami, Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi and Yota Otachi.
  FPT Approximation Algorithms for Telephone Broadcasting Parameterized by Clique Cover Number
• Yuta Tsuruzono, Hiroki Arimura and Shunsuke Inenaga.
  Enumerating Maximal Repeats in a Text Based on Bidirectional Indices
• Kazuma Yamane, Yuto Nakashima, Kazuhisa Seto and Takashi Horiyama.
  The Number of Maximal α-gapped Repeats in Fibonacci Strings

Day 2 (Saturday, August 3)

[09:00-09:45] Session 6 (Chair: Yuto Nakashima)

• Yuto Okura, Kazuhisa Seto and Takashi Horiyama.
  A Moderately Exponential Time Algorithm for the Boolean Connectivity of k-Horn Formulas
• Eunku Park and Antoine Vigneron.
  Embeddings and near-neighbor searching with constant additive error for hyperbolic spaces
• Svetlana Selivanova and Holger Thies.
  Solving differential equations in exact real arithmetic and applications to high-precision computations

[10:00-10:45] Session 7 (Chair: Jinhee Chun)

• Sungmin Kim and Yo-Sub Han.
  Approximate Cartesian Tree Pattern Matching
• Rikuya Hamai and Shunsuke Inenaga.
  The multiplicative sensitivity of CDAWGs is constant
• Hiroki Shibata and Dominik Köppl.
  LZ78 Substring Compression in CDAWG-compressed Space

[11:00-12:00] Session 8: Invited talk (Chair: Hirotaka Ono)

• Kunihiko Sadakane.
  Introduction to Secure Computation

[12:00-14:00] Lunch

[14:00-14:45] Session 9 (Chair: Yasuaki Kobayashi)

• Nicolas Honorato-Droguett, Kazuhiro Kurita, Tesshu Hanaka and Hirotaka Ono.
  An Edit Model and Algorithms for Achieving Properties on Intersection Graphs
• Tesshu Hanaka, Hirotaka Ono, Suguru Yamada and Kanae Yoshiwatari.
  Computational Complexity of Fixed-Cardinality Graph Partitioning and Its Variants
• Ei Ando.
  Computing the (spanning) forest polytope's volume in small treewidth graphs through its recurrence representation

[15:00-16:00] Session 10 (Chair: Hyung-Chan An)

• Da-Jung Cho, Shizhao Wei and Jiakai Ren.
  Enhancing Diversity in MMOPs: A Gaussian Similarity-based Approach
• Kwangho Kim, Jisu Kim, Manzil Zaheer, Joon Sik Kim, Frédéric Chazal and Larry Wasserman.
  PLLay: Efficient Topological Layer based on Persistence Landscapes
• Yongho Shin, Changyeol Lee, Gukryeol Lee and Hyung-Chan An.
  Improved Learning-Augmented Algorithms for the Multi-Option Ski Rental Problem via Best-Possible Competitive Analysis
• Hajin Lee, Kwangho Kim and Jisu Kim.
  ECLay: Fast and Robust Topological Layer based on Differentiable Euler Characteristic