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