Abstract is missing.
- Quantum Query Lower Bounds for Key Recovery Attacks on the Even-Mansour CipherAkinori Kawachi, Yuki Naito. 3-16 [doi]
- Extended Formulations via Decision DiagramsYuta Kurokawa, Ryotaro Mitsuboshi, Haruki Hamasaki, Kohei Hatano, Eiji Takimoto, Holakou Rahmanian. 17-28 [doi]
- Greedy Gray Codes for Dyck Words and Ballot SequencesVincent Vajnovszki, Dennis Wong. 29-40 [doi]
- Efficiently-Verifiable Strong Uniquely Solvable Puzzles and Matrix MultiplicationMatthew Anderson, Vu Le. 41-54 [doi]
- $(\min ,+)$ Matrix and Vector Products for Inputs Decomposable into Few Monotone SubsequencesAndrzej Lingas, Mia Persson. 55-68 [doi]
- A Sub-quadratic Time Algorithm for Computing the Beacon Kernel of Simple PolygonsBinay Bhattacharya, Amirhossein Mozafari, Thomas C. Shermer. 69-81 [doi]
- An Approach to Agent Path Planning Under Temporal Logic ConstraintsChaofeng Yu, Nan Zhang 0001, Zhenhua Duan, Cong Tian. 82-93 [doi]
- The Heterogeneous Rooted Tree Cover ProblemPengxiang Pan, Junran Lichen, Ping Yang, Jianping Li. 94-105 [doi]
- The Hardness of Optimization Problems on the Weighted Massively Parallel Computation ModelHengzhao Ma, Jianzhong Li 0001. 106-117 [doi]
- The Regularized Submodular Maximization via the Lyapunov MethodXin Sun, Congying Han, Chenchen wu, Dachuan Xu, Yang Zhou 0018. 118-143 [doi]
- Topological Network-Control GamesZihui Liang, Bakh Khoussainov, Haidong Yang. 144-156 [doi]
- Lower Bounds of Functions on Finite Abelian GroupsJianting Yang, Ke Ye, Lihong Zhi. 157-170 [doi]
- A Discharging Method: Improved Kernels for Edge Triangle Packing and CoveringZimo Sheng, Mingyu Xiao 0001. 171-183 [doi]
- Random Shortening of Linear Codes and ApplicationsXue Chen, Kuan Cheng, Xin Li, Songtao Mao. 184-197 [doi]
- Algorithms for Full-View Coverage of Targets with Group Set CoverJingfang Su, Hongwei Du. 198-209 [doi]
- Improved Bounds for the Binary Paint Shop ProblemJaroslav Hancl, A. Kabela, Michal Opler, Jakub Sosnovec, Robert Sámal, Pavel Valtr 0001. 210-221 [doi]
- Fitch Graph CompletionMarc Hellmuth, Peter F. Stadler, Sandhya Thekkumpadan Puthiyaveedu. 225-237 [doi]
- Deterministic Primal-Dual Algorithms for Online k-Way Matching with DelaysNaonori Kakimura, Tomohiro Nakayoshi. 238-249 [doi]
- Diversity and Freshness-Aware Regret Minimizing Set QueriesHongjie Guo, Jianzhong Li, Fangyao Shen, Hong Gao 0001. 250-262 [doi]
- A Modified EXP3 in Adversarial Bandits with Multi-user Delayed FeedbackYandi Li, Jianxiong Guo. 263-278 [doi]
- Cabbage Can't Always Be Transformed into Turnip: Decision Algorithms for Sorting by Symmetric ReversalsXin Tong, Yixiao Yu, Ziyi Fang, Haitao Jiang, Lusheng Wang 0001, Binhai Zhu, Daming Zhu. 279-294 [doi]
- k-Median/Means with Outliers Revisited: A Simple Fpt ApproximationXianrun Chen, Lu Han, Dachuan Xu, Yicheng Xu, Yong Zhang. 295-302 [doi]
- A Cost-Sharing Scheme for the k-Product Facility Location Game with PenaltiesXiaowei Li, Xiwen Lu. 303-314 [doi]
- Maximizing Diversity and Persuasiveness of Opinion Articles in Social NetworksLiman Du, Wenguo Yang, Suixiang Gao. 317-328 [doi]
- Stochastic Model for Rumor Blocking Problem in Social Networks Under Rumor Source UncertaintyJianming Zhu, Runzhi Li, Smita Ghosh, Weili Wu 0001. 329-339 [doi]
- Algorithms for Shortest Path Tour Problem in Large-Scale Road NetworkYucen Gao, Mingqian Ma, Jiale Zhang, Songjian Zhang, Jun Fang, Xiaofeng Gao 0001, Guihai Chen. 340-352 [doi]
- Solving Systems of Linear Equations Through Zero Forcing SetJianbo Wang, Chao Xu 0002, Siyun Zhou. 353-365 [doi]
- Profit Maximization for Competitive Influence Spread in Social NetworksQiufen Ni, Yun Bai, Zhongzheng Tang. 366-377 [doi]
- Improved Approximation Algorithms for Multidepot Capacitated Vehicle RoutingJingyang Zhao 0001, Mingyu Xiao 0001. 378-391 [doi]
- On the Minimum Depth of Circuits with Linear Number of Wires Encoding Good CodesAndrew Drucker, Yuan Li. 392-403 [doi]
- Approval-Based Participatory Budgeting with DonationsShiwen Wang, Chenhao Wang, Tian Wang, Weijia Jia. 404-416 [doi]