The 37th International Symposium on Algorithms and Computation
December 6-9, 2026 · Hangzhou, China
Dates: December 6–9, 2026
Venue: Jinxi Hotel (金溪山庄), West Lake Scenic Area, No.39 Yanggong Di, Xihu Dist., Hangzhou, Zhejiang, China
Session A1: Graph Structure & Spanners
Session A2: Algebra & Number Theory
Session B1: Complexity & CSP
Session B2: Approximation Algorithms
Session C1: Computational Geometry (I)
Session C2: Data Structures & Compression
Session D1: Scheduling & Routing
Session D2: Parameterized Graph Algorithms
Session E1: Submodular & Matroid Optimization
Session E2: Computational Geometry (II)
Session F1: Facility, Matching & Clustering
Session F2: Vertex Cover & Domination
Session G1: Distributed Algorithms & Advice
Session G2: TSP & Network Design
Session H1: Random Structures & Spin Systems
Session H2: Strings & Combinatorial Structures
Invited Talk 1
Combinatorial Contracts: Algorithms, Incentives, and Complexity
Michal Feldman
Session A1: Graph Structure & Spanners
Session A2: Algebra & Number Theory
The structure of Gem-induced-minor-free graphs
Fast and Lightweight Solver for Multivariate Linear Congruences via Hermite Normal Form
Detecting H-Induced Minors for Small H
A Computational Perspective on Carmichael Numbers
Weighted Emulators with Local Heaviest Edges Stretch for Undirected Graphs
Fast Deterministic Normal Bases and Circulant Polynomial Determinants
On (Directed) Width-Parameters of Geometric Spanners
A number-theoretic conjecture implying faster algorithms for polynomial factorization and integer factorization
Session B1: Complexity & CSP
Session B2: Approximation Algorithms
On the Hardness of the Group Epimorphism Problem
Approximating the Chvátal-Gomory Closure of Capacity-Bounded Min-Closed Systems
Ideal Membership in Polynomial Calculus: Complexity and Reductions
An Improved Approximation Algorithm for Maximum Weight 3-Path Packing
Towards an Interesting VPSPACE-complete Problem
Ultrametric Violation Distance with Upper and Lower Bounds: A 4-Approximation
On Variable-Diverse and Constraint-Diverse Assignments to Max-k-CSP and Bounded-Degree k-SAT
A PTAS for Generalized Partial Edge Covers
Session C1: Computational Geometry (I)
Session C2: Data Structures & Compression
Optimal Floodlight Illumination of Stages with Obstacles
Succinct Representation of Search Trees on Trees
Bichromatic Line-Centers for Point Pairs
A Refined Analysis of the Sequential Access Theorem for Splay Trees
A collapse process for farthest Voronoi diagrams of lines in three dimensions
Faster Distance Oracles for Dynamic Interval Graphs
Improved Exact Algorithms for the Smallest Grammar Problem
Invited Talk 2
Single-Source Shortest Paths in Geometric Intersection Graphs
Mark de Berg
Session D1: Scheduling & Routing
Session D2: Parameterized Graph Algorithms
Offline green bin packing and its constrained variant
An FPT algorithm for cycle rank on semi-complete digraphs
Exact Algorithms for Low-Capacity Multi-Depot Vehicle Routing with Restocking
A Separator-based Algorithm for the Graph Edit Distance Problem
Busy Time Minimization with Preemption, Migration, and One Resource Requirement
Linear-Time FPT Algorithm for Surface Disjoint Paths via Surface Cutting
A Quadratic Vertex Kernel and Subexponential Algorithms for Subset-FAST
Session E1: Submodular & Matroid Optimization
Session E2: Computational Geometry (II)
A Polymatroidal Perspective on Random Contraction
Recognizing Subgraphs of Regular Tilings
Linear-Query Deterministic Approximation for Non-monotone Submodular Maximization under a Knapsack Constraint
One-Sided Local Crossing Minimization
Constant approximation for k-submodular maximization under individual knapsack constraints
Upward Planar Point-Set Embeddings of Paths and 3-Connected Graphs
Ranking and Rank Aggregation with Matroid Prefix Constraints
Perfect Rectangular Tilings with Two Colors
Session F1: Facility, Matching & Clustering
Session F2: Vertex Cover & Domination
Approximation Algorithm for the Min-Cost Bipartite Matching with Penalties
Minimum Sum Vertex Cover via Minimum Vertex Cover
The Price of Explainability for Sum of Radii Clustering
Vertex Cover Interdiction in Bipartite Graphs
Improved Randomized Approximations for Strategic Obnoxious Facility Location
Connected Dominating Set on Semi-Ladder-Free Graphs
Stable Matchings with Minimum Utility Gap
Emergency Vertex Cover
Invited Talk 3
Revisiting Old Assumptions: How Much Clairvoyance Does a Job Need?
Anupam Gupta
Best Paper Award Presentation
Online Bin Packing with Dispatch Deadlines
Pei-Lin Chiang, Wing-Kai Hon, Kazuo Iwama and Li-Tzu Yang
Best Student Paper Award Presentation
Finite Pinwheel Covering
Sotiris Kanellopoulos
Session G1: Distributed Algorithms & Advice
Session G2: TSP & Network Design
Oblivious Self-Distance Symmetric Rendezvous on the Integer Line
Improved Algorithms for Bounded-Degree (Subset) Traveling Salesman Problems
With a Little Help From My Friends: Exploiting Probability Distribution Advice in Algorithm Design
The Query Steiner Tree Problem
A Gossiping Protocol for Sparse Ad-Hoc Radio Networks
An O(log k)-approximation algorithm for the k−-star partition problem
Session H1: Random Structures & Spin Systems
Session H2: Strings & Combinatorial Structures
Strong Spatial Mixing for Continuous Spin Systems with Multi-Interactions
Shorthand Universal Tori for Permutations: Existence, Symmetry, and Generation of Twori
Streaming Max-Cut in General Metrics
On the Structure and Complexity of Shuffle Decompositions
The Clique Construction Is Not Extremal for Random Cycle-Factors
Algorithms and Lower Bounds for Hedge Cluster Deletion Problems
Zero-Freeness of the Hard-Core Model with Bounded Connective Constant