List of 29 Accepted Papers for COCOA'2007
	(out of 114 submissions, acceptance rate = 25%)

Accepted papers are listed in the order they were submitted.
------------------------------------------------------------

#8   Xujin Chen, Jie Hu and Xiaodong Hu.
	The Minimum Risk Spanning Tree Problem

#16  Danyu Bai and Lixin Tang.
	Worst Case Analysis of a New Lower Bound for Flow Shop Weighted
Completion Time Problem

#18  Xiaoping Dai, Jianqin Zhou and Xiaolin Wang.
	Infinite Families of Optimal Double-loop Networks

#26  Raphael Eidenbenz, Yvonne Anne Oswald, Stefan Schmid and Roger Wattenhofer.
    	Mechanism Design by Creditability

#29  Guohua Wan.
	Single Machine Common Due Window Scheduling with Controllable Job Processing Times

#31  Fengwei Li and Qingfang Ye.
	The Size of a Minimum Critically m-Neighbor-scattered Graph

#33  Shang Weiping, Frances Yao, Peng-Jun Wan and Xiaodong Hu.
	Algorithms for Minimum m-Connected k-Dominating Set Problem

#35  Yan Luo and Changrui Yu.
	A New Hybrid Algorithm for Feature Selection and Its Application to Customer Recognition

#37  Eric Friedman and Adam Landsberg 
	Scaling, Renormalization and Universality in Combinatorial Games: The Geometry of Chomp

#50  Jianxin Wang, Min Huang and Jianer Chen.
	A Lower Bound on Approximation Algorithms for the Closest Substring Problem

#55  Markus Behle.
	On Threshold BDDs and the Optimal Variable Ordering Problem

#57  Vangelis Paschos, Orestis Telelis and Vassilis Zissimopoulos.
	Steiner Forests on Stochastic Metric Graphs

#59  Eric Friedman.
	Fundamental Domains for Combinatorial Integer Programs with Symmetries

#63  Mohammad Khairul Hasan, Hyunwoo Jung and Kyung-Yong Chwa.
	Improved Approximation Algorithm for Connected Facility Location Problems

#68  Wenbin Chen and Jiangtao Meng.
	Approximation Algorithms for k Duplicates Combinatorial Auctions with Subadditive Bidders

#76  ChenGuang Liu and Kazuyuki Tanaka.
	The Computational Complexity of Game Trees by Eigen-Distribution

#78  Petrica Claudiu Pop, Corina Pop Sitar, Ioana Zelina and Ioana Tascu.
	Exact Algorithms for Generalized Combinatorial Optimization Problems

#84  Yan Zhang, Yan Jia, Xiaobin Huang, Bin Zhou and Jian Gu.
	A Grid Resource Discovery Method based on Adaptive k-Nearest Neighbors Clustering

#89  Ernst Althaus and Stefan Canzar.
	A Lagrangian Relaxation Approach for the Multiple Sequence Alignment Problem

#96  Jianxin Wang, Xiaoshuang Xu and Yunlong Liu.
	An Exact Algorithm based on Chain Implication for the Min-CVCB Problem

#97  Jean-Michel Richer, Vincent Derrien and Jin-Kao Hao.
	A New Dynamic Programming Algorithm for Multiple Sequence Alignment

#98  Weimin Ma, Ting Gao and Ke Wang.
	On the On-line k-Taxi Problem with Limited Look Ahead

#101 Tak-Wah Lam, Wing-Kin Sung, Siu-Lung Tam, Simon C.K. Wong and SM Yiu. 
      	An Experimental Study of Compressed Indexing and Local Alignment of DNA

#103 Yuzhong Zhang and Cao Zhigang.
	An Asymptotic PTAS for Batch Scheduling With Nonidentical Job Sizes to Minimize Makespan

#104 Takashi Matsuhisa.
	Communication Leading to Nash Equilibrium Through Robust Messages

#105 Yunting Lu and Yueping Li.
	The Minimum All-Ones Problem for Graphs with Small Treewidth

#112 Zheng Lanbo and Christoph Buchheim.
	A New Exact Algorithm for the Two-Sided Crossing Minimization Problem

#114 Boting Yang, Runtao Zhang and Yi Cao.
	Searching Cycle-Disjoint Graphs

#115 Imdat Kara, Bahar Yetis Kara and M. Kadri Yetis.
	Energy Minimizing Vehicle Routing Problem

+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

Besides 29 regular papers and 2 invited lectures, COCOA'07 will also include
7 invited papers which will be finalized soon.

#117 Takaaki Mizuki, Yoshinori Kugimoto and Hideaki Sone.
	Secure Multiparty Computations Using the 15 Puzzle

#118 Bing Su, Qingchuan Xu and Peng Xiao.
	Finding the Anti-Block Vital Edge of a Shortest Path Between Two Nodes

#119 Deying Li, Jiannong Cao, Ming Liu and Yuan Zhang.
	K-connected Target Coverage Problem in Wireless Sensor Networks

#120 Andreas Dress, Katharina Huber, Jacobus Koolen and Vincent Moulton.
	An Algorithm for Computing Virtual Cut Points in Finite Metric Spaces

#121 Hanno Lefmann 
	Point Sets in the Unit Square and Large Areas of Convex Hulls of Subsets of Points

#122 Brian Alspach, Danny Dyer, Denis Hanson and Boting Yang 
	Arc Searching Digraphs without Jumping

#123 Michael Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances Rosamond,
Saket Saurabh, Stefan Szeider and Carsten Thomassen
	On the Complexity of Some Colorful Problems Parameterized by Treewidth

#124 Minghui Jiang
	A PTAS for the Weighted 2-Interval Pattern Problem over the Preceding-and-Crossing Model