Zhejiang University
The 7nd Annual Meeting of
Asian Association for Algorithms and Computation
-- AAAC 2014 --

May 17-19, 2014
Hangzhou, China



AAAC 2014

Important Dates

Keynote Speakers

Program Committee

Call for Papers

Paper Submission

Accepted Papers



Venue & Travel(NEW)


Visa Requirment

Organize Committee

Previous Event

  • AAAC 2013 Matsushima
  • AAAC 2012 Shanghai
  • AAAC 2011 HsinChu
  • AAAC 2010 Pohang
  • AAAC 2009 Hangzhou
  • AAAC 2008 Hongkong

    AAAC 2014 Program download pdf file

    Confererence Venue
      Moses W. Li Building,
      Zijingang Campus,
      Zhejiang University,
      886 Yuhangtang Road, Xihu District, Hangzhou
      (A map from the hotel to the conference venue is in travel page.)

    Registration Hours
    3:30pm - 05:30pm, 16 May, 2014
    Registration desk is at the lobby of Zijingang International Hotel.
    On 17 May, there is also on-site registration from 8:30am at Room 318, Moses W. Li Building.

    Specific Venue
    Room 318: Invited Talks; Session L1 & L2; Session A1 & A2
    Xixi Hall(1st floor): Session B1 & B2

    May 17




    Invited Talk:Sanjeev Arora, Aditya Bhaskara, Rong Ge, Tengyu Ma,Provable bounds for learning some deep nets


    Group photo & Break


    Session L1




    Session A1

    Session B1




    Session A2

    Session B2



    May 18 Morning


    Invited Talk:Francis Chin, Why Genome Assembly so Difficult?




    Session L2



    Closing Notes

    May 18 Afternoon & May 19

    13:30- May 19

    The tour to Yellow Mountain(The cost is excluded in the Registration fee.)

    Session L1

    1. Kazuo Iwama and Atsuki Nagao. Read-Once Branching Programs for Tree Evaluation Problems
    2. Siu-Wing Cheng and Man Kwun Chiu. Implicit Manifold Reconstruction
    3. Sang-Sub Kim and Hee-Kap Ahn. An Improved Data Stream Algorithm for Clustering
    4. Pinyan Lu, Menghui Wang and Chihao Zhang. FPTAS for Weighted Fibonacci Gates and Its Applications
    Session L2
    1. Takahiro Ueda and Hiro Ito. Algorithms for Sublinear-Time Assignment for the Cake Cutting Problem
    2. Yixin Cao. Linear Recognition of Almost (Unit) Interval Graphs
    3. Luis Barba, Jean-Lou De Carufel, Otfried Cheong, Michael Dobbins, Rudolf Fleischer, Akitoshi Kawamura, Matias Korman, Yoshio Okamoto, Janos Pach, Yuan Tang, Takeshi Tokuyama, Sander Verdonschot and Tianhao Wang. Geometric Weight Balancing in 3D
    4. Yijia Chen and Moritz Mueller. Bounded variable logic, parameterized logarithmic space, and Savitch's theorem
    Session A1
    1. Tesshu Hanaka and Hirotaka Ono. A Fixed Parameter Algorithm for Max Edge Dominaton
    2. Zengfeng Huang and Ke Yi. The Communication Complexity of Distributed epsilon-Approximations
    3. Takayuki Sakai, Kazuhisa Seto and Suguru Tamaki. Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction
    4. Ryo Ashida. Comparison between Permanent and Determinant on Arithmetic Circuit
    5. Jinhee Chun, Natsuda Kaothanthong and Takeshi Tokuyama. Shape Retrieval using Local Distance Interior Ratio Shape Descriptor
    6. Takashi Horiyama and Shogo Yamane. Enumeration of Polyominoes for p4 Isohedral Tiling Revisited
    Session B1
    1. Xujin Chen, Xiaodong Hu and Changjun Wang. An $O(n^{2/5})$-Approximation for Densest Connected $k$-Subgraphs
    2. Mao-Cheng Cai. A Characterization for a forcible version of Niessen's problem on degree sequences of graphs
    3. Yuichi Asahiro, Hiroshi Eto, Eiji Miyano and Takehiro Ito. Maximum r-Regular Induced Subgraph Problems for Chordal Bipartite Graphs
    4. Dariusz Dereniowski, Danny Dyer, Ryan Tifenbach and Boting Yang. Zero-Visibility Cops-and-Robber Game and the Pathwidth of a Graph
    5. Antoine Vigneron and Lie Yan. A Faster Algorithm for Computing Motorcycle Graphs
    6. Xian Qiu and Walter Kern. Improved Approximation Algorithms for a Bilevel Knapsack Problem
    Session A2
    1. Dachuan Xu, Fengmin Wang, Donglei Du and Chenchen Wu. Primal-dual approximation algorithms for submodular vertex cover problems with linear/submodular penalties
    2. Di Chen, Christian Konrad, Ke Yi, Wei Yu and Qin Zhang. Robust Set Reconciliation
    3. Chenchen Wu, Dachuan Xu, Donglei Du and Wenqing Xu. A complex semidefinite programming rounding approximation algorithm for the balanced Max-$3$-Uncut problem
    4. Matias Korman, Stefan Langerman, Wolfgang Mulzer, Alexander Pilz and Birgit Vogtenhuber. Minimum Dual Diameter Triangulations
    5. Wei Yu, Zhaohui Liu and Xiaoguang Bao. Optimal Algorithms for Some Variants of Online Quota Traveling Salesman Problem
    Session B2
    1. Jing Chen, He Guo, Xin Han and Kazuo Iwama. The Train Delivery Problem Revisited
    2. Linus Hermansson. How More Data Can Speed-up the Running Time in Machine Learning Like Games
    3. Ilya Chernykh. On the Two-Machine Routing Open Shop on a Tree
    4. Lin Chen, Deshi Ye and Guochuan Zhang. An improved lower bound for rank four scheduling
    5. Ling Gai and Guochuan Zhang. Optimal algorithms for online lazy bureaucrat scheduling with machine deadline

      Since Aug. 28, 2008.