Abstract is missing.
- Further Reflections on a Theory for Basic AlgorithmsAllan Borodin. 1-9 [doi]
- Algorithmic DNA Self-assemblyMing-Yang Kao. 10 [doi]
- Online Scheduling on Parallel Machines with Two GoS LevelsYiwei Jiang. 11-21 [doi]
- Online Dial-A-Ride Problem with Time-Windows Under a Restricted Information ModelFanglei Yi, Yinfeng Xu, Chunlin Xin. 22-31 [doi]
- Online Scheduling with Hard Deadlines on Parallel MachinesJihuan Ding, Guochuan Zhang. 32-42 [doi]
- Maximizing the Throughput of Multiple Machines On-LineJae-Hoon Kim. 43-52 [doi]
- Lattice Embedding of Direction-Preserving Correspondence over Integrally Convex SetXi Chen, Xiaotie Deng. 53-63 [doi]
- Linear Programming Polytope and Algorithm for Mean Payoff GamesOla Svensson, Sergei G. Vorobyov. 64-78 [doi]
- Atomic Routing Games on Maximum CongestionCostas Busch, Malik Magdon-Ismail. 79-91 [doi]
- Equilibrium Distribution of Advertising PricesQianqin Chen, Wei-Guo Zhang, Guoliang Kuang. 92-101 [doi]
- Finding Faithful Boyce-Codd Normal Form DecompositionsHenning Köhler. 102-113 [doi]
- Instant Service Policy and Its Application to Deficit Round RobinJinoo Joung, Dongha Shin, Feifei Feng, Hongkyu Jeong. 114-125 [doi]
- A Compression-Boosting Transform for Two-Dimensional DataQiaofeng Yang, Stefano Lonardi, Avraham Melkman. 126-137 [doi]
- Non-metric Multicommodity and Multilevel Facility LocationRudolf Fleischer, Jian Li, Shijun Tian, Hong Zhu. 138-148 [doi]
- Sublinear Time Width-Bounded Separators and Their Application to the Protein Side-Chain Packing ProblemBin Fu, Zhixiang Chen. 149-160 [doi]
- Polygonal Curve Approximation Using Grid Points with Application to a Triangular Mesh Generation with Small Number of Different Edge LengthsShin-ichi Tanigawa, Naoki Katoh. 161-172 [doi]
- Distributions of Points and Large Convex Hulls of ::::k:::: PointsHanno Lefmann. 173-184 [doi]
- Throwing Stones Inside Simple Polygons Otfried Cheong, Hazel Everett, Hyo-Sil Kim, Sylvain Lazard, René Schott. 185-193 [doi]
- Some Basics on TolerancesBoris Goldengorin, Gerold Jäger, Paul Molitor. 194-206 [doi]
- Note on a Class of Admission Control Policies for the Stochastic Knapsack ProblemAdriana Felicia Gabor, Jan-Kees C. W. van Ommeren. 207-219 [doi]
- Inverse Bottleneck Optimization Problems on NetworksXiucui Guan, Jianzhong Zhang. 220-230 [doi]
- An Efficient Algorithm for Evacuation Problems in Dynamic Network Flows with Uniform Arc CapacityNaoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa. 231-242 [doi]
- Connected Set Cover Problem and Its ApplicationsTianping Shuai, Xiao-Dong Hu. 243-254 [doi]
- A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on TreewidthEmgad H. Bachoore, Hans Leo Bodlaender. 255-266 [doi]
- Recognition of Probe Cographs and Partitioned Probe Distance Hereditary GraphsDavid B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng. 267-278 [doi]
- A New Approach for Solving the Maximum Clique ProblemPeter J. Taillon. 279-290 [doi]
- The Approximability of the Exemplar Breakpoint Distance ProblemZhixiang Chen, Bin Fu, Binhai Zhu. 291-302 [doi]
- Computing the ::::lambda::::-Seeds of a StringQing Guo, Hui Zhang, Costas S. Iliopoulos. 303-313 [doi]
- Subsequence Packing: Complexity, Approximation, and ApplicationMinghui Jiang. 314-323 [doi]
- Decomposition Based Heuristic Approach to Frequency Reassignment ProblemJunghee Han. 324-333 [doi]
- Approximation Algorithms for Minimum Span Channel Assignment ProblemsYuichiro Miyamoto, Tomomi Matsui. 334-342 [doi]
- Weighted Broadcast in Linear Radio NetworksGautam K. Das, Subhas C. Nandy. 343-353 [doi]
- Secure Overlay Network DesignErran L. Li, Mohammad Mahdian, Vahab S. Mirrokni. 354-366 [doi]
- A Portfolio Selection Method Based on Possibility TheoryWei-Guo Zhang, Qianqin Chen, Hai-Lin Lan. 367-374 [doi]
- Branch on Price: A Fast Winner Determination Algorithm for Discount AuctionsSampath Kameshwaran, Lyès Benyoucef. 375-386 [doi]
- Note on an Auction Procedure for a Matching Game in Polynomial TimeWinfried Hochstättler, Hui Jin 0002, Robert Nickel. 387-394 [doi]