Accepted Papers

The following is the list of papers that have been accepted for COCOA 2008. The list of papers is given in arbritrary order.

1. A Parameterized Perspective on Packing Paths of Length Two
   Henning Fernau and Daniel Raible
2. New Algorithms for k-center and Extensions
   Rene Brandenberg and Lucia Roth
3. Separating Sublinear Time Computations by Approximate Diameter
   Bin Fu and Zhiyu Zhao
4. Turan Graphs, Stability Number, and Fibonacci Index
   Véronique Bruyère and Hadrien Mélot.
5. Vertex-uncertainty in Graph-problems
   Cécile Murat and Vangelis Paschos.
6. Flows with Unit Path Capacities and Related Packing and Covering Problems
   Maren Martens and Martin Skutella
7. Strong Formulations for 2-Node-Connected Steiner Network Problems
   Markus Chimani, Maria Kandyba, Ivana Ljubic and Petra Mutzel
8. Enumerating Isolated Cliques in Synthetic and Financial Networks
   Falk Hüffner, Christian Komusiewicz, Hannes Moser and Rolf Niedermeier
9. Covering Arrays Avoiding Forbidden Edges (CAFE)
   Peter Danziger, Eric Mendlesohn, Lucia Moura and Brett Stevens
10. Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
    Shai Gutner
11. Protean Graphs With a Variety of Ranking Schemes
    Pawel Pralat
12. Optimal Movement of Mobile Sensors for Barrier Coverage
    Binay Bhattacharya, Mike Burmester, Yuzhuang Hu, Evangelos Kranakis, Qiaosheng Shi and Andreas Wiese
13. Simplicial Powers of Graphs
    Andreas Brandstadt and Bang van Le
14. An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem
    Zhipeng Cai, Zhi-Zhong Chen, Guohui Lin and Lusheng Wang
15. On k- versus (k+1)-Leaf Powers
    Andreas Brandstadt and Peter Wagner
16. Going Weighted: Parameterized Algorithms for Cluster Editing
    Sebastian Boecker, Sebastian Briesemeister, Quang Bao Anh Bui and Anke Truss
17. Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs
    Feng Zou, Xianyue Li, Donghyun Kim and Weili Wu
18. Computational Study on Dominating Set Problem of Planar Graphs
    Marjan Marzban, Qianping Gu and Xiaohua Jia
19. The Robot Cleans Up
    Margaret-Ellen Messinger and R.J. Nowakowski
20. On the Stable Set Polytope of Claw-Free Graphs
    Anna Galluccio, Claudio Gentile and Paolo Ventura
21. Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems
    Nadja Betzler and Johannes Uhlmann
22. Parameterized Graph Editing with Chosen Vertex Degrees
    Luke Mathieson and Stefan Szeider
23. A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs that are Join of Regular Graphs
    Caterina De Simone and Anna Galluccio
24. Multiple Hypernode Hitting Sets and Smallest Two-cores with Targets
    Peter Damaschke
25. Fixed-Parameter Tractability of Anonymizing Data by Suppressing Entries
    Rhonda Chaytor, Patricia Evans and Todd Wareham
26. An Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem
    Hyunwoo Jung, Mohammad Khairul Hasan and Kyung-Yong Chwa
27. Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph
    Zhao Zhang, Xiaofeng Gao and Weili Wu
28. Magic Labelings on Cycles and Wheels
    Andrew Baker and Joe Sawada
29. Clustered SplitsNetworks
    Lichen Bao and Sergey Bereg
30. Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs
    Mehdi Karimi, Arvind Gupta, Arash Rafiey and Eun Jung Kim
31. Fast Computation of Point-to-Point Paths on Time-dependent Road Networks
    Giacomo Nannicini, Philippe Baptiste, Daniel Krob and Leo Liberti
32. Parameterized Algorithms for Generalized Domination
    Venkatesh Raman, Saket Saurabh and Sriganesh Srihari
33. Delay Management Problem: Complexity Results and Robust Algorithms
    Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni and Alfredo Navarra
34. A Risk-Reward Competitive Analysis for the Recoverable Canadian Traveler Problem
    Bing Su, Yinfeng Xu, Peng Xiao and Lei Tian
35. Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization
    Karine Deschinkel and Sid-Ahmed-Ali Touati
36. Minimizing Total Completion Time in Two-Machine Flow Shops With Exact Delay
    Hairong Zhao, Yumei Huo and Haibing Li
37. Stochastic Online Scheduling Revisited
    Andreas S. Schulz
38. The Clique Corona Operation and Greedoids
    Vadim Levit and Eugen Mandrescu
39. On the Surface Area of the (n, k)-Star Graph
    Zhi Zhang Shen, Ke Qiu and Eddie Cheng
40. Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order
    Gerold Jaeger and Paul Molitor
41. Automatic Generation of Symmetry-breaking Constraints
    Leo Liberti
42. Algorithms and Implementation for Interconnection Graph Problem
    Hongbing Fan, Christian Hundt, Yu-Liang Wu and Jason Ernst
43. Ant Colony Optimization Metaheuristic For Traffic Grooming in WDM Networks
    Xiangyong Li, Yash Aneja and Fazle Baki
44. On Recovering Syntenic Blocks from Comparative Maps
    Zhixiang Chen, Bin Fu, Minghui Jiang, and Binhai Zhu