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
First Call for Abstracts	January 2, 2026 (Friday), AoE
Submission Deadline	February 28, 2026 (Saturday), AoE
Notification	March 27, 2026 (Friday), AoE
Camera-ready Deadline	April 10, 2026 (Friday), AoE
Early Registration Deadline	April 24, 2026 (Friday), AoE
Conference Dates	May 23 (Saturday) – 24 (Sunday), 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

Download Full Program (PDF)

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
First Call for Abstracts	January 2, 2026 (Friday), AoE
Submission Deadline	February 28, 2026 (Saturday), AoE
Notification	March 27, 2026 (Friday), AoE
Camera-ready Deadline	April 10, 2026 (Friday), AoE
Early Registration Deadline	April 24, 2026 (Friday), AoE
Conference Dates	May 23 (Saturday) – 24 (Sunday), 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

[1] Agrawal, Shipra, Yiding Feng and Wei Tang. Simple and Robust Quality Disclosure: The Power of Quantile Partition

[2] Brinkop, Hauke, Hua Chen, Lin Chen, Klaus Jansen and Guochuan Zhang. Approximation Algorithms for Integer Programming with Resource Augmentation

[3] Cao, Yixin and Peng Li. Cluster Vertex Deletion on Chordal Graphs

[4] Chen, Lin, Tingwei Hu, Yuchen Mao, Guochuan Zhang, Guangting Chen, Yong Chen, Lili Mei and An Zhang. Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems

[5] Chen, Xujin, Xiaodong Hu, Xinqi Jing and Zhongzheng Tang. When Does Additional Information Lead to Longer Travel Time in Multi-Origin–Destination Networks?

[6] Cheng, Siu-Wing and Zhimeng Gao. Approximate Shortest Journeys in Compact Directed Temporal Graphs

[7] Cheng, Siu-Wing and Xinru Guo. Subset-Constrained Simplification of Trajectory Streams

[8] Eom, Taekang, Jeongwon Moon and Hee-Kap Ahn. Shortcutting the Diameter of Point Sets and Convex Polygons using a Highway

[9] Feng, Yiding, Zonghan Yang and Yuhao Zhang. Competitive Non-Clairvoyant KV-Cache Scheduling for LLM Inference

[10] Gai, Ling, Jiachen Yu and Chenhao Wang. Strategy-Proof Mechanisms for Interval-Obnoxious Facility Location with Two Endpoints on a Line

[11] Hashimoto, Hiromu, Hiroshi Fujiwara and Katsuhisa Ouchi. Improved Approximation Guarantees for the Bin Packing Algorithm MM

[12] Jiang, Shaofeng, Yaonan Jin, Jianing Lou and Pinyan Lu. Local Search for Clustering in Almost-linear Time

[13] Lee, Jaegun, Chaeyoon Chung and Hee-Kap Ahn. Bichromatic Classifications using Strips

[14] Li, Bo, Fangxiao Wang and Shiji Xing. Constant Weighted Maximin Share Approximations for Chores

[15] Li, Hao, Kazuichi Yamazaki, Tonan Kamata and Ryuhei Uehara. Enumeration of Polyabolos Constructible with Tangram and Sei Shonagon Chie no Ita

[16] Li, Shi, Chenyang Xu and Ruilong Zhang. Logarithmic Approximations for Fair k-Set Selection

[17] Lin, Jianan, Chenhao Wang and Fenglin Yi. Bridging Mechanisms for Reducing Eccentricity on the Real Line

[18] Liu, Pengfei, Han Xiao and Qizhi Fang. Matroid Covering Games: The Core and the Nucleolus

[19] Lou, Yunpeng and Junjie Luo. Strategyproof Multi-Resource Allocation for Cloud Computing under Divisible and Indivisible Task Models

[20] Maruyama, Kanata, Naoto Kaneko, Hiroshi Fujiwara and Katsuhisa Ouchi. Enumeration Algorithms for Maximal Matching in Chain Graphs

[21] Park, Eunku and Antoine Vigneron. Coresets for Farthest Point Problems in Hyperbolic Space

[22] Saito, Rin and Yuma Tamura. k-Product Lists for (Generalized) Feedback Vertex Sets: A Tool for Designing FPT Algorithms

[23] Sun, Ankang and Bo Chen. Randomized Strategyproof Mechanisms with Best of Both Worlds Fairness and Efficiency

[24] Tang, Zhihao, Yixin Tao and Shixin Wang. Pricing with a Hidden Sample

[25] Wang, Chenhao, Zekai Wu and Yu Zhou. Fair and Efficient Completion of Chores: An (Almost) Complete Picture

[26] Wang, Yong, Ziyang Zhang, Jingxuan Zhou, Wuquan Yang and Jiali Yao. A Characterization Method for the STSP Based on Frequency Ki’s

[27] Wang, Yuanyuan and Tianze Wei. Online Fair Allocations with Binary Valuations and Beyond

[28] Zhao, Shuai, Tonan Kamata and Ryuhei Uehara. Research on the Computational Complexity of Walls and Warriors Puzzle

Registration

Registration Fee

Regular registration: CNY 1500
Student registration: CNY 800

Room reservation closes on April 24, 2026 (Friday), AoE, in line with the early-bird registration deadline.

Payment Methods

All fees in CNY (Chinese Yuan).

Online Payment (QR code only)

International credit cards are not accepted for online payment

On-site Payment

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.
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.
Payment Reference: When completing your payment, please include "AAAC 2026 + Your Full Name" in the remarks or reference field if applicable.
Support: For any issues regarding registration or payment, please contact the Organizing Committee at liuwj@ouc.edu.cn.
Invoice/Receipt: Official registration fee invoices will be issued by our authorized partner, Qingdao Boxue Zhengshang Education Consulting Management Service Company (青岛博学政商教育咨询管理服务有限公司).

Registration Form

After completing your payment (or if you plan to pay on-site), please fill out the registration form below to confirm your attendance: [Google Form: https://forms.gle/VD2ZGnqgL1UTu55w9]

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

Qingdao Jiaodong International Airport (IATA: TAO) is the primary international gateway to the city. The following transportation options are available to reach the venue.

Transportation Guide to the Venue

By Metro (Qingdao 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
- Total Duration: Approx. 110 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.

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.

Travel Flow

Below is a brief itinerary flowchart for the journey from Qingdao Jiaodong International Airport (TAO) to the destination.

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): 380 CNY per night, including two breakfasts.
King Size Room (One 1.8m bed): 450 CNY 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.

Contact

For any inquiries or assistance, please contact the Organizing Committee at liuwj@ouc.edu.cn.