default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID2. AAIM 2006: Hong Kong, China
- Siu-Wing Cheng, Chung Keung Poon:
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
Invited Papers
- Allan Borodin:
Further Reflections on a Theory for Basic Algorithms. 1-9 - Ming-Yang Kao:
Algorithmic DNA Self-assembly. 10
Contributed Papers
- Yiwei Jiang:
Online Scheduling on Parallel Machines with Two GoS Levels. 11-21 - Fanglei Yi, Yinfeng Xu, Chunlin Xin:
Online Dial-A-Ride Problem with Time-Windows Under a Restricted Information Model. 22-31 - Jihuan Ding, Guochuan Zhang
:
Online Scheduling with Hard Deadlines on Parallel Machines. 32-42 - Jae-Hoon Kim:
Maximizing the Throughput of Multiple Machines On-Line. 43-52 - Xi Chen, Xiaotie Deng:
Lattice Embedding of Direction-Preserving Correspondence over Integrally Convex Set. 53-63 - Ola Svensson, Sergei G. Vorobyov:
Linear Programming Polytope and Algorithm for Mean Payoff Games. 64-78 - Costas Busch, Malik Magdon-Ismail:
Atomic Routing Games on Maximum Congestion. 79-91 - Qianqin Chen, Wei-Guo Zhang, Guoliang Kuang:
Equilibrium Distribution of Advertising Prices. 92-101 - Henning Köhler:
Finding Faithful Boyce-Codd Normal Form Decompositions. 102-113 - Jinoo Joung, Dongha Shin, Feifei Feng, Hongkyu Jeong:
Instant Service Policy and Its Application to Deficit Round Robin. 114-125 - Qiaofeng Yang, Stefano Lonardi, Avraham A. Melkman:
A Compression-Boosting Transform for Two-Dimensional Data. 126-137 - Rudolf Fleischer, Jian Li, Shijun Tian, Hong Zhu:
Non-metric Multicommodity and Multilevel Facility Location. 138-148 - Bin Fu, Zhixiang Chen:
Sublinear Time Width-Bounded Separators and Their Application to the Protein Side-Chain Packing Problem. 149-160 - 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 - Hanno Lefmann:
Distributions of Points and Large Convex Hulls of k Points. 173-184 - Otfried Cheong, Hazel Everett, Hyo-Sil Kim, Sylvain Lazard, René Schott:
Throwing Stones Inside Simple Polygons . 185-193 - Boris Goldengorin, Gerold Jäger, Paul Molitor:
Some Basics on Tolerances. 194-206 - Adriana Felicia Gabor, Jan-Kees C. W. van Ommeren:
Note on a Class of Admission Control Policies for the Stochastic Knapsack Problem. 207-219 - Xiucui Guan, Jianzhong Zhang:
Inverse Bottleneck Optimization Problems on Networks. 220-230 - Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa:
An Efficient Algorithm for Evacuation Problems in Dynamic Network Flows with Uniform Arc Capacity. 231-242 - Tianping Shuai, Xiao-Dong Hu:
Connected Set Cover Problem and Its Applications. 243-254 - Emgad H. Bachoore, Hans L. Bodlaender:
A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth. 255-266 - 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 - Peter J. Taillon:
A New Approach for Solving the Maximum Clique Problem. 279-290 - Zhixiang Chen, Bin Fu, Binhai Zhu:
The Approximability of the Exemplar Breakpoint Distance Problem. 291-302 - Qing Guo, Hui Zhang, Costas S. Iliopoulos:
Computing the lambda-Seeds of a String. 303-313 - Minghui Jiang:
Subsequence Packing: Complexity, Approximation, and Application. 314-323 - Junghee Han:
Decomposition Based Heuristic Approach to Frequency Reassignment Problem. 324-333 - Yuichiro Miyamoto, Tomomi Matsui:
Approximation Algorithms for Minimum Span Channel Assignment Problems. 334-342 - Gautam K. Das, Subhas C. Nandy:
Weighted Broadcast in Linear Radio Networks. 343-353 - Li (Erran) Li, Mohammad Mahdian, Vahab S. Mirrokni:
Secure Overlay Network Design. 354-366 - Wei-Guo Zhang, Qianqin Chen, Hai-Lin Lan:
A Portfolio Selection Method Based on Possibility Theory. 367-374 - Sampath Kameshwaran, Lyès Benyoucef:
Branch on Price: A Fast Winner Determination Algorithm for Discount Auctions. 375-386 - Winfried Hochstättler, Hui Jin, Robert Nickel:
Note on an Auction Procedure for a Matching Game in Polynomial Time. 387-394
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-05 22:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
