{"id":125,"date":"2015-11-18T02:09:19","date_gmt":"2015-11-18T02:09:19","guid":{"rendered":"http:\/\/acolab.ie.nthu.edu.tw\/aaac2016\/?page_id=125"},"modified":"2018-10-19T14:58:45","modified_gmt":"2018-10-19T06:58:45","slug":"program","status":"publish","type":"page","link":"https:\/\/aaac2016.ee.ntu.edu.tw\/index.php\/program\/","title":{"rendered":"PROGRAM"},"content":{"rendered":"
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0Saturday, May 14, 2016<\/strong><\/h5>\n\n\n\n\n\n\n
15:00 – 16:00<\/td>\nRegistration<\/td>\n<\/tr>\n
16:00 – 17:30<\/td>\nTutorial Talk
\nDr. Ke Yi: Random Sampling in Database Systems: Techniques and Applications<\/em><\/td>\n<\/tr>\n
17:30 – 18:00<\/td>\nBreak<\/td>\n<\/tr>\n
18:00 – 20:00<\/td>\nWelcome Reception
\n(14F, Howard Civil Service International House<\/a>)<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

 <\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0Sunday, May 15, 2016<\/strong><\/h5>\n\n\n\n\n\n\n\n\n\n\n\n\n
08:30 – 08:55<\/td>\nRegistration<\/td>\n<\/tr>\n
08:55 – 09:00<\/td>\nConference Opening<\/td>\n<\/tr>\n
09:00 – 10:00<\/td>\nKeynote Speech
\nChair: Kazuo Iwama
\nDr. Fan Chung: Higher Cheeger Inequalities and Clustering Algorithms<\/em><\/td>\n<\/tr>\n
10:00 – 10:20<\/td>\nCoffee\/Tea Break<\/td>\n<\/tr>\n
10:20 – 11:50<\/td>\nLong Talk Session L1 | Long Talk Session L2
\nChair: Hsu-Chun Yen | Chair: Hee-Kap Ahn\n<\/td>\n<\/tr>\n
12:00 – 13:20<\/td>\nLunch<\/td>\n<\/tr>\n
13:20 – 15:20<\/td>\nSession A1 Computational Geometry | Session B1 Graph Algorithms
\nChair: San Won Bae | Chair: Minming Li\n<\/td>\n<\/tr>\n
15:20 – 15:40<\/td>\nCoffee\/Tea Break<\/td>\n<\/tr>\n
15:40 – 17:40<\/td>\nSession A2 Approximation Algorithms | Session B2 Experimental Algorithms
\nChair: Louxin Zhang | Chair: Takehiro Ito\n<\/td>\n<\/tr>\n
18:30 – 21:00<\/td>\nConference Banquet
\n(Shin Yeh Taiwanese Cuisine Shuangcheng Restaurant.<\/a>)<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

 <\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0Monday, May 16, 2016<\/strong><\/h5>\n\n\n\n\n\n\n\n\n\n\n
08:50 – 09:50<\/td>\nKeynote Speech
\nChair: DT Lee
\nDr. Dorothea Wagner: Route Planning Algorithms \u2013 New Results and Challenges<\/em><\/td>\n<\/tr>\n
09:50 – 10:10<\/td>\nCoffee\/Tea Break<\/td>\n<\/tr>\n
10:10 – 11:10<\/td>\nLong Talk Session L3 | Long Talk Session L4
\nChair: Xin Han | Chair: Ho-Lin Chen\n<\/td>\n<\/tr>\n
11:10 – 12:10<\/td>\nSession A3 Fixed Parameter Algorithms | Session B3 Auction, Anonymization, and Cryptography
\nChair: Xin Han | Chair: Ho-Lin Chen\n<\/td>\n<\/tr>\n
12:10 – 13:30<\/td>\nLunch<\/td>\n<\/tr>\n
13:30 – 15:00<\/td>\nTutorial Talk
\nDr. Kai-Min Chung: Toward Cryptography for Modern Parallel Architecture<\/em><\/td>\n<\/tr>\n
15:00 – 15:10<\/td>\nConference Closing & Best Presentation Award Ceremony
\nChair: Siu-Wing Cheng\n<\/td>\n<\/tr>\n
15:10 – 18:00<\/td>\nShort City Tour<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

 <\/p>\n

Long Talk Session L1<\/strong><\/h6>\n
    \n
  • \n
    Tetsuo Asano, Hirotaka Ono and Masafumi Yamashita. How Much Work Space Do We Need to Find a Closest Element in an Array in Sublinear Time?<\/h6>\n<\/li>\n
  • \n
    Siu-Wing Cheng, Juyoung Yon, Sang Won Bae, Otfried Cheong and Bryan T. Wilkinson. Approximating Convex Shapes with respect to Symmetric Difference under Homotheties<\/h6>\n<\/li>\n
  • \n
    Eunjin Oh, Sang Won Bae and Hee-Kap Ahn. Computing a Geodesic Two-Center of Points in a Simple Polygon<\/h6>\n<\/li>\n<\/ul>\n
    Long Talk Session L2<\/strong><\/h6>\n
      \n
    • \n
      Yuichi Asahiro, Yuya Doi, Eiji Miyano and Hirotaka Shimizu. Approximation Algorithms to Find Maximum Distance-Bounded Subgraphs<\/h6>\n<\/li>\n
    • \n
      Louxin Zhang. The Tree and Cluster Containment Problems in Phylogenetics<\/h6>\n<\/li>\n
    • \n
      Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Chia-Wei Lee and Peter Rossmanith. Fixed-parameter Algorithms for a Class of Generalized Vetex Cover Problems<\/h6>\n<\/li>\n<\/ul>\n
      Long Talk Session L3<\/strong><\/h6>\n
        \n
      • \n
        Chih-Kuan Yeh, Te-Li Wang and Ho-Lin Chen. An Improved Tax Scheme for Selfish Routing<\/h6>\n<\/li>\n
      • \n
        Shengyu Zhang. A survey on logrank conjecture on communication complexity of composed functions<\/h6>\n<\/li>\n<\/ul>\n
        Long Talk Session L4<\/strong><\/h6>\n
          \n<\/li>\n
        • \n
          Fu-Hong Liu, Hsiang-Hsuan Liu and Prudence W.H. Wong. Optimal Nonpreemptive Scheduling in Smart Grid<\/h6>\n<\/li>\n
        • \n
          Sho Toyooka and Kunihiko Sadakane. Estimating L0 norm in non-strict turnstile stream<\/h6>\n<\/li>\n<\/ul>\n
          Session A1 Computational Geometry<\/strong><\/h6>\n
            \n
          • \n
            Eunjin Oh, Luis Barba and Hee-Kap Ahn. An Improved Algorithm for Computing the Farthest-point Geodesic Voronoi Diagram<\/h6>\n<\/li>\n
          • \n
            Sang Won Bae, Ji-Won Park and Sang Duk Yoon. Nearest Beacon Covering of Rectilinear Polygons<\/h6>\n<\/li>\n
          • \n
            Prosenjit Bose, Jean-Lou De Carufel and Andr\u00e9 van Renssen. Constrained Generalized Delaunay Graphs Are Plane Spanners<\/h6>\n<\/li>\n
          • \n
            Tsunehiko Nagayama and Kunihiko Sadakane. Faster Max-flow Algorithms using SPQR-trees<\/h6>\n<\/li>\n
          • \n
            Atsushi Koike. A Tree-based Labeling Algorithm for Shortest Path Queries in Road Networks<\/h6>\n<\/li>\n
          • \n
            Ferran Roure, Xavier Llad\u00f3, Joaquim Salvi and Yago D\u00edez. Range Searching Data Structures for point Cloud Matching<\/h6>\n
            Session B1 Graph Algorithms<\/strong><\/h6>\n<\/li>\n
          • \n
            Hiroshi Eto, Zhilong Liu and Eiji Miyano. Simple approximation algorithms for the distance-3 independent set problem on cubic graphs<\/h6>\n<\/li>\n
          • \n
            Haruka Mizuta, Takehiro Ito and Xiao Zhou. Reachability between Steiner Trees in a Graph<\/h6>\n<\/li>\n
          • \n
            Boting Yang. Fast-Mixed Searching and Related Problems on Graphs<\/h6>\n<\/li>\n
          • \n
            Shuhei Denzumi. Finding Approximate Median Strings Using Directed Acyclic Graphs<\/h6>\n<\/li>\n
          • \n
            Wei-Lin Wang and Sheung-Hung Poon. On Complexity of Total Vertex Cover on Subcubic Graphs<\/h6>\n<\/li>\n
          • \n
            Hsuan-Wei Wang, Wen-Yen Lin and Pao-Lien Lai. A construction of independent spanning trees in hierarchical crossed cubes<\/h6>\n<\/li>\n<\/ul>\n
            Session A2 Approximation Algorithms<\/strong><\/h6>\n
              \n
            • \n
              Yuko Kuroki and Tomomi Matsui. Approximation Algorithms for Hub Location Problems<\/h6>\n<\/li>\n
            • \n
              Kai Wang, Hong-Jyun Wang and Ho-Lin Chen. Routing Games with Priorities<\/h6>\n<\/li>\n
            • \n
              Yi-Hua Yang and Chung-Shou Liao. Online Buffer Management for Packets with Constant Density<\/h6>\n<\/li>\n
            • \n
              Xiao Zhang. Barrier Coverage by Wireless Sensors<\/h6>\n<\/li>\n
            • \n
              I-Hsuan Wu and Chung-Shou Liao. Online Dynamic Power Management<\/h6>\n<\/li>\n
            • \n
              Ren-Ce Luo, Mong-Jen Kao and Der-Tsai Lee. Multi-Core Coherent Speed Scaling to Minimize Energy Consumption<\/h6>\n<\/li>\n<\/ul>\n
              Session B2 Experimental Algorithms<\/strong><\/h6>\n
                \n
              • \n
                Shao-Chieh Lin and Chung-Shou Liao. Fast Route Planning with Geographical Information<\/h6>\n<\/li>\n
              • \n
                Jean-Fran\u00e7ois Baffier, Yago Diez Donoso and Matias Korman. Implementation of Stack Structure with Limited Memory<\/h6>\n<\/li>\n
              • \n
                Nuwan Ganganath, Chi-Tsun Cheng and Chi K. Tse. Yet Another Path Replanner<\/h6>\n<\/li>\n
              • \n
                Jheng-Nan Huang, Tzung-Pei Hong and Ming-Chao Chiang. An Effective Method for Approximate Representation of Frequent Itemsets<\/h6>\n<\/li>\n
              • \n
                Yi-Chun Yao and Cheng-Hung Wu. Dynamic Production Scheduling of Inequivalent Machines with Real-Time Machine Health Information<\/h6>\n<\/li>\n
              • \n
                Wen-Yu Chung, Chun-Wei Liang and Hong-Wei Huang. Feature extraction and selection in image retrieval<\/h6>\n<\/li>\n<\/ul>\n
                Session A3 Fixed Parameter Algorithms<\/strong><\/h6>\n
                  \n
                • \n
                  Mohd Shahrizan Bin Othman, Aleksandar Shurbevski and Hiroshi Nagamochi. Exact Algorithms for the Bipartite Traveling Salesman Problem<\/h6>\n<\/li>\n
                • \n
                  Norhazwani Md Yunos, Aleksandar Shurbevski and Hiroshi Nagamochi. A Polynomial-space Exact Algorithm for the TSP in Degree-7 Graphs<\/h6>\n<\/li>\n
                • \n
                  Tesshu Hanaka and Hirotaka Ono. Maximum Weighted Minimal Vertex Separator<\/h6>\n<\/li>\n<\/ul>\n
                  Session B3 Auction, Anonymization, and Cryptography<\/strong><\/h6>\n
                    \n
                  • \n
                    Jun Takita, Yasushi Kawase and Tomomi Matsui. Auction Algorithm for Weighted Matroid Partitioning Problem<\/h6>\n<\/li>\n
                  • \n
                    Fu-Hong Liu and Hsiang-Hsuan Liu. Bipartite Degree Anonymization by Edge Addition<\/h6>\n<\/li>\n
                  • \n
                    Yu-Chi Chen, Sherman S. M. Chow, Kai-Min Chung, Russell W. F. Lai, Wei-Kai Lin and Hong-Sheng Zhou. Cryptography for Parallel RAM from Indistinguishability Obfuscation<\/h6>\n<\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"

                    \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0Saturday, May 14, 2016 15:00 – 16:00 Registration 16:00 – 17:30 Tutorial Talk Dr. Ke Yi: Random Sampling in Database Systems: Techniques and Applications 17:30 – 18:00 Break 18:00 – 20:00 Welcome Reception (14F, Howard Civil Service International House)   \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0Sunday, May 15, 2016 08:30 – 08:55 Registration 08:55 – 09:00 Conference Opening 09:00 – […]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":[],"_links":{"self":[{"href":"https:\/\/aaac2016.ee.ntu.edu.tw\/index.php\/wp-json\/wp\/v2\/pages\/125"}],"collection":[{"href":"https:\/\/aaac2016.ee.ntu.edu.tw\/index.php\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/aaac2016.ee.ntu.edu.tw\/index.php\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/aaac2016.ee.ntu.edu.tw\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/aaac2016.ee.ntu.edu.tw\/index.php\/wp-json\/wp\/v2\/comments?post=125"}],"version-history":[{"count":107,"href":"https:\/\/aaac2016.ee.ntu.edu.tw\/index.php\/wp-json\/wp\/v2\/pages\/125\/revisions"}],"predecessor-version":[{"id":595,"href":"https:\/\/aaac2016.ee.ntu.edu.tw\/index.php\/wp-json\/wp\/v2\/pages\/125\/revisions\/595"}],"wp:attachment":[{"href":"https:\/\/aaac2016.ee.ntu.edu.tw\/index.php\/wp-json\/wp\/v2\/media?parent=125"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}