| AAIM 2006 Program Schedule |
| |
| 19 June, 2006, Mon. |
| Reception & Registration 5:30pm-
7:00pm City Top |
| |
| |
|
|
| 20 June, 2006, Tue. |
| 8:45am-9:00am
LT
4 |
Welcome
and Opening Address |
| Frances
Yao |
| 9:00am-10:00am
LT
4
|
Session 1 -- Invited Talk I |
| Session Chair: Francis Chin |
| Further reflections on a theory for
basic algorithms |
| Allan
Borodin |
| Tea Break 10:00am-10:30am |
| 10:30am-11:50am
LT
4
|
Session 2 -- Online Scheduling
|
| Session Chair: Jiri Sgall
|
| Online scheduling on parallel machines
with two GoS levels |
| Yiwei Jiang |
| Online dial-a-ride problem with time-windows
under a restricted information model |
| Fanglei Yi, Yinfeng Xu,
Chunlin Xin |
| Online scheduling with hard deadlines
on parallel machines |
| Jihuan Ding and Guochuan Zhang |
| Maximizing the throughput of multiple
machines on-line |
| Jae-Hoon Kim |
| Lunch 11:50am-2:00pm City Top Restaurant |
| 2:00pm-
3:20pm
LT
4
|
Session 3 -- Game & Finance I
|
| Session Chair: Marek
Chrobak |
| Lattice embedding of direction-preserving
correspondence over integrally convex set |
| Xi
Chen and Xiaotie Deng |
| Linear programming polytope and algorithm for mean payoff games |
| Ola
Svensson and Sergei Vorobyov |
| Atomic routing games on maximum congestion |
| Costas Busch and Malik Magdon-Ismail |
| Equilibrium distribution of advertising
prices |
| Qianqin Chen and Wei-Guo Zhang |
| Tea Break 3:20pm- 3:50pm |
| 3:50pm-
5:10pm
LT
4
|
Session 4 -- Data Structures &
Algorithms |
| Session Chair: Mordecai Golin |
| Finding faithful Boyce-Codd normal form decomposition |
| Henning
Koehler |
| A compression-boosting transform
for two-dimensional data |
| Qiaofeng Yang, Stefano Lonardi and Avraham Melkman |
| Non-metric multicommodity
and multilevel facility location |
| Rudolf
Fleischer, Jian Li, Shijun
Tian and Hong Zhu |
| Instant service policy and its application
to deficit round robin |
| Jinoo Joung, Dongha
Shin, Feifei Feng
and Hongkyu Jeong |
21 June, 2006, Wed. |
| 9:00am-10:00am
LT
4
|
Session 5 -- Invited Talk II |
| Session Chair : Tak-Wah Lam |
| Algorithmic DNA self-assembly |
| Ming-Yang
Kao |
| Tea Break 10:00am-10:30am |
| 10:30am-11:50am
LT
4
|
Session 6 -- Computational Geometry
|
| Session Chair: Binhai
Zhu |
| Sublinear time width-bounded separators and their application to the protein side-chain
packing problem |
| Bin
Fu, Zhixiang Chen |
| Polygon curve approximation using
grid points with application to a triangular mesh generation
with small number of different edge lengths |
| Shin-ichi Tanigawa and Naoki Katoh |
| Distributions of points and large
convex hulls of k points |
| Hanno
Lefmann |
| Throwing stones in simple polygons |
| Otfried Cheong, Hazel Everett, Hyo-Sil
Kim, Sylvain Lazard and Rene
Schott |
| Lunch 11:50am-2:00pm City Express |
| 2:00pm-
3:20pm
LT
4
|
Session 7 – Optimization |
| Session Chair: Rudolf Fleischer |
| Some basics on tolerances |
| Paul
Molitor, Gerold Jaeger and Boris
Goldengorin |
| Note on a class of admission control
policies for the stochastic knapsack problem |
| Adriana
Gabor and Jan-Kees van Ommeren |
| Inverse bottleneck optimization problems
on networks |
| Xiucui Guan and Jianzhong Zhang |
| An efficient algorithm for evacuation
problems in dynamic network flows with uniform arc capacity |
| Naoyuki Kamiyama, Naoki Katoh and Atsushi Takizawa |
| Tea Break 3:20pm- 3:50pm |
| 3:50pm-
5:10pm
LT
4
|
Session 8 -- Graph I |
| Session Chair: Yinfeng
Xu |
| Connected set cover problem and its
applications |
| Tian-Ping Shuai and Xiao-Dong Hu |
| A branch and bound algorithm for
exact, upper and lower bounds on treewidth |
| Emgad H. I. Bachoore and Hans L. Bodlaender |
| Recognition of probe cographs and partitioned distance hereditary graphs |
| David
B. Chandler, Maw-Shang Chang, Ton Kloks,
Jiping Liu and Sheng-Lung Peng |
| A new approach for solving the maximum
clique problem |
| Peter
Taillon |
| Conference Banquet 6:30pm City Chinese
Restaurant |
| |
| |
| |
| |
| |
22 June, 2006, Thu. |
| 9:00am-10:00am
LT
4
|
Session 9 – String |
| Session Chair: Lusheng
Wang |
| The approximability
of the exemplar breakpoint distance problem |
| Zhixiang Chen, Bin Fu and Binhai Zhu |
| Computing the lambda-seeds of a string |
| Qing
Guo, Hui Zhang and Costas Iliopoulos |
| Subsequence packing: complexity,
approximation and application |
| Minghui Jiang |
| Tea Break 10:00am-10:30am |
| 10:30am-11:50am
LT
4
|
Session 10 -- Graph II |
| Session Chair: Naoki Katoh |
| Decomposition based heuristic approach
to frequency reassignment problem |
| Junghee Han |
| Approximation algorithms for minimum
span channel assignment problems |
| Yuichiro Miyamoto and Tomomi Matsui |
| Weighted broadcast in linear radio
networks |
| Gautam K. Das and Subhas C. Nandy |
| Secure overlay network design |
| Li
Li, Mohammad Mahdian and Vahab Mirrokni |
| Lunch 11:50am- 2:00pm City Top |
| 2:00pm-
3:00pm
LT
4
|
Session 11 - Game & Finance II
|
| Session Chair: Xiaotie
Deng |
| A portfolio selection method based
on possibility theory |
| Wei-Guo Zhang, Qianqin Chen and Hai-Lin Lan |
| Branch on price: a fast winner determination
algorithm for discount auctions |
| Kameshwaran Sampath and Lyes
Benyoucef |
| Note on an auction procedure for
a matching game in polynomial time |
| Winfried
Hochstattler, Hui Jin and Robert Nickel |
| The End |
