SATURDAY APRIL 17 DAY TWO Program BLANK
9:00 Conference Opening

9:10

INVITED TALK: Optimal Query Complexity Bounds for Finding Graphs (abstracts) Jeong Han Kim

10:10

Coffee break

SESSION A - LONG TALKS 10:30 - 12:00
10:30 Extended islands of tractability for parsimony haplotyping Rudolf Fleischer, Jiong Guo, Rolf Niedermeier, Johannes Uhlmann, Yihui Wang, Mathias Weller and Xi Wu.
11:00 Tracing a Virus Hee-Kap Ahn, Yoshio Okamoto and Iris Reinbacher
11:30 An Almost Optimal Algorithm for Winkler's Sorting Pairs in Bins Ito Hiro, Junichi Teruyama and Yuichi Yoshida.

12:00

Lunch

SESSION 1A - COMPUTATIONAL GEOMETRY 13:40 - 14:40
13:40 Computing rank-width exactly Sang-il Oum.
14:00 A small Polyhedron with non-Hamiltonian Pulling-Triangulation Cao An Wang.
14:20 Edge Flips in Surface Meshes Siu-Wing Cheng and Jiongxin Jin.

SESSION 1B - IMAGE PROCESSING 13:40 - 14:40
13:40 Algorithms for Domino Portrait Generation Yuko Moriyama and Tomomi Matsui.
14:00 Automatic detection of GGO candidate regions in lung CT image employing neural networks Hyoungseop Kim, Yoshifumi Katsumata, Shinya Maeda, Yoshinori Itai, Joo Kooi Tan and Seiji Ishikawa.
14:20 Improved quantitative analysis of mass spectrometry using quadratic equations Joo Young Yoon, Kyung Young Lim, Sunho Lee, Kunsoo Park, Eunok Paek, Un-Beom Kang, Jeonghun Yeom and Cheolju Lee.

14:40

Short break

SESSION 2A - SCHEDULING 14:45 - 15:45
14:45 The Routing Open Shop: Complexity, Approximation and Relaxation Ilya Chernykh.
15:05 Online Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times Deshi Ye and Guochuan Zhang.
15:25 Online scheduling analysis for concurrent symbolic execution Jie Zhou, Hong Zhu, Xiao Yu and Geguang Pu.

SESSION 2B - GRAPH THEORY 14:45 - 15:45
14:45 Not All Graphs are Pairwise Compatibility Graphs Muhammad Nur Yanhaona, Md. Shamsuzzoha Bayzid and Md. Saidur Rahman.
15:05 Efficient Generation of Symmetric and Asymmetric Biconnected Rooted Outerplanar Graphs Bingbing Zhuang and Hiroshi Nagamochi.
15:25 Computational Experiments on Perfect Sampling of Contingency Tables Ryo Nakatsubo, Shuji Kijima and Tomomi Matsui.

15:45

Coffee break

SESSION 3A - COMBINATORICS 16:00 - 17:00
16:00 Isolated line transversals to convex polytopes Boris Aronov, Otfried Cheong, Xavier Goaoc and Günter Rote.
16:20 Enumerating Non-3-colorable Planar Graphs by the Hajós Calculus Kazuo Iwama, Kazuhisa Seto and Suguru Tamaki.
16:40 Enumeration of Irredundant Primitive Sorting Networks by Decision Diagrams Takashi Horiyama

SESSION 3B - ROBOTICS 16:00 - 17:00
16:00 Pattern Formation by Asynchronous Anonymous Oblivious Mobile Robots Nao Fujinaga, Hirotaka Ono and Masafumi Yamashita
16:20 Circle Formation by Oblivious Robots in Byzantine Environment Samia Souissi, Taisuke Izumi and Koichi Wada.
16:40 Recent Developments in Synchronization Algorithms for Two-Dimensional Cellular Automata - A Survey Hiroshi Umeo.

17:00

Short break

SESSION 4A - ONLINE & STRING ALGORITHMS 17:05 - 18:25
17:05 Online Bin Packing Using (1,1) and (2,R) Bins Jing Chen and Kazuo Iwama.
17:25 Online Graph Exploration Algorithms for Cycles and Trees by Multiple Searchers Yuya Higashikawa, Naoki Katoh, Stefan Langerman and Shin-ichi Tanigawa.
17:45 Finding Optimal Consensus Problems over Hamming Distance Sum and Radius Amihood Amir, Gad M. Landau, Joong Chae Na, Heejin Park, Kunsoo Park and Jeong Seop Sim.
18:05 Algorithmic Aspects of Bijective Tree Encoding: a Survey Saverio Caminiti and Rossella Petreschi.

SESSION 4B - GRAPHS ALGORITHMS 17:05 - 18:05
17:05 An Analysis of Simple Greedy Scheme for Finding Minimum Connected Dominating Set of Unit Disk Graphs Satoshi Fujita.
17:25 Densest k-subgraph approximation on intersection graphs Danny Z. Chen, Rudolf Fleischer and Jian Li.
17:45 Fast Algorithm for the Bandwidth Problem of Bipartite Permutation Graphs Akihiro Nakanishi, Toshiki Saitoh, Masashi Kiyomi and Ryuhei Uehara.
18:05 Drawing Graphs with Large Crossing Angles Seok-Hee Hong

18:30

Dinner