Abstract is missing.
- Broadcast Problem in Hypercube of TreesPuspal Bhabak, Hovhannes A. Harutyunyan. 1-12 [doi]
- Direct and Certifying Recognition of Normal Helly Circular-Arc Graphs in Linear TimeYixin Cao. 13-24 [doi]
- A Fixed-Parameter Approach for Privacy-Protection with Global RecodingKatrin Casel. 25-35 [doi]
- A Circular Matrix-Merging Algorithm with Application in VMAT Radiation TherapyDanny Z. Chen, David Craft, Lin Yang. 36-47 [doi]
- Engineering Algorithms for Workflow Satisfiability Problem with User-Independent ConstraintsDavid Cohen, Jason Crampton, Andrei Gagarin, Gregory Gutin, Mark Jones. 48-59 [doi]
- The Complexity of Zero-Visibility Cops and RobberDariusz Dereniowski, Danny Dyer, Ryan M. Tifenbach, Boting Yang. 60-70 [doi]
- Combining Edge Weight and Vertex Weight for Minimum Vertex Cover ProblemZhiwen Fang, Yang Chu, Kan Qiao, Xu Feng, Ke Xu. 71-81 [doi]
- Randomized Parameterized Algorithms for Co-path Set ProblemQilong Feng, Qian Zhou, Shaohua Li. 82-93 [doi]
- Improved LP-rounding Approximations for the k-Disjoint Restricted Shortest Paths ProblemLongkun Guo. 94-104 [doi]
- Monotone Grid Drawings of Planar GraphsMd. Iqbal Hossain, Md. Saidur Rahman 0001. 105-116 [doi]
- Spanning Distribution Forests of Graphs - (Extended Abstract)Keisuke Inoue, Takao Nishizeki. 117-127 [doi]
- A (1.408+ε)-Approximation Algorithm for Sorting Unsigned Genomes by Reciprocal TranslocationsHaitao Jiang, Lusheng Wang, Binhai Zhu, Daming Zhu. 128-140 [doi]
- Space-Efficient Approximate String Matching Allowing Inversions in Fast Average TimeHwee Kim, Yo-Sub Han. 141-150 [doi]
- Minimal Double Dominating Sets in TreesMarcin Krzywkowski. 151-157 [doi]
- Parallel-Machine Scheduling Problem under the Job Rejection Constraint - (Extended Abstract)Weidong Li, Jianping Li, Xuejie Zhang, Zhibin Chen. 158-169 [doi]
- Approximation Algorithms on Consistent Dynamic Map LabelingChung-Shou Liao, Chih-Wei Liang, Sheung-Hung Poon. 170-181 [doi]
- The PoA of Scheduling Game with Machine Activation CostsLing Lin, Yujie Yan, Xing He, Zhiyi Tan. 182-193 [doi]
- Approximation Algorithms for Bandwidth Consecutive Multicolorings - (Extended Abstract)Yuji Obata, Takao Nishizeki. 194-204 [doi]
- Improved Approximation Algorithm for Maximum Agreement Forest of Two TreesFeng Shi, Jie You, Qilong Feng. 205-215 [doi]
- Oblivious Integral Routing for Minimizing the Quadratic Polynomial CostYangguang Shi, Fa Zhang, Zhiyong Liu. 216-228 [doi]
- Finding Simple Paths on Given Points in a Polygonal RegionXuehou Tan, Bo Jiang. 229-239 [doi]
- Near Optimal Algorithms for Online Maximum Weighted b-MatchingHing-Fung Ting, Xiangzhong Xiang. 240-251 [doi]
- NP -Complete Domination, Hamiltonicity and TreewidthChaoyi Wang, Hao Chen, Zihan Lei, Ziyang Tang, Tian Liu, Ke Xu. 252-263 [doi]
- Zero-Sum Flow Numbers of Triangular GridsTao-Ming Wang, Shi-Wei Hu, Guang-Hui Zhang. 264-275 [doi]
- A Study of Pure Random Walk Algorithms on Constraint Satisfaction Problems with Growing DomainsWei Xu, Fuzhou Gong. 276-287 [doi]
- Calculating the Crossing Probability on the Square Tessellation of a Connection Game with Random Move Order: The Algorithm and Its ComplexityYi Yang, Shuigeng Zhou, Jihong Guan. 288-297 [doi]
- On Star-Cover and Path-Cover of a TreeJie You, Qilong Feng, Jiong Guo, Feng Shi. 298-308 [doi]
- On the Complexity of Constrained Sequences Alignment ProblemsYong Zhang, Joseph Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting, Deshi Ye, Feng Zhang, Jianyu Shi. 309-319 [doi]
- On the Advice Complexity of One-Dimensional Online Bin PackingXiaofan Zhao, Hong Shen. 320-329 [doi]
- Dynamic Matchings in Left Weighted Convex Bipartite GraphsQuan Zu, Miaomiao Zhang, Bin Yu. 330-342 [doi]