1. COCOA 2007: Xi'an, China

Invited Lecture

• Kurt Mehlhorn:
  Matchings in Graphs Variations of the Problem. 1-2
  
• Bailin Hao:
  Combinatorics from Bacterial Genomes. 3
  

Contributed Papers

• Andreas W. M. Dress, Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton:
  An Algorithm for Computing Virtual Cut Points in Finite Metric Spaces. 4-10
  
• Bing Su, Qingchuan Xu, Peng Xiao:
  Finding the Anti-block Vital Edge of a Shortest Path Between Two Nodes. 11-19
  
• Deying Li, Jiannong Cao, Ming Liu, Yuan Zheng:
  K -Connected Target Coverage Problem in Wireless Sensor Networks. 20-31
  
• Boting Yang, Runtao Zhang, Yi Cao:
  Searching Cycle-Disjoint Graphs. 32-43
  
• Yuzhong Zhang, Zhigang Cao:
  An Asymptotic PTAS for Batch Scheduling with Nonidentical Job Sizes to Minimize Makespan. 44-51
  
• Jean-Michel Richer, Vincent Derrien, Jin-Kao Hao:
  A New Dynamic Programming Algorithm for Multiple Sequence Alignment. 52-61
  
• Imdat Kara, Bahar Yetis Kara, M. Kadri Yetis:
  Energy Minimizing Vehicle Routing Problem. 62-71
  
• Weimin Ma, Ting Gao, Ke Wang:
  On the On-Line k -Taxi Problem with Limited Look Ahead. 72-80
  
• Xujin Chen, Jie Hu, Xiaodong Hu:
  The Minimum Risk Spanning Tree Problem. 81-90
  
• Fengwei Li, Qingfang Ye:
  The Size of a Minimum Critically m -Neighbor-Scattered Graph. 91-101
  
• Luo Yan, Yu Changrui:
  A New Hybrid Algorithm for Feature Selection and Its Application to Customer Recognition. 102-111
  
• Vangelis Th. Paschos, Orestis Telelis, Vassilis Zissimopoulos:
  Steiner Forests on Stochastic Metric Graphs. 112-123
  
• Markus Behle:
  On Threshold BDDs and the Optimal Variable Ordering Problem. 124-135
  
• Takashi Matsuhisa:
  Communication Leading to Nash Equilibrium Through Robust Messages - S5 -Knowledge Model Case -. 136-145
  
• Eric J. Friedman:
  Fundamental Domains for Integer Programs with Symmetries. 146-153
  
• Petrica C. Pop, Corina Pop Sitar, Ioana Zelina, Ioana Tascu:
  Exact Algorithms for Generalized Combinatorial Optimization Problems. 154-162
  
• Wenbin Chen, Jiangtao Meng:
  Approximation Algorithms for k -Duplicates Combinatorial Auctions with Subadditive Bidders. 163-170
  
• Yan Zhang, Yan Jia, Xiaobin Huang, Bin Zhou, Jian Gu:
  A Grid Resource Discovery Method Based on Adaptive k -Nearest Neighbors Clustering. 171-181
  
• Weiping Shang, F. Frances Yao, Peng-Jun Wan, Xiaodong Hu:
  Algorithms for Minimum m -Connected k -Dominating Set Problem. 182-190
  
• Danyu Bai, Lixin Tang:
  Worst Case Analysis of a New Lower Bound for Flow Shop Weighted Completion Time Problem. 191-199
  
• Eric J. Friedman, Adam Scott Landsberg:
  Scaling, Renormalization, and Universality in Combinatorial Games: The Geometry of Chomp. 200-207
  
• Raphael Eidenbenz, Yvonne Anne Oswald, Stefan Schmid, Roger Wattenhofer:
  Mechanism Design by Creditability. 208-219
  
• Xiaoping Dai, Jianqin Zhou, Xiaolin Wang:
  Infinite Families of Optimal Double-Loop Networks. 220-229
  
• Hanno Lefmann:
  Point Sets in the Unit Square and Large Areas of Convex Hulls of Subsets of Points. 230-241
  
• Tak Wah Lam, Wing-Kin Sung, Siu-Lung Tam, Chi-Kwong Wong, Siu-Ming Yiu:
  An Experimental Study of Compressed Indexing and Local Alignments of DNA. 242-254
  
• Takaaki Mizuki, Yoshinori Kugimoto, Hideaki Sone:
  Secure Multiparty Computations Using the 15 Puzzle. 255-266
  
• Ernst Althaus, Stefan Canzar:
  A Lagrangian Relaxation Approach for the Multiple Sequence Alignment Problem. 267-278
  
• Guohua Wan:
  Single Machine Common Due Window Scheduling with Controllable Job Processing Times. 279-290
  
• Jianxin Wang, Min Huang, Jianer Chen:
  A Lower Bound on Approximation Algorithms for the Closest Substring Problem. 291-300
  
• Lanbo Zheng, Christoph Buchheim:
  A New Exact Algorithm for the Two-Sided Crossing Minimization Problem. 301-310
  
• Mohammad Khairul Hasan, Hyunwoo Jung, Kyung-Yong Chwa:
  Improved Approximation Algorithm for Connected Facility Location Problems. 311-322
  
• ChenGuang Liu, Kazuyuki Tanaka:
  The Computational Complexity of Game Trees by Eigen-Distribution. 323-334
  
• Yunting Lu, Yueping Li:
  The Minimum All-Ones Problem for Graphs with Small Treewidth. 335-342
  
• Jianxin Wang, Xiaoshuang Xu, Yunlong Liu:
  An Exact Algorithm Based on Chain Implication for the Min-CVCB Problem. 343-353
  
• Brian Alspach, Danny Dyer, Denis Hanson, Boting Yang:
  Arc Searching Digraphs Without Jumping. 354-365
  
• Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen:
  On the Complexity of Some Colorful Problems Parameterized by Treewidth. 366-377
  
• Minghui Jiang:
  A PTAS for the Weighted 2-Interval Pattern Problem over the Preceding-and-Crossing Model. 378-387