1. COCOA 2007:
Xi'an,
China
Andreas W. M. Dress, Yinfeng Xu, Binhai Zhu (Eds.):
Combinatorial Optimization and Applications, First International Conference, COCOA 2007, Xi'an, China, August 14-16, 2007, Proceedings.
Lecture Notes in Computer Science 4616 Springer 2007, ISBN 978-3-540-73555-7 BibTeX
Invited Lecture
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
Electronic Edition (link) BibTeX
- Bing Su, Qingchuan Xu, Peng Xiao:
Finding the Anti-block Vital Edge of a Shortest Path Between Two Nodes.
11-19
Electronic Edition (link) BibTeX
- Deying Li, Jiannong Cao, Ming Liu, Yuan Zheng:
K -Connected Target Coverage Problem in Wireless Sensor Networks.
20-31
Electronic Edition (link) BibTeX
- Boting Yang, Runtao Zhang, Yi Cao:
Searching Cycle-Disjoint Graphs.
32-43
Electronic Edition (link) BibTeX
- Yuzhong Zhang, Zhigang Cao:
An Asymptotic PTAS for Batch Scheduling with Nonidentical Job Sizes to Minimize Makespan.
44-51
Electronic Edition (link) BibTeX
- Jean-Michel Richer, Vincent Derrien, Jin-Kao Hao:
A New Dynamic Programming Algorithm for Multiple Sequence Alignment.
52-61
Electronic Edition (link) BibTeX
- Imdat Kara, Bahar Yetis Kara, M. Kadri Yetis:
Energy Minimizing Vehicle Routing Problem.
62-71
Electronic Edition (link) BibTeX
- Weimin Ma, Ting Gao, Ke Wang:
On the On-Line k -Taxi Problem with Limited Look Ahead.
72-80
Electronic Edition (link) BibTeX
- Xujin Chen, Jie Hu, Xiaodong Hu:
The Minimum Risk Spanning Tree Problem.
81-90
Electronic Edition (link) BibTeX
- Fengwei Li, Qingfang Ye:
The Size of a Minimum Critically m -Neighbor-Scattered Graph.
91-101
Electronic Edition (link) BibTeX
- Luo Yan, Yu Changrui:
A New Hybrid Algorithm for Feature Selection and Its Application to Customer Recognition.
102-111
Electronic Edition (link) BibTeX
- Vangelis Th. Paschos, Orestis Telelis, Vassilis Zissimopoulos:
Steiner Forests on Stochastic Metric Graphs.
112-123
Electronic Edition (link) BibTeX
- Markus Behle:
On Threshold BDDs and the Optimal Variable Ordering Problem.
124-135
Electronic Edition (link) BibTeX
- Takashi Matsuhisa:
Communication Leading to Nash Equilibrium Through Robust Messages - S5 -Knowledge Model Case -.
136-145
Electronic Edition (link) BibTeX
- Eric J. Friedman:
Fundamental Domains for Integer Programs with Symmetries.
146-153
Electronic Edition (link) BibTeX
- Petrica C. Pop, Corina Pop Sitar, Ioana Zelina, Ioana Tascu:
Exact Algorithms for Generalized Combinatorial Optimization Problems.
154-162
Electronic Edition (link) BibTeX
- Wenbin Chen, Jiangtao Meng:
Approximation Algorithms for k -Duplicates Combinatorial Auctions with Subadditive Bidders.
163-170
Electronic Edition (link) BibTeX
- Yan Zhang, Yan Jia, Xiaobin Huang, Bin Zhou, Jian Gu:
A Grid Resource Discovery Method Based on Adaptive k -Nearest Neighbors Clustering.
171-181
Electronic Edition (link) BibTeX
- Weiping Shang, F. Frances Yao, Peng-Jun Wan, Xiaodong Hu:
Algorithms for Minimum m -Connected k -Dominating Set Problem.
182-190
Electronic Edition (link) BibTeX
- Danyu Bai, Lixin Tang:
Worst Case Analysis of a New Lower Bound for Flow Shop Weighted Completion Time Problem.
191-199
Electronic Edition (link) BibTeX
- Eric J. Friedman, Adam Scott Landsberg:
Scaling, Renormalization, and Universality in Combinatorial Games: The Geometry of Chomp.
200-207
Electronic Edition (link) BibTeX
- Raphael Eidenbenz, Yvonne Anne Oswald, Stefan Schmid, Roger Wattenhofer:
Mechanism Design by Creditability.
208-219
Electronic Edition (link) BibTeX
- Xiaoping Dai, Jianqin Zhou, Xiaolin Wang:
Infinite Families of Optimal Double-Loop Networks.
220-229
Electronic Edition (link) BibTeX
- Hanno Lefmann:
Point Sets in the Unit Square and Large Areas of Convex Hulls of Subsets of Points.
230-241
Electronic Edition (link) BibTeX
- 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
Electronic Edition (link) BibTeX
- Takaaki Mizuki, Yoshinori Kugimoto, Hideaki Sone:
Secure Multiparty Computations Using the 15 Puzzle.
255-266
Electronic Edition (link) BibTeX
- Ernst Althaus, Stefan Canzar:
A Lagrangian Relaxation Approach for the Multiple Sequence Alignment Problem.
267-278
Electronic Edition (link) BibTeX
- Guohua Wan:
Single Machine Common Due Window Scheduling with Controllable Job Processing Times.
279-290
Electronic Edition (link) BibTeX
- Jianxin Wang, Min Huang, Jianer Chen:
A Lower Bound on Approximation Algorithms for the Closest Substring Problem.
291-300
Electronic Edition (link) BibTeX
- Lanbo Zheng, Christoph Buchheim:
A New Exact Algorithm for the Two-Sided Crossing Minimization Problem.
301-310
Electronic Edition (link) BibTeX
- Mohammad Khairul Hasan, Hyunwoo Jung, Kyung-Yong Chwa:
Improved Approximation Algorithm for Connected Facility Location Problems.
311-322
Electronic Edition (link) BibTeX
- ChenGuang Liu, Kazuyuki Tanaka:
The Computational Complexity of Game Trees by Eigen-Distribution.
323-334
Electronic Edition (link) BibTeX
- Yunting Lu, Yueping Li:
The Minimum All-Ones Problem for Graphs with Small Treewidth.
335-342
Electronic Edition (link) BibTeX
- Jianxin Wang, Xiaoshuang Xu, Yunlong Liu:
An Exact Algorithm Based on Chain Implication for the Min-CVCB Problem.
343-353
Electronic Edition (link) BibTeX
- Brian Alspach, Danny Dyer, Denis Hanson, Boting Yang:
Arc Searching Digraphs Without Jumping.
354-365
Electronic Edition (link) BibTeX
- 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
Electronic Edition (link) BibTeX
- Minghui Jiang:
A PTAS for the Weighted 2-Interval Pattern Problem over the Preceding-and-Crossing Model.
378-387
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:02:44 2009
by Michael Ley (ley@uni-trier.de)
