ISAAC 2026

The 37th International Symposium on Algorithms and Computation

December 6-9, 2026 · Hangzhou, China

Program at a glance

Dates: December 6–9, 2026

Venue: Jinxi Hotel (金溪山庄), West Lake Scenic Area, No.39 Yanggong Di, Xihu Dist., Hangzhou, Zhejiang, China

December 6, 2026

18:00–20:00
Welcome Reception

Day 1

December 7, 2026
Time
Jinxi Hall
09:00–10:00
Jinxi HallInvited Talk 1 - Michal Feldman
10:00–10:20
Coffee Break
Time
Sightseeing Hall
Jinxi Hall
10:20–12:00
Sightseeing Hall

Session A1: Graph Structure & Spanners

Jinxi Hall

Session A2: Algebra & Number Theory

12:00–13:30
Lunch
Time
Sightseeing Hall
Wenxi Hall
13:30–15:10
Sightseeing Hall

Session B1: Complexity & CSP

Wenxi Hall

Session B2: Approximation Algorithms

15:10–15:40
Coffee Break
15:40–17:20
Sightseeing Hall

Session C1: Computational Geometry (I)

Wenxi Hall

Session C2: Data Structures & Compression

Day 2

December 8, 2026
Time
Jinxi Hall
09:00–10:00
Jinxi HallInvited Talk 2 - Mark de Berg
10:00–10:20
Coffee Break
Time
Sightseeing Hall
Jinxi Hall
10:20–12:00
Sightseeing Hall

Session D1: Scheduling & Routing

Jinxi Hall

Session D2: Parameterized Graph Algorithms

12:00–13:30
Lunch
Time
Sightseeing Hall
Wenxi Hall
13:30–15:10
Sightseeing Hall

Session E1: Submodular & Matroid Optimization

Wenxi Hall

Session E2: Computational Geometry (II)

15:10–15:40
Coffee Break
15:40–17:20
Sightseeing Hall

Session F1: Facility, Matching & Clustering

Wenxi Hall

Session F2: Vertex Cover & Domination

18:00–20:00
Banquet

Day 3

December 9, 2026
Time
Jinxi Hall
09:30–10:30
Jinxi HallInvited Talk 3 - Anupam Gupta
10:30–11:00
Coffee Break
11:00–11:30
Jinxi HallBest Paper Award Presentation
11:30–12:00
Jinxi HallBest Student Paper Award Presentation
12:00–13:30
Lunch
Time
Sightseeing Hall
Wenxi Hall
13:30–14:45
Sightseeing Hall

Session G1: Distributed Algorithms & Advice

Wenxi Hall

Session G2: TSP & Network Design

14:45–15:15
Coffee Break
15:15–16:55
Sightseeing Hall

Session H1: Random Structures & Spin Systems

Wenxi Hall

Session H2: Strings & Combinatorial Structures

Day 1

December 7, 2026
Time
Jinxi Hall
09:00–10:00
Jinxi Hall

Invited Talk 1

Combinatorial Contracts: Algorithms, Incentives, and Complexity

Michal Feldman

10:00–10:20
Coffee Break
Time
Sightseeing Hall
Jinxi Hall
Sightseeing Hall

Session A1: Graph Structure & Spanners

Jinxi Hall

Session A2: Algebra & Number Theory

10:20–10:45
Sightseeing Hall A1-1

The structure of Gem-induced-minor-free graphs

Clément Dallard and Cindy Schnyder

Jinxi Hall A2-1

Fast and Lightweight Solver for Multivariate Linear Congruences via Hermite Normal Form

Yijian Zhai and Fuyou Miao

10:45–11:10
Sightseeing Hall A1-2

Detecting H-Induced Minors for Small H

Tala Eagling-Vose, Barnaby Martin, Daniel Paulusma and Nicolas Trotignon

Jinxi Hall A2-2

A Computational Perspective on Carmichael Numbers

Nikhil Gupta, Alan Sikarov and Ilya Volkovich

