Program of WAAC 2023

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

Day 1 (Saturday, June 24)

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

• Nicolás Honorato Droguett, Kazuhiro Kurita, Tesshu Hanaka, Yota Otachi, Hirotaka Ono.
  Collecting Balls on a Line by Robots with Limited Energy
• Donghoon Shin, Sunghee Choi.
  Improved algorithms for the Steiner tree problem with the minimum number of Steiner points and bounded edge length
• Da-Jung Cho, Hwee Kim.
  Side-Aware DNA Origami Words

[11:00-12:00] Session 2: Invited talk (Chair: Takeshi Tokuyama)

• Hee-Kap Ahn
  Optimal paths in the presence of obstacles

[12:00-14:00] Lunch & Discussion

[14:00-15:00] Session 3 (Chair: Hirotaka Ono)

• Takeshi Tokuyama, Naoki Fujihara.
  Optimal Recipe of Witch's Potion: Sorting Columns of a Matrix to Optimize Nondecreasing Subsequences of Rows
• Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane, Srinivasa Rao Satti.
  Succinct Data Structures for SP, Block-Cactus and 3-Leaf Power Graphs
• Seungbum Jo, Geunho Kim.
  Space-efficient data structure for next/previous larger/smaller value queries
• Hiroshi Hirai, Ryosuke Sato.
  Polyhedral Clinching Auctions for Indivisible Goods

[15:15-16:15] Session 4 (Chair: Yuya Higashikawa)

• Chaeyoon Chung, Taehoon Ahn, Sang Won Bae, Hee-Kap Ahn.
  Parallel Line Centers with Guaranteed Separation
• Jaehoon Chung, Sang Won Bae, Chan-Su Shin, Sang Duk Yoon, Hee-Kap Ahn.
  Inscribing or Circumscribing a Histogon to a Convex Polygon
• Taekang Eom, Hee-Kap Ahn.
  A linear-time algorithm for the center problem in weighted cycle graphs
• Jongmin Choi, Jaegun Lee, Hee-Kap Ahn.
  Efficient k-center algorithms for planar points in convex position

[16:30-17:30] Session 5 (Chair: Sang Duk Yoon)

• Yuki Tokuni, Yuya Higashikawa, Naoki Katoh, Junichi Teruyama.
  Faster Algorithms for Evacuation Problems in Networks with the Single Sink of Small Degree and Uniformly Capacitated Edges
• Robert Benkoczi, Yuya Higashikawa, Risa Ishikawa, Naoki Katoh.
  Mixed Evacuation Problem on Path Networks
• Byeonguk Kang, Jongmin Choi, Hee-Kap Ahn.
  Intersecting Disks using Two Congruent Disks
• Chanyang Seo, Taehoon Ahn, Hee-Kap Ahn.
  Shortest Paths connecting Line Segments in the Presence of Rectangular Obstacles

Day 2 (Sunday, June 25)

[09:00-09:45] Session 6 (Chair: Akira Suzuki)

• Tatsuya Gima, Tesshu Hanaka, Kohei Noro, Hirotaka Ono, Yota Otachi.
  On a spectral lower bound of treewidth
• Hiroki Arimura, Tatsuya Gima, Yasuaki Kobayashi, Hiroomi Nochide, Yota Otachi.
  Minimum Consistent Subset for Trees Revisited
• Tetsuya Araki, Shin-Ichi Nakano.
  Locate hunters far away

[10:00-10:45] Session 7 (Chair: Kazuhisa Seto)

• Michal Konecny, Sewon Park, Holger Thies.
  Extracting sound computation over hyperspaces
• Fugen Hagihara, Akitoshi Kawamura.
  The ultimate signs of second-order holonomic sequences
• Soh Kumabe, Yuichi Yoshida.
  Lipschitz Continuous Graph Algorithms

[11:00-12:00] Session 8 (Chair: Da-Jung Cho)

• Seonho Lee, Kunsoo Park.
  An efficient algorithm for diversified top-k subgraph querying
• Yeunjun Lee, Kunsoo Park.
  Computation of Minimum Image Based Support via Graph Automorphism
• Geonmo Gu, Yehyun Nam, Kunsoo Park, Zvi Galil, Giuseppe Italiano, Wook-Shin Han.
  Fast Algorithm for Finding Isomorphic Graphs
• Hitomi Hayashi, Yuya Higashikawa, Naoki Katoh.
  Properties of Euclidean Minimum Weight (k,l)-Tight Graphs

[12:00-14:00] Lunch & Discussion

[14:00-15:00] Session 9 (Chair: Sang Won Bae)

• Yuya Higashikawa, Junichi Teruyama, Yuki Tokuni, Azusa Yamamoto.
  Efficient Algorithms for Quickest Transshipment Problems in Grid Networks Motivated by Tsunami Evacuation
• Yuya Higashikawa, Ayano Nishii, Junichi Teruyama, Yuki Tokuni.
  Sink Location Problems in Dynamic Flow Grid Networks
• Mook Kwon Jung, Sang Duk Yoon, Hee-Kap Ahn, Takeshi Tokuyama.
  Universal convex covering problems under affine dihedral group actions
• Hwi Kim, Jaegun Lee, Hee-Kap Ahn.
  Uniformly Monotone Partitioning of Polygons

[15:15-16:15] Session 10 (Chair: Kunihiko Sadakane)

• Chuzo Iwamoto, Ryo Takaishi.
  Yajisan-Kazusan and Stained Glass are NP-complete
• Ryu Suzuki, Yasuaki Kobayashi, Kazuhisa Seto, Takashi Horiyama.
  NP-completeness of Computing Pre-assignments to Uniquify Vertex Cover for Bipartite Graphs
• Akimasa Kawasaka, Hiroshi Fujiwara, Ayana Sasada, Hiroaki Yamamoto.
  Online Removable Knapsack Problems with Generalized Item Removal Rules
• Ryota Murai, Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Hirotaka Ono, Yota Otachi.
  Structural Parameterizations of Vertex Integrity