AAAC 2024 Accepted Papers
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi and Yoshio Okamoto. Electrical Flows over Spanning Trees on Grids Takeshi Tokuyama, Rurika Takami and Natsuda Kaothanthong. Ordered Multiple Alignment and Rank Aggregation
Siu-Wing Cheng and Haoqiang Huang. Approximate Nearest Neighbor for Polygonal Curves under Fr\'echet Distance
Ryosuke Sato. Liquid Welfare and Revenue Monotonicity of Adaptive Clinching Auctions Yuichi Asahiro, Jesper Jansson, Avraham Melkman, Eiji Miyano, Hirotaka Ono, Quan Xue and Shay Zakov. Shortest Longest-Maximal-Path Orientation for Trees
Yuichi Asahiro, Hiroshi Eto, Taku Kato, Guohui Lin and Eiji Miyano. Bounded-Deletion Maximum Independent Set Problem on Chordal Bipartite Graphs Suey Wang and Hsu-Chun Yen. Morphing of Area-Universal Contact Graph Representations
Masaya Sano and Hiroshi Fujiwara. Decomposition of Reconfiguration Graphs of Independent Sets under Token Jumping
Yasushi Kawase and Tomohiro Nakayoshi. Online Matching with Delays and Size-based Costs Keita Miyajima and Hiroshi Fujiwara. Snow Shoveling Cost of a Graph
Man-Kwun Chiu and Matias Korman. On the Number of Three-Dimensional Consistent Digital Rays
Pin-Yu Yeh, Tzu-Ching Lin, Ching-Hsuan Huang and Chung-Shou Liao. Approximating with Predictions the k-Canadian Traveller Problem in Graphs Ke-Rong Tseng, Ya-Chun Liang, Hung-Yi Lee and Chung-Shou Liao. Algorithms for Fully Online Scheduling with Testing on Multiple Machines Fucheng Xie and Wendu Sha. Maximum Irregular Shape Packing Problem via Reinforcement Learning
Tingwei Hu, Lili Mei, Zhen Wang and Guochuan Zhang. The Price of Fairness for Budget-Feasible EF1 Allocations
Shuangle Li, Bingkai Lin and Yuwei Liu. Improved Lower Bounds for Approximating Parameterized Nearest Codeword and Related Problems under ETH
Yijia Chen, Yi Feng, Bundit Laekhanukit and Yanlin Liu. Simple Combinatorial Construction of the $k^{o(1)}$-Lower Bound for Approximating the Parameterized $k$-Clique Chensheng Ma. Minimum Power Partial Fair Cover