AAAC 2025: Call for Papers

The 16th Annual Meeting of the Asian Association for Algorithms and Computation (AAAC 2025) will take place on May 31 and June 1, 2025, at the City University of Hong Kong, Hong Kong, China.

This meeting is a face-to-face event, and at least one author of each submission is expected to register and give the talk at the venue.

Topics

All areas of theoretical computer science are welcome, with a special emphasis on design and analysis of algorithms and complexity theory.

Submissions

Authors are invited to submit one-page (A4) abstracts in PDF format. These abstracts can be based on original results or surveys of existing results.

Informal working notes, including the one-page abstracts, will be distributed at the meeting. This distribution does not prevent future publication of the same work in any form.

All submissions must be made electronically through the EasyChair Conference System: https://easychair.org/conferences?conf=aaac2025.

Important Dates

• Submission Due: February 28, 2025 (AoE)
• Notification: March 28, 2025
• Camera-ready Version Due: April 18, 2025
• Early Registration Due: April 25, 2025
• Conference Dates: May 31 - June 1, 2025

Best Student Presentation Award

The Best Student Presentation Award will be presented to a full-time student author who presents their paper at the meeting. The award will be selected by AAAC board members during the conference.

Registration

• Normal Registration: 1800 HKD
• Student Registration: 900 HKD
• Early Bird Registration Deadline: April 25, 2025
• Registration Link: https://www.hkws.org/registration/aaac2025/reg.html

Program Committees

• Hee-Kap Ahn (Pohang University of Science and Technology (POSTECH))
• Sang Won Bae (Kyonggi University)
• Ho-Lin Chen (National Taiwan University)
• Siu-Wing Cheng (The Hong Kong University of Science and Technology, Chair)
• Minming Li (City University of Hong Kong)
• Chung-Shou Liao (National Tsing Hua 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)
• Takeshi Tokuyama (Tohoku University)
• Ryuhei Uehara (Japan Advanced Institute of Science and Technology (JAIST))
• Guochuan Zhang (Zhejiang University)
• Shengyu Zhang (The Chinese University of Hong Kong)

Accepted Papers

• Instance Optimality in Differential Privacy
• On the Efficiency of Fair and Truthful Trade Mechanisms
• Dynamic Maximum Depth of Geometric Objects
• Confusion Matrix Design for Downstream Decision-making
• Long Arithmetic Progressions in Sumsets and Subset Sums: Constructive Proofs and Efficient Witnesses
• Crossing Minimization in Ortho-Radial Drawings of Column Trees
• Constant Approximation of Fréchet Distance in Strongly Subquadratic Time
• Near-unit Distance Embedding of Points in the Plane and Space
• Simplification of Trajectory Streams
• Shortcutting the Diameter of a Polygon
• Complexity of Reconfiguring Vertex-Disjoint Shortest Paths
• Online Exploration of Grid Graphs with Multiple Searchers
• Space-efficient Representations for a Set of k-mers
• Private-Preserving Encoding and Decoding Using Variable-Length Coding Schemes
• Mechanism Design for Locating a Bridge Between Regions with Prelocated Facilities
• Space-Efficient Data Structure for (k...21)-avoiding Involutions
• Learning-Augmented Algorithms for Online Time-Window TSP
• Yavalath is PSPACE-Complete
• Learning-augmented Algorithms for Density Peaks Clustering
• Guarding Terrains with Guards on a Line
• Protecting the Connectivity of a Graph Under Non-Uniform Edge Failures
• Improved Algorithms for Finding the Smallest Color-Spanning Two Squares
• The Public University Secretary Problem with Predictions
• Fair Allocation of Items in Multiple Regions
• On the Subsidy of Envy-Free Orientations in Graphs.
• Topological Features for Graph Representations
• Interdiction Game on Machine Scheduling under Budgeted Unavailability Patterns
• Monotone Partitions of Simple Polygons