> Top >> Program (this page)
WAAC 2012
July 10-11, 2012
July 10-11, 2012
Program (tentative)
In each presentation, 20 min. for talk, and 5 min. for question/discussion.
Date : 10th July
| 9:40 - 9:45 | Opening |
| 9:45 - 12:00 | Session 1 |
| Yuichi Asahiro, Hiroshi Eto and Eiji Miyano; Improved Inapproximability of Maximum $r$-Regular Induced Connected Subgraph Problems | |
| Masataka Ikeda and Hiroshi Nagamochi; A Method for Computing the Pathwidth of Chemical Graphs | |
| short break (5 min.) | |
| Kunihiro Wasa, Yusaku Kaneta, Takeaki Uno and Hiroki Arimura; Constant Time Enumeration of Bounded-sized Subtrees in Trees Based on Reverse Search | |
| Jinhee Chun, Akiyoshi Shioura, Truong Minh Tien and Takeshi Tokuyama; A Unified View to Greedy Routing Algorithms in Ad Hoc Networks | |
| Aleksandar Shurbevski, Hiroshi Nagamochi and Yoshiyuki Karuno; Improved Approximation Ratio Algorithms for Grasp-and-Delivery Robot Routing Problems | |
| 12:00 - 13:30 | Lunch |
| 13:30 - 14:30 | Invited talk : "Width parameters of digraphs", Hisao Tamaki, Meiji University |
| 15:00 - 17:30 | Session 2 |
| Tomoyuki Yamakami and Yuichi Kato; The Dissecting Power of Regular Languages | |
| Hirohito Sasakawa and Hiroki Arimura; A Bit-Parallel Multi-Resolution Pattern Matching Algorithm for GPS Trajectories | |
| Satoshi Yoshida and Takuya Kida; A Multiplexed Parse Tree for Almost Instantaneous VF Codes | |
| short break (5 min.) | |
| Hee-Kap Ahn, Siu-Wing Cheng, Hyuk Jun Kweon and Juyoung Yon; Overlap of Convex Polytopes under Rigid Motion | |
| Hee-Kap Ahn, Hyo-Sil Kim, Sang-Sub Kim and Wanbin Son; Computing Euclidean 2-centers over Streaming Data | |
| 18:30 - | Banquet |
Date : 11th July
| 9:20 - 12:00 | Session 3 |
| Keisuke Murakami and Takeaki Uno; A Matching Model and an Algorithm for k-Anonymity of Large-Scale Data | |
| Eishi Chiba, Takao Kageyama and Yoshiyuki Karuno; Maximizing the Total Weight Value of Just-In-Time Jobs in Identical Parallel Machines with Periodic Time Slots | |
| Jin Wook Kim, Sunho Lee, Kunsoo Park, Seungjin Na, Eunok Paek, Hyung Seo Park, Heejin Park, Kong-Joo Lee, Jaeho Jeong and Hwa-Young Kim; Monoisotopic Mass Determination Algorithm for Selenocysteine-containing Polypeptides from Mass Spectrometric Data based on Theoretical Modeling of Isotopic Peak Intensity Ratios | |
| short break (5 min.) | |
| Shuhei Denzumi, Hiroki Arimura and Shin-Ichi Minato; A Compact Complete Inverted File Based on Sequence Binary Decision Diagrams | |
| Kyoung-Hwan Lim and Taewhan Kim; On Adjustable Delay Element Allocation Problem in Clock Tree Synthesis of VLSI Systems | |
| 12:00 - 13:30 | Lunch |
| 13:30 - 15:10 | Session 4 |
| Sang Won Bae, Yoshio Okamoto and Chan-Su Shin; Area bounds of rectilinear polygons realized by angle sequences | |
| Matsuo Konagaya and Tetsuo Asano; Algorithm for Reporting All Segment Intersections Using Work Space of Arbitrary Size | |
| Hee-Kap Ahn, Sang Won Bae and Shin-Ichi Tanigawa; Rectilinear Covering for Imprecise Input Points | |
| Yuya Higashikawa, Naoki Katoh and Seok-Hee Hong; Online TSP in a Maximal 1-Plane Geometric Graph | |
| 15:10 - 15:30 | Coffee break |
| 15:30 - 16:45 | Session 5 |
| Chitchanok Chuengsatiansup, Hiroshi Imai and Vorapong Suppakitpaisarn; Evaluating Optimized Computation in Double-Base Chain for Efficient Elliptic Curve Cryptography | |
| Shohei Sakai and Shinji Imahori; An improved method for the Escherization problem | |
| Eishi Chiba, Yusuke Abe, Toshiki Saitoh, Takao Kageyama, Hiroki Koga and Takashi Kobayashi; Maximum-profit rooted not-necessarily-spanning tree problem | |
| 16:45 - 16:50 | Closing |