WAAC08 :: The 11th Japan-Korea Joint Workshop on Algorithms and Computation 

Program 

Saturday, July 19

== Opening (12:50 --)

== Session 1 (13:00 -- 14:20, 4 talks)  (Session Chair: Joong Chae Na)

 - Vorapong Suppakitpaisarn and Masato Edahiro. The Novel
   Representation for Redundant Complex Number Arithmetic : Extended
   Octagonal Representation

 - Sangjun Lee and Yongsurk Lee. Study of a Low-power Error
   Correction Circuit for Image Processing

 - Hosung Jo and Heejin Park. Analysis and Optimization of the
   Combined Primality Test Using GCD Operation and Miller-Rabin test

 - Norie Fu and Hiroshi Imai. Shiftability of Atoms on a Lattice to
   Any Configuration in Minimum Moves


== Session 2 (14:35 -- 15:55, 4 talks) (Session Chair: Hee-Kap Ahn)

 - Liang Zhao, Tatsuya Ohshima and Hiroshi Nagamochi. A* algorithm for
   the time-dependent shortest path problem

 - Celso Satoshi Sakuraba and Mutsunori Yagiura. A Local Search
   Algorithm Efficient for Sparse Instances of the Linear Ordering
   Problem

 - Joong Chae Na, Namhee Kim, Jeong Seop Sim and Dong Kyue Kim.
   Randomized Linear-Time On-line Construction of Two-Dimensional
   Suffix Trees

 - Hideki Hashimoto, Hirotaka Ono, Takeaki Uno, Hideko Urushihara and
   Mutsunori Yagiura. Neighborhood hashing for enumerating all
   frequent patterns allowing errors


== Invited Talk (16:10 -- 17:10)    (Session Chair: Satoshi Fujita)

   Professor Howon Kim, PUSAN National University, KOREA
   "Pairing-Based Cryptography and Its Applications to Sensor Networks"

== Banquet (17:30 -- )   



== Session 3 (9:00 -- 10:00, 3 talks)   (Session Chair: Yoshio Okamoto)

 - Hiroshi Umeo.  Recent Advances in the Design of Optimum-Time
   Synchronization Algorithms for Two-Dimensional Cellular Automata
   - A Survey -

 - Kazuya Haraguchi, Yuuta Hiraoka and Akira Maruoka. How to
   Construct Solvable Instances for BlockSum Puzzle

 - Jae-Hoon Kim. Estimating the Price of Anarchy Using Load Balancing
   Measure

== Session 4 (10:20 -- 11:40, 4 talks)  (Session Chair: Liang Zhao)

 - Naoyuki Kamiyama and Naoki Katoh. Covering Directed Graphs by
   In-trees

 - Sang Won Bae and Chunseok Lee. On Exact Computation of Euclidean
   Bottleneck Steiner Trees

 - Peng Cheng and Shigeru Masuyama. Counting Connected Spanning
   Subgraphs with at Most $n+1$ Edges in Special $n$-Vertex Graphs

 - Satoshi Kawamoto, Hitoshi Yamasaki and Takayoshi Shoudai. A linear
   time isomorphism algorithm for circular-arc graphs with connected
   domination number greater than 3


== Session 5 (13:30 -- 14:50, 4 talks)  (Session Chair: Kunihiko Sadakane)

 - Sunho Lee and Kunsoo Park. Dynamic Compressed Representation of
   Texts with Rank/Select

 - Jinhee Chun, Matias Korman, Martin Nollenburg and Takeshi
   Tokuyama. Finding the maximum union of closures is NP-hard, even
   for trees

 - Miki Miyauchi and Gisaku Nakamura. Stack Queue Mixed Layout of
   Graph Subdivisions

 - Sang Won Bae and Matias Korman. All Farthest-Neighbors under
   the City Metric

   
== Session 6 (15:05 -- 16:25, 4 talks)  (Session Chair: Kazuya Haraguchi)

 - Sang Won Bae and Kyung-Yong Chwa. Farthest Voronoi Diagrams in the
   Presence of Obstacles

 - Yusuke Abe and Yoshio Okamoto. On Algorithmic Enumeration of
   Higher-Order Delaunay Triangulations

 - Takashi Imamichi and Hiroshi Nagamochi. A Fast Collision Detection
   Algorithm for a Multi-sphere Scheme

 - Hee-Kap Ahn, Siu-Wing Cheng and Iris Reinbacher. Maximum Overlap
   of Convex Polytopes under Translation

== Closing  (16:25 --)