1. ESCAPE 2007: Hangzhou, China

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