5. COCOA 2011: Zhangjiajie, China

• Zhixiang Chen, Bin Fu:
  The Complexity of Testing Monomials in Multivariate Polynomials. 1-15
  
• Zhixiang Chen, Bin Fu, Yang Liu, Robert T. Schweller:
  Algorithms for Testing Monomials in Multivariate Polynomials. 16-30
  
• Malek Alzaqebah, Salwani Abdullah:
  Hybrid Artificial Bee Colony Search Algorithm Based on Disruptive Selection for Examination Timetabling Problems. 31-45
  
• Ming Liu, Feifeng Zheng, Yinfeng Xu, Lu Wang:
  Heuristics for Parallel Machine Scheduling with Deterioration Effect. 46-51
  
• Fei Li:
  A Comprehensive Study of an Online Packet Scheduling Algorithm. 52-63
  
• Sheng Yu, Yinfeng Xu, Ming Liu, Feifeng Zheng:
  Optimal Policy for Single-Machine Scheduling with Deterioration Effects, Learning Effects, Setup Times, and Availability Constraints. 64-73
  
• Xiaofeng Gao, Zaixin Lu, Weili Wu, Bin Fu:
  Algebraic Algorithm for Scheduling Data Retrieval in Multi-channel Wireless Data Broadcast Environments. 74-81
  
• Iain A. Stewart:
  Hamiltonian Cycles through Prescribed Edges in k-Ary n-Cubes. 82-97
  
• Wei Ding, Guoliang Xue:
  A Fast Parallel Algorithm for Finding a Most Reliable Source on a General Ring-Tree Graph with Unreliable Edges. 98-112
  
• Qinghai Liu, Xiaohui Huang, Zhao Zhang:
  Restricted Edge Connectivity of Harary Graphs. 113-125
  
• Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten:
  Efficient Algorithms for Finding the k Most Vital Edges for the Minimum Spanning Tree Problem. 126-140
  
• Boting Yang:
  Euclidean Chains and Their Shortcuts. 141-155
  
• Seog-Jin Kim, Won-Jin Park:
  List Dynamic Coloring of Sparse Graphs. 156-162
  
• Mingyu Xiao, Hiroshi Nagamochi:
  Further Improvement on Maximum Independent Set in Degree-4 Graphs. 163-178
  
• Deying Li, Zewen Liu, Yi Hong, Wenping Chen:
  Approximation Algorithms for Minimum Energy Multicast Routing with Reception Cost in Wireless Sensor Networks. 179-191
  
• Jia He, Zhenhua Duan:
  Public Communication Based on Russian Cards Protocol: A Case Study. 192-206
  
• Hui Liu, Zewen Liu, Hongwei Du, Deying Li, Xianling Lu:
  Minimum Latency Data Aggregation in Wireless Sensor Network with Directional Antenna. 207-221
  
• Fei Li:
  A Near-Optimal Memoryless Online Algorithm for FIFO Buffering Two Packet Classes. 222-233
  
• Bang Ye Wu:
  On the Maximum Locally Clustered Subgraph and Some Related Problems. 234-246
  
• Radwa El Shawi, Joachim Gudmundsson:
  Quickest Paths in Anisotropic Media. 247-261
  
• Yukun Cheng, Wei Yu, Guochuan Zhang:
  Mechanisms for Obnoxious Facility Game on a Path. 262-271
  
• Guillaume Blin, Guillaume Fertin, Hafedh Mohamed-Babou, Irena Rusu, Florian Sikora, Stéphane Vialette:
  Algorithmic Aspects of Heterogeneous Biological Networks Comparison. 272-286
  
• Liang Ding, Bin Fu, Binhai Zhu:
  Minimum Interval Cover and Its Application to Genome Sequencing. 287-298
  
• Bin Fu, Haitao Jiang, Boting Yang, Binhai Zhu:
  Exponential and Polynomial Time Algorithms for the Minimum Common String Partition Problem. 299-310
  
• Takuya Umesato, Toshiki Saitoh, Ryuhei Uehara, Hiro Ito:
  Complexity of the Stamp Folding Problem. 311-321
  
• Leo Liberti, Benoît Masson, Jon Lee, Carlile Lavor, Antonio Mucherino:
  On the Number of Solutions of the Discretizable Molecular Distance Geometry Problem. 322-342
  
• Ernst Althaus, Bernd Becker, Daniel Dumitriu, Stefan Kupferschmid:
  Integration of an LP Solver into Interval Constraint Propagation. 343-356
  
• Deepanjan Kesh, Shashank K. Mehta:
  A Saturation Algorithm for Homogeneous Binomial Ideals. 357-371
  
• Yongding Zhu, Jinhui Xu:
  Improved Algorithms for Farthest Colored Voronoi Diagram of Segments. 372-386
  
• Chun-Cheng Lin, Sheung-Hung Poon, Shigeo Takahashi, Hsiang-Yun Wu, Hsu-Chun Yen:
  One-and-a-Half-Side Boundary Labeling. 387-398
  
• Lin Chen, Guochuan Zhang:
  Approximation Algorithms for a Bi-level Knapsack Problem. 399-410
  
• Eddie Cheng, Qiu Ke, Zhizhang Shen:
  On the Surface Area of the Asymmetric Twisted Cube. 411-423
  
• Wei Jiang, Tian Liu, Ke Xu:
  Tractable Feedback Vertex Sets in Restricted Bipartite Graphs. 424-434
  
• Yang Liu, Qing Wang:
  On the Partition of 3-Colorable Graphs. 435-447
  
• Yam Ki Cheung, Ovidiu Daescu, Marko Zivanic:
  Kinetic Red-Blue Minimum Separating Circle. 448-463
  
• Nan Zhang, Zhenhua Duan:
  A Semantic Model for Many-Core Parallel Computing. 464-479
  
• Peng Cui, Tian Liu, Ke Xu:
  On Unique Games with Negative Weights. 480-490
  
• Chaoyi Wang, Tian Liu, Peng Cui, Ke Xu:
  A Note on Treewidth in Random Graphs. 491-499
  
• Neng Fan, Qipeng P. Zheng, Panos M. Pardalos:
  On the Two-Stage Stochastic Graph Partitioning Problem. 500-509
  
• Harshavardhan Achrekar, Zheng Fang, You Li, Cindy Chen, Benyuan Liu, Jie Wang:
  A Spatio-Temporal Approach to the Discovery of Online Social Trends. 510-524
  
• Peng Zhang:
  A New Approximation Algorithm for the Selective Single-Sink Buy-at-Bulk Problem in Network Design. 525-536
  
• Jinling Liu, Hejiao Huang, Hongwei Du:
  Greedy Algorithm for Least Privilege in RBAC Model. 537-545
  
• Maggie X. Cheng, Quanmin Ye:
  Towards Minimum Delay Broadcasting and Multicasting in Multihop Wireless Networks. 546-560
  

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