2. COCOA 2008:
St. John's,
NL,
Canada
Boting Yang, Ding-Zhu Du, Cao An Wang (Eds.):
Combinatorial Optimization and Applications, Second International Conference, COCOA 2008, St. John's, NL, Canada, August 21-24, 2008. Proceedings.
Lecture Notes in Computer Science 5165 Springer 2008, ISBN 978-3-540-85096-0 BibTeX
- Sebastian Böcker, Sebastian Briesemeister, Quang Bao Anh Bui, Anke Truß:
Going Weighted: Parameterized Algorithms for Cluster Editing.
1-12
Electronic Edition (link) BibTeX
- Luke Mathieson, Stefan Szeider:
Parameterized Graph Editing with Chosen Vertex Degrees.
13-22
Electronic Edition (link) BibTeX
- Rhonda Chaytor, Patricia A. Evans, Todd Wareham:
Fixed-Parameter Tractability of Anonymizing Data by Suppressing Entries.
23-31
Electronic Edition (link) BibTeX
- Peter Damaschke:
Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets.
32-42
Electronic Edition (link) BibTeX
- Nadja Betzler, Johannes Uhlmann:
Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems.
43-53
Electronic Edition (link) BibTeX
- Henning Fernau, Daniel Raible:
A Parameterized Perspective on Packing Paths of Length Two.
54-63
Electronic Edition (link) BibTeX
- René Brandenberg, Lucia Roth:
New Algorithms for k-Center and Extensions.
64-78
Electronic Edition (link) BibTeX
- Bin Fu, Zhiyu Zhao:
Separating Sublinear Time Computations by Approximate Diameter.
79-88
Electronic Edition (link) BibTeX
- Marjan Marzban, Qian-Ping Gu, Xiaohua Jia:
Computational Study on Dominating Set Problem of Planar Graphs.
89-102
Electronic Edition (link) BibTeX
- Binay K. Bhattacharya, B. Burmester, Yuzhuang Hu, Evangelos Kranakis, Qiaosheng Shi, Andreas Wiese:
Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region.
103-115
Electronic Edition (link) BibTeX
- Venkatesh Raman, Saket Saurabh, Sriganesh Srihari:
Parameterized Algorithms for Generalized Domination.
116-126
Electronic Edition (link) BibTeX
- Véronique Bruyère, Hadrien Mélot:
Turán Graphs, Stability Number, and Fibonacci Index.
127-138
Electronic Edition (link) BibTeX
- Cécile Murat, Vangelis Th. Paschos:
Vertex-Uncertainty in Graph-Problems.
139-148
Electronic Edition (link) BibTeX
- Pawel Pralat:
Protean Graphs with a Variety of Ranking Schemes.
149-159
Electronic Edition (link) BibTeX
- Andreas Brandstädt, Van Bang Le:
Simplicial Powers of Graphs.
160-170
Electronic Edition (link) BibTeX
- Andreas Brandstädt, Peter Wagner:
On k-Versus (k+1)-Leaf Powers.
171-179
Electronic Edition (link) BibTeX
- Maren Martens, Martin Skutella:
Flows with Unit Path Capacities and Related Packing and Covering Problems.
180-189
Electronic Edition (link) BibTeX
- Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra Mutzel:
Strong Formulations for 2-Node-Connected Steiner Network Problems.
190-200
Electronic Edition (link) BibTeX
- Hongbing Fan, Christian Hundt, Yu-Liang Wu, Jason Ernst:
Algorithms and Implementation for Interconnection Graph Problem.
201-210
Electronic Edition (link) BibTeX
- Gerold Jäger, Paul Molitor:
Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order.
211-224
Electronic Edition (link) BibTeX
- Giacomo Nannicini, Philippe Baptiste, Daniel Krob, Leo Liberti:
Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks.
225-234
Electronic Edition (link) BibTeX
- Xiangyong Li, Yash P. Aneja, Fazle Baki:
Ant Colony Optimization Metaheuristic for the Traffic Grooming in WDM Networks.
235-245
Electronic Edition (link) BibTeX
- Shai Gutner:
Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems.
246-254
Electronic Edition (link) BibTeX
- Zhao Zhang, Xiaofeng Gao, Weili Wu:
Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph.
255-264
Electronic Edition (link) BibTeX
- Hyunwoo Jung, Mohammad Khairul Hasan, Kyung-Yong Chwa:
Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem.
265-277
Electronic Edition (link) BibTeX
- Feng Zou, Xianyue Li, Donghyun Kim, Weili Wu:
Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs.
278-285
Electronic Edition (link) BibTeX
- Zhipeng Cai, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang:
An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem.
286-295
Electronic Edition (link) BibTeX
- Peter Danziger, Eric Mendelsohn, Lucia Moura, Brett Stevens:
Covering Arrays Avoiding Forbidden Edges.
296-308
Electronic Edition (link) BibTeX
- Margaret-Ellen Messinger, Richard J. Nowakowski:
The Robot Cleans Up.
309-318
Electronic Edition (link) BibTeX
- Zhixiang Chen, Bin Fu, Minghui Jiang, Binhai Zhu:
On Recovering Syntenic Blocks from Comparative Maps.
319-327
Electronic Edition (link) BibTeX
- Leo Liberti:
Automatic Generation of Symmetry-Breaking Constraints.
328-338
Electronic Edition (link) BibTeX
- Anna Galluccio, Claudio Gentile, Paolo Ventura:
On the Stable Set Polytope of Claw-Free Graphs.
339-350
Electronic Edition (link) BibTeX
- Caterina De Simone, Anna Galluccio:
A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs.
351-360
Electronic Edition (link) BibTeX
- Andrew Baker, Joe Sawada:
Magic Labelings on Cycles and Wheels.
361-373
Electronic Edition (link) BibTeX
- Arvind Gupta, Mehdi Karimi, Eun Jung Kim, Arash Rafiey:
Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs.
374-383
Electronic Edition (link) BibTeX
- Vadim E. Levit, Eugen Mandrescu:
The Clique Corona Operation and Greedoids.
384-392
Electronic Edition (link) BibTeX
- Zhizhang Shen, Ke Qiu, Eddie Cheng:
On the Surface Area of the (n, k)-Star Graph.
393-404
Electronic Edition (link) BibTeX
- Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier:
Enumerating Isolated Cliques in Synthetic and Financial Networks.
405-416
Electronic Edition (link) BibTeX
- Bing Su, Yinfeng Xu, Peng Xiao, Lei Tian:
A Risk-Reward Competitive Analysis for the Recoverable Canadian Traveller Problem.
417-426
Electronic Edition (link) BibTeX
- Yumei Huo, Haibing Li, Hairong Zhao:
Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays.
427-437
Electronic Edition (link) BibTeX
- Karine Deschinkel, Sid Ahmed Ali Touati:
Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization.
438-447
Electronic Edition (link) BibTeX
- Andreas S. Schulz:
Stochastic Online Scheduling Revisited.
448-457
Electronic Edition (link) BibTeX
- Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra:
Delay Management Problem: Complexity Results and Robust Algorithms.
458-468
Electronic Edition (link) BibTeX
- Lichen Bao, Sergey Bereg:
Clustered SplitsNetworks.
469-478
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:02:45 2009
by Michael Ley (ley@uni-trier.de)
