Abstract is missing.
- Optimal Binary Representation of Mosaic Floorplans and Baxter PermutationsBryan He. 1-12 [doi]
- Succinct Strictly Convex Greedy Drawing of 3-Connected Plane GraphsJiun-Jie Wang, Xin He. 13-25 [doi]
- Weighted Inverse Minimum Cut Problem under the Sum-Type Hamming DistanceLongcheng Liu, Yong Chen, Biao Wu, Enyu Yao. 26-35 [doi]
- Voronoi Diagram with Visual RestrictionChenglin Fan, Jun Luo, Wencheng Wang, Binhai Zhu. 36-46 [doi]
- Minimization of the Maximum Distance between the Two Guards Patrolling a Polygonal RegionXuehou Tan, Bo Jiang. 47-57 [doi]
- On Covering Points with Minimum TurnsMinghui Jiang. 58-69 [doi]
- On Envy-Free Pareto Efficient PricingXia Hua. 70-81 [doi]
- Online Pricing for Multi-type of ItemsYong Zhang, Francis Y. L. Chin, Hing-Fung Ting. 82-92 [doi]
- Algorithms with Limited Number of Preemptions for Scheduling on Parallel MachinesYiwei Jiang, Zewei Weng, Jueliang Hu. 93-104 [doi]
- Computing Maximum Non-crossing Matching in Convex Bipartite GraphsDanny Z. Chen, Xiaomin Liu, Haitao Wang. 105-116 [doi]
- Algorithms for Bandwidth Consecutive Multicolorings of Graphs - (Extended Abstract)Kazuhide Nishikawa, Takao Nishizeki, Xiao Zhou. 117-128 [doi]
- Independent Domination on Tree Convex Bipartite GraphsYu Song, Tian Liu, Ke Xu. 129-138 [doi]
- On-Line Scheduling of Parallel Jobs in Heterogeneous Multiple ClustersDeshi Ye, Lili Mei. 139-148 [doi]
- On Multiprocessor Temperature-Aware Scheduling ProblemsEvripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli, Evangelos Markakis, Ioannis Milis. 149-160 [doi]
- Online Minimum Makespan Scheduling with a BufferYan Lan, Xin Chen, Ning Ding, György Dósa, Xin Han. 161-171 [doi]
- A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin PackingRichard Beigel, Bin Fu. 172-181 [doi]
- Multivariate Polynomial Integration and Differentiation Are Polynomial Time Inapproximable Unless P=NPBin Fu. 182-191 [doi]
- Some Remarks on the Incompressibility of Width-Parameterized SAT InstancesBangsheng Tang. 192-198 [doi]
- Kernels for Packing and Covering Problems - (Extended Abstract)Jianer Chen, Henning Fernau, Peter Shaw, Jianxin Wang, Zhibiao Yang. 199-211 [doi]
- The Worst-Case Upper Bound for Exact 3-Satisfiability with the Number of Clauses as the ParameterJunping Zhou, Minghao Yin. 212-223 [doi]
- Fixed-Parameter Tractability of almost CSP Problem with Decisive RelationsChihao Zhang, Hongyang Zhang. 224-234 [doi]
- On Editing Graphs into 2-Club ClustersHong Liu, Peng Zhang, Daming Zhu. 235-246 [doi]
- Solving Generalized Optimization Problems Subject to SMT ConstraintsFeifei Ma, Jun Yan, Jian Zhang. 247-258 [doi]
- Solving Difficult SAT Problems by Using OBDDs and Greedy Clique DecompositionYanyan Xu, Wei Chen 0018, Kaile Su, Wenhui Zhang. 259-268 [doi]
- Zero-Sum Flow Numbers of Regular GraphsTao-Ming Wang, Shi-Wei Hu. 269-278 [doi]
- More Efficient Parallel Integer SortingYijie Han, Xin He. 279-290 [doi]
- Fast Relative Lempel-Ziv Self-index for Similar SequencesHuy Hoang Do, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung. 291-302 [doi]
- A Comparison of Performance Measures via Online SearchJoan Boyar, Kim S. Larsen, Abyayananda Maiti. 303-314 [doi]
- Online Exploration of All Vertices in a Simple PolygonYuya Higashikawa, Naoki Katoh. 315-326 [doi]
- In-Place Algorithms for Computing a Largest Clique in Geometric Intersection GraphsMinati De, Subhas C. Nandy, Sasanka Roy. 327-338 [doi]
- The Black-and-White Coloring Problem on Distance-Hereditary Graphs and Strongly Chordal GraphsTon Kloks, Sheung-Hung Poon, Feng-Ren Tsai, Yue-Li Wang. 339-350 [doi]
- An Improved Approximation Algorithm for the Bandpass ProblemWeitian Tong, Randy Goebel, Wei Ding, Guohui Lin. 351-358 [doi]
- Partial Degree Bounded Edge Packing ProblemPeng Zhang. 359-367 [doi]
- Erratum: The Approximability of the Exemplar Breakpoint Distance ProblemZhixiang Chen, Bin Fu, Binhai Zhu. 368 [doi]