11:10–11:35
Sightseeing Hall A1-3

Weighted Emulators with Local Heaviest Edges Stretch for Undirected Graphs

Ariel Sapir and Liam Roditty

Jinxi Hall A2-3

Fast Deterministic Normal Bases and Circulant Polynomial Determinants

Mark Giesbrecht, Armin Jamshidpey and Éric Schost

11:35–12:00
Sightseeing Hall A1-4

On (Directed) Width-Parameters of Geometric Spanners

Torben Scheele, Kevin Buchin and Carolin Rehs

Jinxi Hall A2-4

A number-theoretic conjecture implying faster algorithms for polynomial factorization and integer factorization

Siki Wang and Chris Umans

12:00–13:30
Lunch
Time
Sightseeing Hall
Wenxi Hall
Sightseeing Hall

Session B1: Complexity & CSP

Wenxi Hall

Session B2: Approximation Algorithms

13:30–13:55
Sightseeing Hall B1-1

On the Hardness of the Group Epimorphism Problem

François Le Gall, Pranjal Srivastava and Dhara Thakkar

Wenxi Hall B2-1

Approximating the Chvátal-Gomory Closure of Capacity-Bounded Min-Closed Systems

Stefano Huber and Monaldo Mastrolilli

13:55–14:20
Sightseeing Hall B1-2

Ideal Membership in Polynomial Calculus: Complexity and Reductions

Alex Bortolotti and Monaldo Mastrolilli

Wenxi Hall B2-2

An Improved Approximation Algorithm for Maximum Weight 3-Path Packing

Jingyang Zhao and Mingyu Xiao

14:20–14:45
Sightseeing Hall B1-3

Towards an Interesting VPSPACE-complete Problem

Marco Carmosino, Nikhil Gupta and Ilya Volkovich

Wenxi Hall B2-3

Ultrametric Violation Distance with Upper and Lower Bounds: A 4-Approximation

Changyeol Lee and Hyung-Chan An

14:45–15:10
Sightseeing Hall B1-4

On Variable-Diverse and Constraint-Diverse Assignments to Max-k-CSP and Bounded-Degree k-SAT

Mayank Goswami and Adarsh Srinivasan

Wenxi Hall B2-4

A PTAS for Generalized Partial Edge Covers

Xujin Chen, Changjun Wang and Daorong Yu

15:10–15:40
Coffee Break
Sightseeing Hall

Session C1: Computational Geometry (I)

Wenxi Hall

Session C2: Data Structures & Compression

15:40–16:05
Sightseeing Hall C1-1

Optimal Floodlight Illumination of Stages with Obstacles

Sayan Bandyapadhyay and Aniket Basu Roy

Wenxi Hall C2-1

Succinct Representation of Search Trees on Trees

Seungbum Jo and Nodari Sitchinava

16:05–16:30
Sightseeing Hall C1-2

Bichromatic Line-Centers for Point Pairs

Jaegun Lee, Youjung Bae, Taehoon Ahn, Sang Won Bae and Hee-Kap Ahn

Wenxi Hall C2-2

A Refined Analysis of the Sequential Access Theorem for Splay Trees

Naonori Kakimura and Yoshihiko Terai

16:30–16:55
Sightseeing Hall C1-3

A collapse process for farthest Voronoi diagrams of lines in three dimensions

Zeyu Wang, Evanthia Papadopoulou and Martin Suderland

Wenxi Hall C2-3

Faster Distance Oracles for Dynamic Interval Graphs

Ryan Bai, Jingbang Chen, Meng He, Richard Peng and Kaiyu Wu

16:55–17:20
Wenxi Hall C2-4

Improved Exact Algorithms for the Smallest Grammar Problem

Yuhan Chen

Day 2

December 8, 2026
Time
Jinxi Hall
09:00–10:00
Jinxi Hall

Invited Talk 2

Single-Source Shortest Paths in Geometric Intersection Graphs

Mark de Berg

