2. AAIM 2006: Hong Kong, China

Siu-Wing Cheng, Chung Keung Poon (Eds.): Algorithmic Aspects in Information and Management, Second International Conference, AAIM 2006, Hong Kong, China, June 20-22, 2006, Proceedings. Lecture Notes in Computer Science 4041 Springer 2006, ISBN 3-540-35157-4 BibTeX

Invited Papers

Allan Borodin:
Further Reflections on a Theory for Basic Algorithms. 1-9
Electronic Edition (link) BibTeX
Ming-Yang Kao:
Algorithmic DNA Self-assembly. 10
Electronic Edition (link) BibTeX

Contributed Papers

Yiwei Jiang:
Online Scheduling on Parallel Machines with Two GoS Levels. 11-21
Electronic Edition (link) BibTeX
Fanglei Yi, Yinfeng Xu, Chunlin Xin:
Online Dial-A-Ride Problem with Time-Windows Under a Restricted Information Model. 22-31
Electronic Edition (link) BibTeX
Jihuan Ding, Guochuan Zhang:
Online Scheduling with Hard Deadlines on Parallel Machines. 32-42
Electronic Edition (link) BibTeX
Jae-Hoon Kim:
Maximizing the Throughput of Multiple Machines On-Line. 43-52
Electronic Edition (link) BibTeX
Xi Chen, Xiaotie Deng:
Lattice Embedding of Direction-Preserving Correspondence over Integrally Convex Set. 53-63
Electronic Edition (link) BibTeX
Ola Svensson, Sergei G. Vorobyov:
Linear Programming Polytope and Algorithm for Mean Payoff Games. 64-78
Electronic Edition (link) BibTeX
Costas Busch, Malik Magdon-Ismail:
Atomic Routing Games on Maximum Congestion. 79-91
Electronic Edition (link) BibTeX
Qianqin Chen, Wei-Guo Zhang, Guoliang Kuang:
Equilibrium Distribution of Advertising Prices. 92-101
Electronic Edition (link) BibTeX
Henning Köhler:
Finding Faithful Boyce-Codd Normal Form Decompositions. 102-113
Electronic Edition (link) BibTeX
Jinoo Joung, Dongha Shin, Feifei Feng, Hongkyu Jeong:
Instant Service Policy and Its Application to Deficit Round Robin. 114-125
Electronic Edition (link) BibTeX
Qiaofeng Yang, Stefano Lonardi, Avraham Melkman:
A Compression-Boosting Transform for Two-Dimensional Data. 126-137
Electronic Edition (link) BibTeX
Rudolf Fleischer, Jian Li, Shijun Tian, Hong Zhu:
Non-metric Multicommodity and Multilevel Facility Location. 138-148
Electronic Edition (link) BibTeX
Bin Fu, Zhixiang Chen:
Sublinear Time Width-Bounded Separators and Their Application to the Protein Side-Chain Packing Problem. 149-160
Electronic Edition (link) BibTeX
Shin-ichi Tanigawa, Naoki Katoh:
Polygonal Curve Approximation Using Grid Points with Application to a Triangular Mesh Generation with Small Number of Different Edge Lengths. 161-172
Electronic Edition (link) BibTeX
Hanno Lefmann:
Distributions of Points and Large Convex Hulls of k Points. 173-184
Electronic Edition (link) BibTeX
Otfried Cheong, Hazel Everett, Hyo-Sil Kim, Sylvain Lazard, René Schott:
Throwing Stones Inside Simple Polygons . 185-193
Electronic Edition (link) BibTeX
Boris Goldengorin, Gerold Jäger, Paul Molitor:
Some Basics on Tolerances. 194-206
Electronic Edition (link) BibTeX
Adriana Felicia Gabor, Jan-Kees C. W. van Ommeren:
Note on a Class of Admission Control Policies for the Stochastic Knapsack Problem. 207-219
Electronic Edition (link) BibTeX
Xiucui Guan, Jianzhong Zhang:
Inverse Bottleneck Optimization Problems on Networks. 220-230
Electronic Edition (link) BibTeX
Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa:
An Efficient Algorithm for Evacuation Problems in Dynamic Network Flows with Uniform Arc Capacity. 231-242
Electronic Edition (link) BibTeX
Tianping Shuai, Xiao-Dong Hu:
Connected Set Cover Problem and Its Applications. 243-254
Electronic Edition (link) BibTeX
Emgad H. Bachoore, Hans L. Bodlaender:
A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth. 255-266
Electronic Edition (link) BibTeX
David B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng:
Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs. 267-278
Electronic Edition (link) BibTeX
Peter J. Taillon:
A New Approach for Solving the Maximum Clique Problem. 279-290
Electronic Edition (link) BibTeX
Zhixiang Chen, Bin Fu, Binhai Zhu:
The Approximability of the Exemplar Breakpoint Distance Problem. 291-302
Electronic Edition (link) BibTeX
Qing Guo, Hui Zhang, Costas S. Iliopoulos:
Computing the lambda-Seeds of a String. 303-313
Electronic Edition (link) BibTeX
Minghui Jiang:
Subsequence Packing: Complexity, Approximation, and Application. 314-323
Electronic Edition (link) BibTeX
Junghee Han:
Decomposition Based Heuristic Approach to Frequency Reassignment Problem. 324-333
Electronic Edition (link) BibTeX
Yuichiro Miyamoto, Tomomi Matsui:
Approximation Algorithms for Minimum Span Channel Assignment Problems. 334-342
Electronic Edition (link) BibTeX
Gautam K. Das, Subhas C. Nandy:
Weighted Broadcast in Linear Radio Networks. 343-353
Electronic Edition (link) BibTeX
Erran L. Li, Mohammad Mahdian, Vahab S. Mirrokni:
Secure Overlay Network Design. 354-366
Electronic Edition (link) BibTeX
Wei-Guo Zhang, Qianqin Chen, Hai-Lin Lan:
A Portfolio Selection Method Based on Possibility Theory. 367-374
Electronic Edition (link) BibTeX
Sampath Kameshwaran, Lyès Benyoucef:
Branch on Price: A Fast Winner Determination Algorithm for Discount Auctions. 375-386
Electronic Edition (link) BibTeX
Winfried Hochstättler, Hui Jin, Robert Nickel:
Note on an Auction Procedure for a Matching Game in Polynomial Time. 387-394
Electronic Edition (link) BibTeX