AAAC 2026
The 17th Annual Meeting of Asian Association for Algorithms and Computation (AAAC 2026) will take place on May 23 – 24, 2026, at Ocean University of China in Qingdao, China. We invite submissions of abstracts presenting original research or surveys of existing results in theoretical computer science. The meeting will be held in person, and at least one author of each accepted submission is required to register and present the talk on-site.
Information about previous annual meetings can be found at http://www.asia-algo-comp.org.
Important Dates
| Event | Date (AoE) |
|---|---|
| First Call for Abstracts | January 2, 2026 (Friday) |
| Submission Deadline | February 28, 2026 (Saturday) |
| Notification | March 27, 2026 (Friday) |
| Camera-ready Deadline | April 10, 2026 (Friday) |
| Early Registration Deadline | April 24, 2026 (Friday) |
| Conference Dates | May 23 – 24, 2026 |
Committees
Program Committees
Hee-Kap Ahn, Pohang University of Science and Technology
Sang Won Bae, Kyonggi University
Ho-Lin Chen, National Taiwan University
Siu-Wing Cheng (Chair), The Hong Kong University of Science and Technology
Qizhi Fang, Ocean University of China
Takehiro Ito, Tohoku University
Minming Li, City University of Hong Kong
Chung-Shou Liao, National Taiwan University
Pinyan Lu, Shanghai University of Finance and Economics
Heejin Park, Hanyang University
Kunihiko Sadakane, The University of Tokyo
Xiaoming Sun, Chinese Academy of Sciences
Ryuhei Uehara, Japan Advanced Institute of Science and Technology
Guochuan Zhang, Zhejiang University
Shengyu Zhang, The Chinese University of Hong Kong
Local Organizers
Bin Liu, Ocean University of China
Wenjing Liu, Ocean University of China
Han Xiao, Ocean University of China
Yulin Chang, Ocean University of China
Kaixin Gao, Ocean University of China
Invited Speakers
Donglei Du, University of New Brunswick
Ken-ichi Kawarabayashi, National Institute of Informatics
Program
| AAAC 2026 Program – May 23 (Sat) | |
|---|---|
| Time | Session |
| Invited Talk I (Beijing Hall) | |
| 9:00-10:00 | Property preservation in parametric optimization Donglei Du (University of New Brunswick) |
| 10:00-10:30 | Coffee Break |
| Session 1: Long Talk I (Beijing Hall) | |
| 10:30-11:00 | Enumeration Algorithms for Maximal Matching in Chain Graphs Kanata Maruyama, Naoto Kaneko, Hiroshi Fujiwara and Katsuhisa Ouchi |
| 11:00-11:30 | Research on the Computational Complexity of Walls and Warriors Puzzle Shuai Zhao, Tonan Kamata and Ryuhei Uehara |
| 11:30-12:00 | Approximation Algorithms for Integer Programming with Resource Augmentation Hauke Brinkop, Hua Chen, Lin Chen, Klaus Jansen and Guochuan Zhang |
| 12:00-13:30 | Lunch Break |
|
Session 2A: Computational Geometry
(Beijing Hall)
Session 2B: Market & Game Theory
(Qingdao Hall)
|
|
| 13:30-13:50 |
Coresets for Farthest Point Problems in Hyperbolic Space
Eunku Park and Antoine Vigneron
Pricing with a Hidden Sample
Zhihao Tang, Yixin Tao and Shixin Wang
|
| 13:50-14:10 |
Shortcutting the Diameter of Point Sets and Convex Polygons using a Highway
Taekang Eom, Jeongwon Moon and Hee-Kap Ahn
Matroid Covering Games: The Core and the Nucleolus
Pengfei Liu, Han Xiao and Qizhi Fang
|
| 14:10-14:30 |
Enumeration of Polyabolos Constructible with Tangram and Sei Shonagon Chie no Ita
Hao Li, Kazuaki Yamazaki, Tonan Kamata and Ryuhei Uehara
When Does Additional Information Lead to Longer Travel Time in Multi-Origin–Destination Networks?
Xujin Chen, Xiaodong Hu, Xinqi Jing and Zhongzheng Tang
|
| 14:30-14:50 |
Subset-Constrained Simplification of Trajectory Streams
Siu-Wing Cheng and Xinru Guo
Simple and Robust Quality Disclosure: The Power of Quantile Partition
Shipra Agrawal, Yiding Feng and Wei Tang
|
| 14:50-15:00 | Short Break |
|
Session 3A: Fair Allocation
(Beijing Hall)
Session 3B: Mechanism Design
(Qingdao Hall)
|
|
| 15:00-15:20 |
Constant Weighted Maximin Share Approximations for Chores
Bo Li, Fangxiao Wang and Shiji Xing
Strategyproof Multi-Resource Allocation for Cloud Computing under Divisible and Indivisible Task Models
Yunpeng Lou and Junjie Luo
|
| 15:20-15:40 |
Fair and Efficient Completion of Chores: An (Almost) Complete Picture
Chenhao Wang, Zekai Wu and Yu Zhou
Bridging Mechanisms for Reducing Eccentricity on the Real Line
Jianan Lin, Chenhao Wang and Fenglin Yi
|
| 15:40-16:00 |
Online Fair Allocations with Binary Valuations and Beyond
Yuanyuan Wang and Tianze Wei
Strategy-Proof Mechanisms for Interval-Obnoxious Facility Location with Two Endpoints on a Line
Ling Gai, Jiachen Yu and Chenhao Wang
|
| 16:00-16:30 | Coffee Break |
|
Session 4A: Graph Theory
(Beijing Hall)
Session 4B: Approximation Algorithm
(Qingdao Hall)
|
|
| 16:30-16:50 |
Cluster Vertex Deletion on Chordal Graphs
Yixin Cao and Peng Li
Logarithmic Approximations for Fair k-Set Selection
Shi Li, Chenyang Xu and Ruilong Zhang
|
| 16:50-17:10 |
Approximate Shortest Journeys in Compact Directed Temporal Graphs
Siu-Wing Cheng and Zhimeng Gao
Competitive Non-Clairvoyant KV-Cache Scheduling for LLM Inference
Yiding Feng, Zonghan Yang and Yuhao Zhang
|
| 17:10-17:30 |
A Characterization Method for the STSP Based on Frequency K_is
Yong Wang, Ziyang Zhang, Jingxuan Zhou, Wuquan Yang and Jiali Yao
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems
Lin Chen, Tingwei Hu, Yuchen Mao, Guochuan Zhang, et al.
|
| 17:30-17:50 |
k-Product Lists for (Generalized) Feedback Vertex Sets: A Tool for Designing FPT Algorithms
Rin Saito and Yuma Tamura
Improved Approximation Guarantees for the Bin Packing Algorithm MM
Hiromu Hashimoto, Hiroshi Fujiwara and Katsuhisa Ouchi
|
| 18:00-20:30 | Banquet |
| AAAC 2026 Program – May 24 (Sun) | |
|---|---|
| Time | Session |
| Invited Talk II (Beijing Hall) | |
| 9:00-10:00 | The Four Color Theorem: Generalizations and Faster Algorithms Ken-ichi Kawarabayashi (National Institute of Informatics) |
| 10:00-10:30 | Coffee Break |
| Session 5: Long Talk II (Beijing Hall) | |
| 10:30-11:00 | Bichromatic Classifications using Strips Jaegun Lee, Chaeyoon Chung and Hee-Kap Ahn |
| 11:00-11:30 | Local Search for Clustering in Almost-linear Time Shaofeng Jiang, Yaonan Jin, Jianing Lou and Pinyan Lu |
| 11:30-12:00 | Randomized Strategyproof Mechanisms with Best of Both Worlds Fairness and Efficiency Ankang Sun and Bo Chen |
| 12:00-13:30 | Lunch |
Call for Papers
AAAC 2026
The 17th Annual Meeting of Asian Association for Algorithms and Computation (AAAC 2026) will take place on May 23 – 24, 2026, at Ocean University of China in Qingdao, China. We invite submissions of abstracts presenting original research or surveys of existing results in theoretical computer science. The meeting will be held in person, and at least one author of each accepted submission is required to register and present the talk on-site.
Information about previous annual meetings can be found at http://www.asia-algo-comp.org.
Topics
All areas of theoretical computer science, especially design and analysis of algorithms and complexity theory.
Submission Guidelines
Authors are invited to submit a single-page abstract (A4 size, PDF format) that may present original research results or surveys of existing results. Informal working notes containing all accepted abstracts will be distributed to conference participants. This distribution will not constitute prior publication and does not preclude future submissions of the work to journals or conferences.
Submissions must be uploaded via the EasyChair Conference System (https://easychair.org/conferences?conf=aaac2026) by the deadline.
Important Dates
| Event | Date (AoE) |
|---|---|
| First Call for Abstracts | January 2, 2026 (Friday) |
| Submission Deadline | February 28, 2026 (Saturday) |
| Notification | March 27, 2026 (Friday) |
| Camera-ready Deadline | April 10, 2026 (Friday) |
| Early Registration Deadline | April 24, 2026 (Friday) |
| Conference Dates | May 23 – 24, 2026 |
Best Student Presentation Award
The Best Student Presentation Award will be presented to an outstanding conference presentation. To be eligible, the presenter must be a full-time student at the time of the conference. The award will be determined by PC members.
Accepted Papers
- Shipra Agrawal, Yiding Feng and Wei Tang. Simple and Robust Quality Disclosure: The Power of Quantile Partition
- Hauke Brinkop, Hua Chen, Lin Chen, Klaus Jansen and Guochuan Zhang. Approximation Algorithms for Integer Programming with Resource Augmentation
- Yixin Cao and Peng Li. Cluster Vertex Deletion on Chordal Graphs
- Lin Chen, Tingwei Hu, Yuchen Mao, Guochuan Zhang, Guangting Chen, Yong Chen, Lili Mei and An Zhang. Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems
- Xujin Chen, Xiaodong Hu, Xinqi Jing and Zhongzheng Tang. When Does Additional Information Lead to Longer Travel Time in Multi-Origin–Destination Networks?
- Siu-Wing Cheng and Zhimeng Gao. Approximate Shortest Journeys in Compact Directed Temporal Graphs
- Siu-Wing Cheng and Xinru Guo. Subset-Constrained Simplification of Trajectory Streams
- Taekang Eom, Jeongwon Moon and Hee-Kap Ahn. Shortcutting the Diameter of Point Sets and Convex Polygons using a Highway
- Yiding Feng, Zonghan Yang and Yuhao Zhang. Competitive Non-Clairvoyant KV-Cache Scheduling for LLM Inference
- Ling Gai, Jiachen Yu and Chenhao Wang. Strategy-Proof Mechanisms for Interval-Obnoxious Facility Location with Two Endpoints on a Line
- Hiromu Hashimoto, Hiroshi Fujiwara and Katsuhisa Ouchi. Improved Approximation Guarantees for the Bin Packing Algorithm MM
- Shaofeng Jiang, Yaonan Jin, Jianing Lou and Pinyan Lu. Local Search for Clustering in Almost-linear Time
- Jaegun Lee, Chaeyoon Chung and Hee-Kap Ahn. Bichromatic Classifications using Strips
- Bo Li, Fangxiao Wang and Shiji Xing. Constant Weighted Maximin Share Approximations for Chores
- Hao Li, Kazuaki Yamazaki, Tonan Kamata and Ryuhei Uehara. Enumeration of Polyabolos Constructible with Tangram and Sei Shonagon Chie no Ita
- Shi Li, Chenyang Xu and Ruilong Zhang. Logarithmic Approximations for Fair k-Set Selection
- Jianan Lin, Chenhao Wang and Fenglin Yi. Bridging Mechanisms for Reducing Eccentricity on the Real Line
- Pengfei Liu, Han Xiao and Qizhi Fang. Matroid Covering Games: The Core and the Nucleolus
- Yunpeng Lou and Junjie Luo. Strategyproof Multi-Resource Allocation for Cloud Computing under Divisible and Indivisible Task Models
- Kanata Maruyama, Naoto Kaneko, Hiroshi Fujiwara and Katsuhisa Ouchi. Enumeration Algorithms for Maximal Matching in Chain Graphs
- Eunku Park and Antoine Vigneron. Coresets for Farthest Point Problems in Hyperbolic Space
- Rin Saito and Yuma Tamura. k-Product Lists for (Generalized) Feedback Vertex Sets: A Tool for Designing FPT Algorithms
- Ankang Sun and Bo Chen. Randomized Strategyproof Mechanisms with Best of Both Worlds Fairness and Efficiency
- Zhihao Tang, Yixin Tao and Shixin Wang. Pricing with a Hidden Sample
- Chenhao Wang, Zekai Wu and Yu Zhou. Fair and Efficient Completion of Chores: An (Almost) Complete Picture
- Yong Wang, Ziyang Zhang, Jingxuan Zhou, Wuquan Yang and Jiali Yao. A Characterization Method for the STSP Based on Frequency Kis
- Yuanyuan Wang and Tianze Wei. Online Fair Allocations with Binary Valuations and Beyond
- Shuai Zhao, Tonan Kamata and Ryuhei Uehara. Research on the Computational Complexity of Walls and Warriors Puzzle
Registration
Registration Form
Please fill out the registration form below to confirm your attendance:[ Google Form: https://forms.gle/VD2ZGnqgL1UTu55w9 ]
Registration Fee
- Regular registration: CNY 1500
- Student registration: CNY 800
Payment Methods
All fees in CNY (Chinese Yuan).- Online Payment (QR code only) Scan the QR code below with Alipay, WeChat Pay or UnionPay. (International credit cards are not accepted for online payment.)
- On-site Payment
ID-110BTGALHXtX
- 1. QR code (same apps as above)
- 2. Cash (CNY only)
- 3. POS machine – accepts Visa, Mastercard, and UnionPay
Notes
- Inclusions: The registration fee covers all lunches, dinners (including the conference banquet), and coffee breaks during the conference.
- Online Payment: After completing your payment, please send your payment proof (e.g., a transaction screenshot) to 1587244705@qq.com with the subject line "AAAC 2026 Registration Fee Payment Proof + Your Full Name".
- On-site Payment: For participants without Chinese payment apps, please pay on-site at the registration desk using Visa, Mastercard, UnionPay cards, or CNY cash.
- Registration & Invoicing: All participants must complete the registration form (link above), regardless of payment method. After payment is confirmed, invoices will be sent from 1587244705@qq.com to the email address provided in the registration form, within one week after the conference ends. Official invoices will be issued by our authorized partner, Qingdao Boxue Zhengshang Education Consulting Management Service Company (青岛博学政商教育咨询管理服务有限公司).
- Support: For any issues, please contact the Organizing Committee at liuwj@ouc.edu.cn.
Venue and Travel
Venue
Academic Conference Center, Ocean University of China (Yushan Campus). (中国海洋大学鱼山校区学术交流中心)Address: No. 8 Hongdao Road, Shinan District, Qingdao, China. (中国青岛市市南区红岛路8号)
Travel Information
1. From Qingdao Jiaodong International Airport (TAO)
Qingdao Jiaodong International Airport (IATA: TAO) is the primary international gateway to the city. The following transportation options are available to reach the venue.-
By Metro (Recommended for Best Value)
-
Route
- Take Line 8 towards Qingdao North Station.
- At Qingdao North Station, transfer to Line 3 towards Qingdao Station.
- Get off at Hall of the People and exit from Exit B.
- Final Leg from Metro
1. It is an approx. 1.3 km (15-minute) walk southwest along Daxue Road and then Hongdao Road.
2. Alternative: For convenience with luggage, you may take a short taxi ride (approx. CNY 10-15) or a local bus from the station to the campus gate. Total Duration: Approx. 100 minutes (Please check the latest metro schedule for operating hours).
Fare: CNY 7. Payment can be made via Alipay, WeChat Pay, or at ticket machines.
-
-
By Taxi / Ride-Hailing (Recommended for Speed & Comfort)
Destination: Show the driver this address: 中国海洋大学鱼山校区学术交流中心 (红岛路8号).
Total Duration: Approx. 50 minutes (subject to traffic conditions).
Estimated Fare: CNY 180 – 220 (includes toll fees). Payment can be made by cash or via the app.
2. From Qingdao Station (青岛站) – Closest to venue
-
By Metro
-
Route
- Take Line 3 towards Qingdao North Station.
- Get off at Hall of the People Station (人民会堂站) after just 1 stop.
- Exit from Exit B.
- Final leg: approx. 1.3 km (15-min walk) southwest along Daxue Road and Hongdao Road, or take a short taxi (CNY 10–15).
Total duration: ~20 minutes (walking) / ~10 minutes (with short taxi)
Metro fare: CNY 2
-
-
By Taxi / Ride-hailing
Destination: 中国海洋大学鱼山校区学术交流中心 (红岛路8号).
Duration: ~10 minutes (approx. 3 km)
Fare: CNY 10–15
Note: Qingdao Station is the most convenient rail hub for the venue. If you have a choice, we recommend arriving at Qingdao Station.
3. From Qingdao North Station (青岛北站)
-
By Metro
-
Route
- Take Line 3 towards Qingdao Station.
- Get off at Hall of the People Station (人民会堂站).
- Exit from Exit B, then walk or take a short taxi as above.
Total duration: ~40 minutes
Metro fare: CNY 5
-
-
By Taxi / Ride-hailing
Destination: 中国海洋大学鱼山校区学术交流中心 (红岛路8号).
Duration: ~25–30 minutes (approx. 15 km)
Fare: CNY 40–55
Tip: If you arrive at Qingdao North Station and prefer comfort/speed, a taxi is a good balance of cost and time.
App Recommendation
We recommend using the DiDi app (Didi Chuxing). Its English interface supports global mobile number login and international credit card payments, which is highly convenient for international visitors.
Accommodation
The conference will be held at the Academic Conference Center. On-site guest rooms are available at the following rates:- Standard Twin Room (Two 1.2m beds): CNY 380 per night, including two breakfasts.
- King Size Room (One 1.8m bed): CNY 450 per night, including two breakfasts.
Important Information
- Booking Deadline: April 24, 2026 (Friday).
- Availability: Rooms are limited and offered on a first-come, first-served basis. Early reservation is highly recommended.