WAAC2025 Accepted Papers
Yu Nakahata. On the Size of ZDDs and the Computational Complexity of Their Operations Yuki Nishimura and Kazuya Haraguchi. Enumeration of Bases in Matroid with Exponentially Large Ground Set
Taiki Kaneda, Yasuaki Kobayashi and Hiroki Arimura. Simple and Efficient Dynamic and Persistent Data Structures for Dynamic Strings Based on Balanced Search Trees Mook Kwon Jung, Seokyun Kang and Hee-Kap Ahn. Minimum Convex Hull of Two Convex Polytopes Hyo Jeong An, Jaegun Lee, Hwi Kim and Hee-Kap Ahn. Monotone Partitions of Simple Polygons
Shunta Yamazaki and Tomomi Matsui. Shapley Value in Rectified Linear Function Games
Toshihiko Kimura, Yonghwan Kim and Yoshiaki Katayama. On the General Position Number for Cactus Graphs
Yutaro Fuse, Tomomi Matsui, Nobutaka Shimizu and Akiyoshi Shioura. An Efficient Algorithm for Computing Average Network Flow
Sankardeep Chakraborty, Seungbum Jo, Geunho Kim and Kunihiko Sadakane. Succinct Data Structures for Baxter Permutation and Related Families
Fumiya Sakamoto, Ryu Suzuki, Kazuhisa Seto and Takashi Horiyama. The Complexity of Computing Pre-assignments for Uniquifying Minimum Vertex Cover on Planar Graphs with Maximum Degree 3
Hiroki Shibata, Yuto Nakashima, Yutaro Yamaguchi and Shunsuke Inenaga. LZSE: an LZ-style compressor supporting O(log n)-time random access Taehoon Ahn, Sang Won Bae and Sang Duk Yoon. The Orthogonal Two-Line Center Problem
Andrea Aliberti, Yonghwan Kim and Yoshiaki Katayama. The Impossibilities of the Gathering Problems in Defected View Model under Weaker Schedulers
Haruki Toyoizumi, Youghwan Kim and Yoshiaki Katayama. An Object Finding and a Shortest Path Construction by Autonomous Mobile Robots on a Finite Grid
Seokchul Kang, Joong Chae Na and Jeong Seop Sim. 3-Partition Order-Preserving Pattern Matching
Sanghun Ahn, Seokchul Kang and Jeong Seop Sim. Comparative Analysis of Data Structures for Multiple Order-Preserving Pattern Matching