Conference venue: Aki Grand Hotel
Address: Miyajimaguchi-nishi 1-1-17, Hatsukaichi-city, Hiroshima Pref.
Phone: +81-829560111
Email: info [at] akigh.co.jp


Registration

15:30-17:30, 8 May, 2015

May 9

9:00-9:15Opening
9:15-10:15Invited Talk by Prof. Pierre Fraigniaud
10:15-10:30Break
10:30-12:00Session L1 (3)
12:00-13:30Lunch
13:30-15:00Session L2 (3)
15:00-15:15Break
15:15-17:35 Session A (7) Session B (6)
18:30-20:30Dinner

May 10

8:30-9:30Invited Talk by Prof. Siu-Wing Cheng
9:30-9:45Break
9:45-11:45Session L3 (4)


Invited Talks

  • Prof. Pierre Fraigniaud. Locality in Distributed Network Computing
  • Prof. Siu-Wing Cheng. Approximate Shortest Paths in Weighted Regions

Session L1

  1. Hee-Kap Ahn, Luis Barba, Prosenjit Bose, Jean Lou de Carufel, Matias Korman and Eunjin Oh. A linear-time algorithm for the geodesic center of a simple polygon
  2. Kazuo Iwama and Sho Tanaka. Non-Nash Equilibria in Undirected PageRank Games
  3. Jin-Yong Lin, Ching-Hao Liu and Sheung-Hung Poon. Algorithmic aspect of minus domination on small-degree graphs

Session L2

  1. Shun Fukuda, Akiyoshi Shioura and Takeshi Tokuyama. Unit-Cost Buyback Problem with Matching Weight Function
  2. Zhewei Wei and Ke Yi. The Space Complexity of 2-Dimensional Approximate Range Counting
  3. Sang Duk Yoon, Min-Gyu Kim and Hee-Kap Ahn. Realistic Terrain Matching

Session L3

  1. Yi-Jun Chang and Hsu-Chun Yen. Area-universal Drawings of Biconnected Outerplane Graphs
  2. Tomoko Izumi, Sayaka Kamei and Yukiko Yamauchi. Set Cover Formation Algorithms by Mobile Robots
  3. Hiroshi Fujiwara, Takuya Nakamura and Toshihiro Fujito. An Algorithm for the Huffman Tree Problem with Unit Step Functions
  4. Shuhei Denzumi. String Set Operations on Sequence Binary Decision Diagrams

Session A

  1. Dawei Xu, Takashi Horiyama, Ryuhei Uehara and Toshihiro Shirakawa. Common Unfolding of Three Different Boxes of Surface Area 30
  2. Toshihiro Akagi, Ryota Arai and Shin-Ichi Nakano. Faster min-max r-gatherings
  3. Sayaka Kamei, Anissa Lamani and Fukuhito Ooshita. Ring Gathering by Robots with Limited Vision
  4. Toru Fujita, Koji Nakano and Yasuaki Ito. Bulk GCD Computation for Breaking Weak RSA Keys using a GPU
  5. Naoyuki Matsumoto, Koji Nakano and Yasuaki Ito. Optimal K-Sorter and TopK-Sorter using FPGAs
  6. Shunichi Matsubara. An Algorithm for Finding Polynomial-Size Positive Integers Specified by the Frobenius Number
  7. Zhenbo Wang, Xin Han, Gyorgy Dosa and Zsolt Tuza. Bin Packing Game with an Interest Matrix

Session B

  1. Chun-Hsiang Lin and Chung-Shou Liao. The Online Traveling Salesman Problem Revisited
  2. Yuya Higashikawa, Siu-Wing Cheng, Tsunehiko Kameda, Naoki Katoh and Shun Saburi. Minimax Regret 1-Median Problem in Dynamic Path Networks
  3. Tsunehiko Nagayama and Kunihiko Sadakane. Max Flow Indexing Problem on Series-Parallel Networks
  4. Yosuke Yano. Detecting k-clique communities for all k
  5. Dongwoo Park, Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Chan-Su Shin, Judit Abardia and Susanna Dann. Minimum Convex Container of Two Convex Polytopes under Translations
  6. Sang-Sub Kim and Hee-Kap Ahn. Computing L_1 one center over streaming data

20 min for regular presentation, 30 min for long presentation (including Q&A).