10:00–10:20
Coffee Break
Time
Sightseeing Hall
Jinxi Hall
Sightseeing Hall

Session D1: Scheduling & Routing

Jinxi Hall

Session D2: Parameterized Graph Algorithms

10:20–10:45
Sightseeing Hall D1-1

Offline green bin packing and its constrained variant

Mingyang Gong and Brendan Mumey

Jinxi Hall D2-1

An FPT algorithm for cycle rank on semi-complete digraphs

Seokbeom Kim, O-Joung Kwon and Myounghwan Lee

10:45–11:10
Sightseeing Hall D1-2

Exact Algorithms for Low-Capacity Multi-Depot Vehicle Routing with Restocking

Chao Xu, Yicheng Yang and Qian Zhang

Jinxi Hall D2-2

A Separator-based Algorithm for the Graph Edit Distance Problem

Philip Mayer, Laura Bülte, Lars Müller and Petra Mutzel

11:10–11:35
Sightseeing Hall D1-3

Busy Time Minimization with Preemption, Migration, and One Resource Requirement

Gruia Calinescu and Mozhengfu Liu

Jinxi Hall D2-3

Linear-Time FPT Algorithm for Surface Disjoint Paths via Surface Cutting

Kyungjin Cho, Eunjin Oh and Sebastian Wiederrecht

11:35–12:00
Jinxi Hall D2-4

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

12:00–13:30
Lunch
Time
Sightseeing Hall
Wenxi Hall
Sightseeing Hall

Session E1: Submodular & Matroid Optimization

Wenxi Hall

Session E2: Computational Geometry (II)

13:30–13:55
Sightseeing Hall E1-1

A Polymatroidal Perspective on Random Contraction

Karthekeyan Chandrasekaran, Chandra Chekuri and Weihao Zhu

Wenxi Hall E2-1

Recognizing Subgraphs of Regular Tilings

Eliel Ingervo and Sándor Kisfaludi-Bak

13:55–14:20
Sightseeing Hall E1-2

Linear-Query Deterministic Approximation for Non-monotone Submodular Maximization under a Knapsack Constraint

Zihui Liu and Zhijie Zhang

Wenxi Hall E2-2

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

14:20–14:45
Sightseeing Hall E1-3

Constant approximation for k-submodular maximization under individual knapsack constraints

Hongyang Zhang, Wenchang Luo, Guohui Lin and Lusheng Wang

Wenxi Hall E2-3

Upward Planar Point-Set Embeddings of Paths and 3-Connected Graphs

Hugo Akitaya, Kazi Anwar, Myroslav Kryven, Debajyoti Mondal and Rahnuma Nishat

14:45–15:10
Sightseeing Hall E1-4

Ranking and Rank Aggregation with Matroid Prefix Constraints

Seiei Ando and Yu Yokoi

Wenxi Hall E2-4

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

15:10–15:40
Coffee Break
Sightseeing Hall

Session F1: Facility, Matching & Clustering

Wenxi Hall

Session F2: Vertex Cover & Domination

15:40–16:05
Sightseeing Hall F1-1

Approximation Algorithm for the Min-Cost Bipartite Matching with Penalties

Eunjin Oh, Seongbin Park and Chanho Song

Wenxi Hall F2-1

Minimum Sum Vertex Cover via Minimum Vertex Cover

Ahmad Biniaz, Jean-Lou De Carufel, Anil Maheshwari, Saeed Odak and Michiel Smid

16:05–16:30
Sightseeing Hall F1-2

The Price of Explainability for Sum of Radii Clustering

Jijun Li, Xianrun Chen, Chenchen Wu, Yicheng Xu and Yong Zhang

Wenxi Hall F2-2

Vertex Cover Interdiction in Bipartite Graphs

Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi and Yoshio Okamoto

16:30–16:55
Sightseeing Hall F1-3

Improved Randomized Approximations for Strategic Obnoxious Facility Location

Hau Chan, Jianan Lin and Chenhao Wang

Wenxi Hall F2-3

