The 37th International Symposium on Algorithms and Computation
December 6-9, 2026 · Hangzhou, China
Accepted Papers
Strong Spatial Mixing for Continuous Spin Systems with Multi-Interactions Shuai Shao, Ke Shi and Bohan Wang
Fast and Lightweight Solver for Multivariate Linear Congruences via Hermite Normal Form Yijian Zhai and Fuyou Miao
Succinct Representation of Search Trees on Trees Seungbum Jo and Nodari Sitchinava
An FPT algorithm for cycle rank on semi-complete digraphs Seokbeom Kim, O-Joung Kwon and Myounghwan Lee
Online Bin Packing with Dispatch Deadlines Pei-Lin Chiang, Wing-Kai Hon, Kazuo Iwama and Li-Tzu Yang
Approximating the Chvátal-Gomory Closure of Capacity-Bounded Min-Closed Systems Stefano Huber and Monaldo Mastrolilli
Minimum Sum Vertex Cover via Minimum Vertex Cover Ahmad Biniaz, Jean-Lou De Carufel, Anil Maheshwari, Saeed Odak and Michiel Smid
Vertex Cover Interdiction in Bipartite Graphs Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi and Yoshio Okamoto
Optimal Floodlight Illumination of Stages with Obstacles Sayan Bandyapadhyay and Aniket Basu Roy
Finite Pinwheel Covering Sotiris Kanellopoulos
An Improved Approximation Algorithm for Maximum Weight 3-Path Packing Jingyang Zhao and Mingyu Xiao
Ultrametric Violation Distance with Upper and Lower Bounds: A 4-Approximation Changyeol Lee and Hyung-Chan An
Approximation Algorithm for the Min-Cost Bipartite Matching with Penalties Eunjin Oh, Seongbin Park and Chanho Song
Shorthand Universal Tori for Permutations: Existence, Symmetry, and Generation of Twori Tim Gerlach, Liz Hartung, Pia Herkenrath, Joe Sawada and Aaron Williams
The structure of Gem-induced-minor-free graphs Clément Dallard and Cindy Schnyder
On the Hardness of the Group Epimorphism Problem François Le Gall, Pranjal Srivastava and Dhara Thakkar
Bichromatic Line-Centers for Point Pairs Jaegun Lee, Youjung Bae, Taehoon Ahn, Sang Won Bae and Hee-Kap Ahn
Oblivious Self-Distance Symmetric Rendezvous on the Integer Line Konstantinos Georgiou, Claude Gravel, Joey Kapusin and Lazar Mandic
The Price of Explainability for Sum of Radii Clustering Jijun Li, Xianrun Chen, Chenchen Wu, Yicheng Xu and Yong Zhang
Exact Algorithms for Low-Capacity Multi-Depot Vehicle Routing with Restocking Chao Xu, Yicheng Yang and Qian Zhang
A Polymatroidal Perspective on Random Contraction Karthekeyan Chandrasekaran, Chandra Chekuri and Weihao Zhu
Ideal Membership in Polynomial Calculus: Complexity and Reductions Alex Bortolotti and Monaldo Mastrolilli
A Refined Analysis of the Sequential Access Theorem for Splay Trees Naonori Kakimura and Yoshihiko Terai
Detecting H-Induced Minors for Small H Tala Eagling-Vose, Barnaby Martin, Daniel Paulusma and Nicolas Trotignon
Faster Distance Oracles for Dynamic Interval Graphs Ryan Bai, Jingbang Chen, Meng He, Richard Peng and Kaiyu Wu
Improved Randomized Approximations for Strategic Obnoxious Facility Location Hau Chan, Jianan Lin and Chenhao Wang
A Computational Perspective on Carmichael Numbers Nikhil Gupta, Alan Sikarov and Ilya Volkovich
Fast Deterministic Normal Bases and Circulant Polynomial Determinants Mark Giesbrecht, Armin Jamshidpey and Éric Schost
Improved Exact Algorithms for the Smallest Grammar Problem Yuhan Chen
Streaming Max-Cut in General Metrics Shaofeng H.-C. Jiang, Pan Peng and Haoze Wang
A PTAS for Generalized Partial Edge Covers Xujin Chen, Changjun Wang and Daorong Yu
A Separator-based Algorithm for the Graph Edit Distance Problem Philip Mayer, Laura Bülte, Lars Müller and Petra Mutzel
Connected Dominating Set on Semi-Ladder-Free Graphs Sobyasachi Chatterjee, Sushmita Gupta, Saket Saurabh, Sanjay Seetharaman and Anannya Upasana
Recognizing Subgraphs of Regular Tilings Eliel Ingervo and Sándor Kisfaludi-Bak
Emergency Vertex Cover Eric Angel, Evripidis Bampis, Evangelos Bampas, Vincent Chau, Johanne Cohen, Alexander Kononov and Yizheng Zhang
One-Sided Local Crossing Minimization Miriam Goetze, Panos Giannopoulos, Grzegorz Gutowski, Maarten Löffler, Martin Nöllenburg, Yuto Okada, Jonathan Rollin, Birgit Vogtenhuber and Alexander Wolff
A number-theoretic conjecture implying faster algorithms for polynomial factorization and integer factorization Siki Wang and Chris Umans
Upward Planar Point-Set Embeddings of Paths and 3-Connected Graphs Hugo Akitaya, Kazi Anwar, Myroslav Kryven, Debajyoti Mondal and Rahnuma Nishat
Perfect Rectangular Tilings with Two Colors Ids de Vlas, Maarten Löffler, Oswin Aichholzer, Robert Ganian, Phillip Keldenich, Gert Meijer, Alexandra Weinberger and Carola Wenk
Busy Time Minimization with Preemption, Migration, and One Resource Requirement Gruia Calinescu and Mozhengfu Liu
Weighted Emulators with Local Heaviest Edges Stretch for Undirected Graphs Ariel Sapir and Liam Roditty
The Clique Construction Is Not Extremal for Random Cycle-Factors Rishikesh Gajjala
Linear-Query Deterministic Approximation for Non-monotone Submodular Maximization under a Knapsack Constraint Zihui Liu and Zhijie Zhang
Linear-Time FPT Algorithm for Surface Disjoint Paths via Surface Cutting Kyungjin Cho, Eunjin Oh and Sebastian Wiederrecht
With a Little Help From My Friends: Exploiting Probability Distribution Advice in Algorithm Design Clément Canonne, Kenny Chen and Julian Mestre
Constant approximation for k-submodular maximization under individual knapsack constraints Hongyang Zhang, Wenchang Luo, Guohui Lin and Lusheng Wang
On (Directed) Width-Parameters of Geometric Spanners Torben Scheele, Kevin Buchin and Carolin Rehs
Ranking and Rank Aggregation with Matroid Prefix Constraints Seiei Ando and Yu Yokoi
Stable Matchings with Minimum Utility Gap Yao Sheng and Yu Yokoi
On the Structure and Complexity of Shuffle Decompositions Vincent Jugé and Stéphane Vialette
A Quadratic Vertex Kernel and Subexponential Algorithms for Subset-FAST Tian Bai, Satyabrata Jana, Lawqueen Kanesh, Madhumita Kundu, Daniel Lokshtanov, Saket Saurabh and Mingyu Xiao
Improved Algorithms for Bounded-Degree (Subset) Traveling Salesman Problems Jongseo Lee, Jaehyeok Kwak and Hyung-Chan An
A Gossiping Protocol for Sparse Ad-Hoc Radio Networks Chao Wu and Marek Chrobak
Zero-Freeness of the Hard-Core Model with Bounded Connective Constant Yuan Chen, Ke Shi and Shuai Shao
Algorithms and Lower Bounds for Hedge Cluster Deletion Problems Athanasios Konstantinidis, Charis Papadopoulos and Georgios Velissaris
The Query Steiner Tree Problem Tesshu Hanaka, Hirotaka Ono, Kunihiko Sadakane and Kosuke Sugiyama
Towards an Interesting VPSPACE-complete Problem Marco Carmosino, Nikhil Gupta and Ilya Volkovich
Offline green bin packing and its constrained variant Mingyang Gong and Brendan Mumey
A collapse process for farthest Voronoi diagrams of lines in three dimensions Zeyu Wang, Evanthia Papadopoulou and Martin Suderland
On Variable-Diverse and Constraint-Diverse Assignments to Max-k-CSP and Bounded-Degree k-SAT Mayank Goswami and Adarsh Srinivasan
An O(log k)-approximation algorithm for the k−-star partition problem Mengyuan Hu, An Zhang, Guangting Chen, Yong Chen, Guohui Lin, Jiaxuan Ma and Lusheng Wang
