4. FAW 2010: Wuhan, China

• Kurt Mehlhorn, Pascal Schweitzer:
  Progress on Certifying Algorithms. 1-5
  
• Mikhail J. Atallah:
  Computational Geometry for Uncertain Data - (Abstract of Keynote Talk). 6
  
• Deyi Li, Haisu Zhang, Yuchao Liu, Guisheng Chen:
  On Foundations of Services Interoperation in Cloud Computing. 7-10
  
• Xiaotie Deng, Yang Sun, Ming Yin, Yunhong Zhou:
  Mechanism Design for Multi-slot Ads Auction in Sponsored Search Markets. 11-22
  
• Qiang Zhang, Minming Li:
  Truthful Auction for CPU Time Slots. 23-34
  
• Qizhi Fang, Han Xiao, Shanfeng Zhu:
  Top-d Rank Aggregation in Web Meta-search Engine - (Extended Abstract). 35-44
  
• Haitao Jiang, Binhai Zhu, Daming Zhu, Hong Zhu:
  Minimum Common String Partition Revisited. 45-52
  
• Minghui Jiang:
  Inapproximability of Maximal Strip Recovery: II. 53-64
  
• Yunlong Liu, Xiaodong Wu:
  Minimizing Total Variation for Field Splitting with Feathering in Intensity-Modulated Radiation Therapy. 65-76
  
• Bin Fu, Yumei Huo, Hairong Zhao:
  Approximation Schemes for Scheduling with Availability Constraints. 77-88
  
• Regant Y. S. Hung, Hing-Fung Ting:
  An W(\frac1e log\frac1e)\Omega(\frac{1}{\varepsilon} \log \frac{1}{\varepsilon}) Space Lower Bound for Finding epsilon-Approximate Quantiles in a Data Stream. 89-100
  
• Liang Ding, Bin Fu, Yunhui Fu:
  Improved Sublinear Time Algorithm for Width-Bounded Separators. 101-112
  
• Bingbing Zhuang, Hiroshi Nagamochi:
  Constant Time Generation of Biconnected Rooted Plane Graphs. 113-123
  
• Gill Barequet, Shahar Tal:
  Solving General Lattice Puzzles. 124-135
  
• Faisal N. Abu-Khzam, Michael A. Langston, Amer E. Mouawad, Clinton P. Nolan:
  A Hybrid Graph Representation for Recursive Backtracking Algorithms. 136-147
  
• Jin-yi Cai, Xi Chen, Richard J. Lipton, Pinyan Lu:
  On Tractable Exponential Sums. 148-159
  
• Minghui Jiang:
  Recognizing d-Interval Graphs and d-Track Interval Graphs. 160-171
  
• Zhen You, Jinyun Xue, Shi Ying:
  Categorial Semantics of a Solution to Distributed Dining Philosophers Problem. 172-184
  
• Mong-Jen Kao, Han-Lin Chen:
  Approximation Algorithms for the Capacitated Domination Problem. 185-196
  
• Chaoxia Yang, Guojun Li:
  A Polynomial Time Approximation Scheme for Embedding Hypergraph in a Weighted Cycle. 197-209
  
• Mingyu Xiao, Takuro Fukunaga, Hiroshi Nagamochi:
  FPTAS's for Some Cut Problems in Weighted Trees. 210-221
  
• Joseph Wun-Tat Chan, Francis Y. L. Chin, Xin Han, Ka-Cheong Lam, Hing-Fung Ting, Yong Zhang:
  Deterministic Online Call Control in Cellular Networks and Triangle-Free Cellular Networks. 222-233
  
• Peter Sempolinski, Amitabh Chaudhary:
  Online Algorithms for the Newsvendor Problem with and without Censored Demands. 234-249
  
• Liang Ding, Bin Fu, Yunhui Fu, Zaixin Lu, Zhiyu Zhao:
  O((logn)²) Time Online Approximation Schemes for Bin Packing and Subset Sum Problems. 250-261
  
• Emilie Diot, Cyril Gavoille:
  Path Separability of Graphs. 262-273
  
• Takehiro Ito, Naoki Sakamoto, Xiao Zhou, Takao Nishizeki:
  Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings. 274-284
  
• Rudolf Fleischer, Xiaoming Xu:
  Computing Minimum Diameter Color-Spanning Sets. 285-292
  
• Wenqi Ju, Jun Luo:
  Approximation Algorithm for the Largest Area Convex Hull of Same Size Non-overlapping Axis-Aligned Squares. 293-303
  
• Xuehou Tan, Bo Jiang:
  Optimum Sweeps of Simple Polygons with Two Guards. 304-315
  
• Hee-Kap Ahn, Yoshio Okamoto:
  Adaptive Algorithms for Planar Convex Hull Problems. 316-326
  
• Xuehou Tan, Gangshan Wu:
  New Algorithms for Barrier Coverage with Mobile Sensors. 327-338
  

Last update Fri May 25 08:13:59 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page