Abstract is missing.
- The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) <= 11/9OPT(I) + 6/9György Dósa. 1-11 [doi]
- Sequential Vector PackingMark Cieliebak, Alexander Hall, Riko Jacob, Marc Nunkesser. 12-23 [doi]
- A Tighter Analysis of Set Cover Greedy Algorithm for Test SetPeng Cui. 24-35 [doi]
- A More Effective Linear Kernelization for Cluster EditingJiong Guo. 36-47 [doi]
- CR-precis: A Deterministic Summary Structure for Update Data StreamsSumit Ganguly, Anirban Majumder. 48-59 [doi]
- An Effective Refinement Algorithm Based on Swarm Intelligence for Graph BipartitioningLingyu Sun, Ming Leng. 60-69 [doi]
- On the Complexity and Approximation of the Min-Sum and Min-Max Disjoint Paths ProblemsPeng Zhang, Wenbo Zhao. 70-81 [doi]
- A Digital Watermarking Scheme Based on Singular Value DecompositionChin-Chen Chang, Yih-Shin Hu, Chia-Chen Lin. 82-93 [doi]
- A New (t, n)-Threshold Scheme Based on Difference EquationsChao-Wen Chan, Chin-Chen Chang. 94-106 [doi]
- Clique-Transversal Sets in Cubic GraphsZuosong Liang, Erfang Shan, T. C. Edwin Cheng. 107-115 [doi]
- On the L(h, k)-Labeling of Co-comparability GraphsTiziana Calamoneri, Saverio Caminiti, Stephan Olariu, Rossella Petreschi. 116-127 [doi]
- An Approximation Algorithm for the General Mixed Packing and Covering ProblemFlorian Diedrich, Klaus Jansen. 128-139 [doi]
- Extending the Hardness of RNA Secondary Structure ComparisonGuillaume Blin, Guillaume Fertin, Irena Rusu, Christine Sinoquet. 140-151 [doi]
- On the On-Line Weighted k-Taxi ProblemWeimin Ma, Ke Wang. 152-162 [doi]
- Model Futility and Dynamic Boundaries with Application in Banking Default Risk ModelingXiao-Jun Shi. 163-174 [doi]
- On the Minimum Risk-Sum Path ProblemXujin Chen, Jie Hu, Xiaodong Hu. 175-185 [doi]
- Constrained Cycle Covers in Halin GraphsYueping Li. 186-197 [doi]
- Optimal Semi-online Algorithms for Scheduling with Machine Activation CostShuguang Han, Yiwei Jiang, Jueliang Hu. 198-208 [doi]
- A Fast Asymptotic Approximation Scheme for Bin Packing with RejectionWolfgang W. Bein, José R. Correa, Xin Han. 209-218 [doi]
- Online Coupon Consumption ProblemYiwei Jiang, An Zhang, Zhiyi Tan. 219-230 [doi]
- Application of Copula and Copula-CVaR in the Multivariate Portfolio OptimizationManying Bai, Lujie Sun. 231-242 [doi]
- Online Capacitated Interval ColoringLeah Epstein, Thomas Erlebach, Asaf Levin. 243-254 [doi]
- Energy Efficient Heuristic Scheduling Algorithms for Multimedia ServiceSungwook Kim, Sungchun Kim. 255-259 [doi]
- Call Control and Routing in SONET RingsShuqiang Chen, Qizhi Fang. 260-270 [doi]
- Fast Matching Method for DNA SequencesJin Wook Kim, Eunsang Kim, Kunsoo Park. 271-281 [doi]
- All-Pairs Ancestor Problems in Weighted DagsMatthias Baumgart, Stefan Eckhardt, Jan Griebsch, Sven Kosub, Johannes Nowak. 282-293 [doi]
- Streaming Algorithms for Data in MotionMichael Hoffmann 0002, S. Muthukrishnan, Rajeev Raman. 294-304 [doi]
- A Scheduling Problem with One Producer and the Bargaining Counterpart with Two ProducersXiaobing Gan, Yanhong Gu, George L. Vairaktarakis, Xiaoqiang Cai, Quanle Chen. 305-316 [doi]
- Phrase-Based Statistical Language Modeling from Bilingual Parallel CorpusJun Mao, Gang Cheng, Yanxiang He. 317-328 [doi]
- Optimal Commodity Distribution for a Vehicle with Fixed Capacity Under Vendor Managed InventoryXiaolin Xu, Xiaoqiang Cai, Chunlin Liu, Chikit To. 329-339 [doi]
- On-Line Bin Packing with Arbitrary Release TimesYongqiang Shi, Deshi Ye. 340-349 [doi]
- On the Complexity of the Max-Edge-Coloring Problem with Its VariantsChang-Wu Yu. 350-361 [doi]
- Quantitative Analysis of Multi-hop Wireless Networks Using a Novel ParadigmChang-Wu Yu. 362-374 [doi]
- Inverse Min-Max Spanning Tree Problem Under the Weighted Sum-Type Hamming DistanceLongcheng Liu, Enyu Yao. 375-383 [doi]
- Robust Optimization Model for a Class of Uncertain Linear ProgramsWeimin Miao, Hongxia Yin, Donglei Du, Jiye Han. 384-395 [doi]
- An Efficient Algorithm for Solving the Container Loading ProblemWenqi Huang, Kun He. 396-407 [doi]
- A Bijective Code for ::::k:::: -Trees with Linear Time Encoding and DecodingSaverio Caminiti, Emanuele G. Fusco, Rossella Petreschi. 408-420 [doi]
- Market-Based Service Selection Framework in Grid ComputingYanxiang He, Haowen Liu. 421-434 [doi]
- Informative Gene Selection and Tumor Classification by Null Space LDA for Microarray DataFeng Yue, Kuanquan Wang, Wangmeng Zuo. 435-446 [doi]
- Heuristic Search for 2D NMR Alignment to Support Metabolite IdentificationGeun-Cheol Lee, Jeff de Ropp, Mark R. Viant, David L. Woodruff, Ping Yu. 447-458 [doi]
- A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix ArrayJohannes Fischer, Volker Heun. 459-470 [doi]
- Lagrangian Relaxation and Cutting Planes for the Vertex Separator ProblemVictor F. Cavalcante, Cid C. de Souza. 471-482 [doi]
- Finding Pure Nash Equilibrium of Graphical Game Via Constraints Satisfaction ApproachMin Jiang. 483-494 [doi]
- A New Load Balanced Routing Algorithm for Torus NetworksJiyun Niu, Huaxi Gu, Changshan Wang. 495-503 [doi]
- Optimal Semi-online Scheduling Algorithms on a Small Number of MachinesYong Wu, Zhiyi Tan, Qifan Yang. 504-515 [doi]
- Lower Bounds on Edge SearchingBrian Alspach, Danny Dyer, Denis Hanson, Boting Yang. 516-527 [doi]