Connected Dominating Set on Semi-Ladder-Free Graphs

Sobyasachi Chatterjee, Sushmita Gupta, Saket Saurabh, Sanjay Seetharaman and Anannya Upasana

16:55–17:20
Sightseeing Hall F1-4

Stable Matchings with Minimum Utility Gap

Yao Sheng and Yu Yokoi

Wenxi Hall F2-4

Emergency Vertex Cover

Eric Angel, Evripidis Bampis, Evangelos Bampas, Vincent Chau, Johanne Cohen, Alexander Kononov and Yizheng Zhang

18:00–20:00
Banquet

Day 3

December 9, 2026
Time
Jinxi Hall
09:30–10:30
Jinxi Hall

Invited Talk 3

Revisiting Old Assumptions: How Much Clairvoyance Does a Job Need?

Anupam Gupta

10:30–11:00
Coffee Break
11:00–11:30
Jinxi Hall

Best Paper Award Presentation

Online Bin Packing with Dispatch Deadlines

Pei-Lin Chiang, Wing-Kai Hon, Kazuo Iwama and Li-Tzu Yang

11:30–12:00
Jinxi Hall

Best Student Paper Award Presentation

Finite Pinwheel Covering

Sotiris Kanellopoulos

12:00–13:30
Lunch
Time
Sightseeing Hall
Wenxi Hall
Sightseeing Hall

Session G1: Distributed Algorithms & Advice

Wenxi Hall

Session G2: TSP & Network Design

13:30–13:55
Sightseeing Hall G1-1

Oblivious Self-Distance Symmetric Rendezvous on the Integer Line

Konstantinos Georgiou, Claude Gravel, Joey Kapusin and Lazar Mandic

Wenxi Hall G2-1

Improved Algorithms for Bounded-Degree (Subset) Traveling Salesman Problems

Jongseo Lee, Jaehyeok Kwak and Hyung-Chan An

13:55–14:20
Sightseeing Hall G1-2

With a Little Help From My Friends: Exploiting Probability Distribution Advice in Algorithm Design

Clément Canonne, Kenny Chen and Julian Mestre

Wenxi Hall G2-2

The Query Steiner Tree Problem

Tesshu Hanaka, Hirotaka Ono, Kunihiko Sadakane and Kosuke Sugiyama

14:20–14:45
Sightseeing Hall G1-3

A Gossiping Protocol for Sparse Ad-Hoc Radio Networks

Chao Wu and Marek Chrobak

Wenxi Hall G2-3

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

14:45–15:15
Coffee Break
Sightseeing Hall

Session H1: Random Structures & Spin Systems

Wenxi Hall

Session H2: Strings & Combinatorial Structures

15:15–15:40
Sightseeing Hall H1-1

Strong Spatial Mixing for Continuous Spin Systems with Multi-Interactions

Shuai Shao, Ke Shi and Bohan Wang

Wenxi Hall H2-1

Shorthand Universal Tori for Permutations: Existence, Symmetry, and Generation of Twori

Tim Gerlach, Liz Hartung, Pia Herkenrath, Joe Sawada and Aaron Williams

15:40–16:05
Sightseeing Hall H1-2

Streaming Max-Cut in General Metrics

Shaofeng H.-C. Jiang, Pan Peng and Haoze Wang

Wenxi Hall H2-2

On the Structure and Complexity of Shuffle Decompositions

Vincent Jugé and Stéphane Vialette

16:05–16:30
Sightseeing Hall H1-3

The Clique Construction Is Not Extremal for Random Cycle-Factors

Rishikesh Gajjala

Wenxi Hall H2-3

Algorithms and Lower Bounds for Hedge Cluster Deletion Problems

Athanasios Konstantinidis, Charis Papadopoulos and Georgios Velissaris

16:30–16:55
Sightseeing Hall H1-4

Zero-Freeness of the Hard-Core Model with Bounded Connective Constant

Yuan Chen, Ke Shi and Shuai Shao