Abstract is missing.
- Progress in Complexity of Counting ProblemsJin-yi Cai. 1-3 [doi]
- Recent Developments in the Theory of Pre-processingMichael R. Fellows. 4-5 [doi]
- Recent Developments in the Mechanism Design Problem for SchedulingElias Koutsoupias. 6-7 [doi]
- Degree-Driven Design for Correct Geometric AlgorithmsJack Snoeyink. 8-9 [doi]
- Approximation Algorithm for the Uniform Bounded Facility ProblemKerui Weng. 10-16 [doi]
- The k-Canadian Travelers Problem with CommunicationHuili Zhang, Yinfeng Xu. 17-28 [doi]
- An Improved Competitive Algorithm for One-Dimensional Incremental Median ProblemWenqiang Dai, Yi Feng. 29-35 [doi]
- Approximation Scheme for Scheduling Resumable Proportionally Deteriorating JobsWenchang Luo, Lin Chen. 36-45 [doi]
- An Improved Approximation Algorithm for the Complementary Maximal Strip Recovery ProblemZhong Li, Randy Goebel, Lusheng Wang, Guohui Lin. 46-57 [doi]
- Greedy Routing via Embedding Graphs onto Semi-metric SpacesHuaming Zhang, Swetha Govindaiah. 58-69 [doi]
- On Variants of the Spanning Star Forest ProblemJing He, Hongyu Liang. 70-81 [doi]
- An Implicit Degree Condition for Cyclability in GraphsHao Li, Wantao Ning, Junqing Cai. 82-89 [doi]
- Parallel Enumeration of Lattice AnimalsGadi Aleksandrowicz, Gill Barequet. 90-99 [doi]
- Parameterized Edge Dominating Set in Cubic Graphs - (Extended Abstract)Mingyu Xiao, Hiroshi Nagamochi. 100-112 [doi]
- On Some Geometric Problems of Color-Spanning SetsChenglin Fan, Wenqi Ju, Jun Luo, Binhai Zhu. 113-124 [doi]
- Approximation Algorithms for Cutting a Convex Polyhedron Out of a SphereXuehou Tan, Gangshan Wu. 125-135 [doi]
- An Algorithm for Optimal Acyclic Edge-Colouring of Cubic GraphsEdita Mácajová, Ján Mazák. 136-146 [doi]
- Complexity of Total {::::k::::}-Domination and Related ProblemsJing He, Hongyu Liang. 147-155 [doi]
- The Min-Power Multicast Problems in Wireless Ad Hoc Networks: A Parameterized ViewWeizhong Luo, Jianxin Wang, Qilong Feng, Jiong Guo. 156-167 [doi]
- Constant Sum Flows in Regular GraphsTao-Ming Wang, Shi-Wei Hu. 168-175 [doi]
- 2D Knapsack: Packing SquaresMin Chen, György Dósa, Xin Han, Chenyang Zhou, Attila Benko. 176-184 [doi]
- Tight Approximation Bounds for Greedy Frugal Coverage AlgorithmsIoannis Caragiannis, Christos Kaklamanis, Maria Kyropoulou. 185-195 [doi]
- Algorithms for Interval Structures with ApplicationsDanny Z. Chen, Ewa Misiolek. 196-207 [doi]
- Single Machine Scheduling with an Operator Non-availability Period to Minimize Total Completion TimeYong Chen, An Zhang, Zhiyi Tan. 208-219 [doi]
- PSAEC: An Improved Algorithm for Short Read Error Correction Using Partial Suffix ArraysZhiheng Zhao, Jianping Yin, Yubin Zhan, Wei Xiong, Yong Li, Fayao Liu. 220-232 [doi]
- Two Hardness Results on Feedback Vertex SetsWei Jiang, Tian Liu, Tienan Ren, Ke Xu. 233-243 [doi]
- Approximation Algorithms for Unrelated Machine Scheduling with an Energy BudgetLin Chen, Wenchang Luo, Guochuan Zhang. 244-254 [doi]
- Plane-Filling Properties of Directed FiguresWlodzimierz Moczurad. 255-263 [doi]
- An Iterative Method for Generating Loop InvariantsShikun Chen, Zhoujun Li, Xiaoyu Song, Mengjun Li. 264-274 [doi]
- Algorithms for Computing Bidirectional Best Hit ::::r::::-Window Gene ClustersTrong Dao Le, Melvin Zhang, Hon Wai Leong. 275-286 [doi]
- Contracted Webgraphs: Structure Mining and Scale-FreenessYushi Uno, Fumiya Oguri. 287-299 [doi]
- Hardness of Finding Two Edge-Disjoint Min-Min Paths in DigraphsLongkun Guo, Hong Shen. 300-307 [doi]
- Online Algorithm for 1-Space Bounded Multi-dimensional Bin PackingYong Zhang, Francis Y. L. Chin, Hing-Fung Ting, Xin Han, Zhuo Chang. 308-318 [doi]
- Online Algorithms for Maximizing Weighted Throughput of Unit Jobs with Temperature ConstraintsMartin Birks, Daniel Cole, Stanley P. Y. Fung, Huichao Xue. 319-329 [doi]
- Temperature Aware Online Algorithms for Scheduling Equal Length JobsMartin Birks, Stanley P. Y. Fung. 330-342 [doi]
- Visibility Testing and CountingSharareh Alipour, Alireza Zarei. 343-351 [doi]
- The Nearest Neighbor Spearman Footrule Distance for Bucket, Interval, and Partial OrdersFranz-Josef Brandenburg, Andreas Gleißner, Andreas Hofmeier. 352-363 [doi]
- Minimum Width Rectangular AnnulusJoydeep Mukherjee, Priya Ranjan Sinha Mahapatra, Arindam Karmakar, Sandip Das. 364-374 [doi]
- An Experimental Study on Generating Planar GraphsSascha Meinert, Dorothea Wagner. 375-387 [doi]