4. COCOA 2010: Kailua-Kona, HI, USA

• Matthieu Latapy, Thi Ha Duong Phan, Christophe Crespelle, Thanh Qui Nguyen:
  Termination of Multipartite Graph Series Arising from Complex Network Modelling. 1-10
  
• Andreas Emil Feldmann, Shantanu Das, Peter Widmayer:
  Simple Cuts Are Fast and Good: Optimum Right-Angled Cuts in Solid Grids. 11-20
  
• Sándor P. Fekete, Chris Gray, Alexander Kröller:
  Evacuation of Rectilinear Polygons. 21-30
  
• Ararat Harutyunyan:
  A Fast Algorithm for Powerful Alliances in Trees. 31-40
  
• Ovidiu Daescu, Wenqi Ju, Jun Luo:
  NP-Completeness of Spreading Colored Points. 41-50
  
• Loreto Gonzalez-Hernandez, Nelson Rangel-Valdez, Jose Torres-Jimenez:
  Construction of Mixed Covering Arrays of Variable Strength Using a Tabu Search Approach. 51-64
  
• Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Liberti:
  Feasibility-Based Bounds Tightening via Fixed Points. 65-76
  
• Takashi Matsuhisa:
  A Characterisation of Stable Sets in Games with Transitive Preference. 77-84
  
• Yi Shi, Maryam Hasan, Zhipeng Cai, Guohui Lin, Dale Schuurmans:
  Linear Coherent Bi-cluster Discovery via Beam Detection and Sample Set Clustering. 85-103
  
• Wlodzimierz Bielecki, Tomasz Klimek, Marek Palkowski, Anna Beletska:
  An Iterative Algorithm of Computing the Transitive Closure of a Union of Parameterized Affine Integer Tuple Relations. 104-113
  
• Guanglong Yu, Zhengke Miao, Jinlong Shu:
  Bases of Primitive Nonpowerful Sign Patterns. 114-127
  
• David Eppstein, Michael T. Goodrich, Darren Strash, Lowell Trott:
  Extended Dynamic Subgraph Statistics Using h-Index Parameterized Data Structures. 128-141
  
• Yakov Zinder, Julia Memar, Gaurav Singh:
  Discrete Optimization with Polynomially Detectable Boundaries and Restricted Level Sets. 142-156
  
• Giuseppe F. Italiano, Luigi Laura, Federico Santaroni:
  Finding Strong Bridges and Strong Articulation Points in Linear Time. 157-169
  
• Neng Fan, Panos M. Pardalos:
  Robust Optimization of Graph Partitioning and Critical Node Detection in Analyzing Networks. 170-183
  
• Vamsi Kundeti, Sanguthevar Rajasekaran, Dinh Heiu:
  An Efficient Algorithm for Chinese Postman Walk on Bi-directed de Bruijn Graphs. 184-196
  
• Yilin Shen, Dung T. Nguyen, My T. Thai:
  On the Hardness and Inapproximability of Optimization Problems on Power Law Graphs. 197-211
  
• Zhihua Yu, Qinghai Liu, Zhao Zhang:
  Cyclic Vertex Connectivity of Star Graphs. 212-221
  
• Eddie Cheng, Ke Qiu, Zhizhang Shen:
  The Number of Shortest Paths in the (n, k)-Star Graphs. 222-236
  
• Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten:
  Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems. 237-251
  
• Hongwei Du, Qiang Ye, Jioafei Zhong, Yuexuan Wang, Wonjun Lee, Haesun Park:
  PTAS for Minimum Connected Dominating Set with Routing Cost Constraint in Wireless Sensor Networks. 252-259
  
• Viet Hung Nguyen:
  A Primal-Dual Approximation Algorithm for the Asymmetric Prize-Collecting TSP. 260-269
  
• Danny Z. Chen, Ewa Misiolek:
  Computing Toolpaths for 5-Axis NC Machines. 270-284
  
• Tomoyuki Yamakami:
  A Trichotomy Theorem for the Approximate Counting of Complex-Weighted Bounded-Degree Boolean CSPs. 285-299
  
• Jin-Yi Liu:
  A Randomized Algorithm for Weighted Approximation of Points by a Step Function. 300-308
  
• Zhixiang Chen, Bin Fu:
  Approximating Multilinear Monomial Coefficients and Maximum Multilinear Monomials in Multivariate Polynomials. 309-323
  
• André Schulz, Csaba D. Tóth:
  The Union of Colorful Simplices Spanned by a Colored Point Set. 324-338
  
• Xin He, Jiun-Jie Wang, Huaming Zhang:
  Compact Visibility Representation of 4-Connected Plane Graphs. 339-353
  
• Arindam Karmakar, Sandip Das, Subhas C. Nandy, Binay K. Bhattacharya:
  Some Variations on Constrained Minimum Enclosing Circle Problem. 354-368
  
• Elmar Langetepe:
  Searching for an Axis-Parallel Shoreline. 369-384
  
• Evangelos Kranakis, Danny Krizanc, Oscar Morales Ponce, Ladislav Stacho:
  Bounded Length, 2-Edge Augmentation of Geometric Planar Graphs. 385-397
  
• Fei Li:
  Scheduling Packets with Values and Deadlines in Size-Bounded Buffers. 398-407
  
• Hans Kellerer, Alan J. Soper, Vitaly A. Strusevich:
  Transporting Jobs through a Processing Center with Two Parallel Machines. 408-422
  

Last update Thu May 24 04:15:02 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page