Abstract is missing.
- Graph Modification Problems: A Modern PerspectiveFedor V. Fomin, Saket Saurabh, Neeldhara Misra. 3-6 [doi]
- Soft Subdivision Search in Motion Planning, II: AxiomaticsChee-Keng Yap. 7-22 [doi]
- On r-Gatherings on the LineToshihiro Akagi, Shin-Ichi Nakano. 25-32 [doi]
- A New Algorithm for Intermediate Dataset Storage in a Cloud-Based DataflowJie Cheng, Daming Zhu, Binhai Zhu. 33-44 [doi]
- Efficient Computation of the Characteristic Polynomial of a Threshold GraphMartin Fürer. 45-51 [doi]
- A Fast and Practical Method to Estimate Volumes of Convex PolytopesCunjing Ge, Feifei Ma. 52-65 [doi]
- Social Models and Algorithms for Optimization of Contact Immunity of Oral Polio VaccineChengwei Guo, Chenglong Ma, Shengyu Zhang. 66-77 [doi]
- The Directed Dominating Set Problem: Generalized Leaf Removal and Belief PropagationYusupjan Habibulla, Jin Hua Zhao, Hai-Jun Zhou. 78-88 [doi]
- A Linear Time Algorithm for Ordered PartitionYijie Han. 89-103 [doi]
- Machine Scheduling with a Maintenance Interval and Job Delivery CoordinationJueliang Hu, Taibo Luo, Xiaotong Su, Jianming Dong, Weitian Tong, Randy Goebel, Yinfeng Xu, Guohui Lin. 104-114 [doi]
- Lower and Upper Bounds for Random Mimimum Satisfiability ProblemPing Huang, Kaile Su. 115-124 [doi]
- On Solving Systems of Diagonal Polynomial Equations Over Finite FieldsGábor Ivanyos, Miklos Santha. 125-137 [doi]
- Pattern Backtracking Algorithm for the Workflow Satisfiability Problem with User-Independent ConstraintsDaniel Karapetyan, Andrei V. Gagarin, Gregory Gutin. 138-149 [doi]
- On the Sound Covering Cycle Problem in Paired de Bruijn GraphsChristian Komusiewicz, Andreea Radulescu. 150-161 [doi]
- Approximation Algorithms for the Multilevel Facility Location Problem with Linear/Submodular PenaltiesGaidi Li, Dachuan Xu, Donglei Du, Chenchen wu. 162-169 [doi]
- Smaller Kernels for Several FPT Problems Based on Simple ObservationsWenjun Li, Shuai Hu. 170-179 [doi]
- Parameterized Minimum Cost Partition of a Tree with Supply and DemandMugang Lin, Wenjun Li, Qilong Feng. 180-189 [doi]
- The Online Storage Strategy for Automated Storage and Retrieval System with Single Open in One DimensionHenan Liu, Yinfeng Xu. 190-197 [doi]
- Union Closed Tree Convex SetsTian Liu, Ke Xu. 198-203 [doi]
- Fast Quantum Algorithms for Least Squares Regression and Statistic Leverage ScoresYang Liu, Shengyu Zhang. 204-216 [doi]
- A New Distributed Algorithm for Computing a Dominating Set on GridsPhotchchara Pisantechakool, Xuehou Tan. 217-228 [doi]
- Approximate Model Counting via Extension RuleJinyan Wang, Minghao Yin, Jingli Wu. 229-240 [doi]
- Improved Information Set Decoding for Code-Based Cryptosystems with Constrained MemoryMaoning Wang, Mingjie Liu. 241-258 [doi]
- Truthful Strategy and Resource Integration for Multi-tenant Data Center Demand ResponseYoushi Wang, Fa Zhang, Zhiyong Liu. 259-270 [doi]
- Local Search to Approximate Max NAE- k k -Sat TightlyAiyong Xian, Kaiyuan Zhu, Daming Zhu, Lianrong Pu. 271-281 [doi]
- Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in GraphsMingyu Xiao, Shaowei Kou. 282-293 [doi]
- Enumeration, Counting, and Random Generation of Ladder LotteriesKatsuhisa Yamanaka, Shin-Ichi Nakano. 294-303 [doi]
- Efficient Modular Reduction Algorithm Without Correction PhaseHaibo Yu, Guoqiang Bai, Huikang Hao. 304-313 [doi]
- Super Solutions of Random Instances of SatisfiabilityPeng Zhang, Yong Gao. 314-325 [doi]
- A Data Streams Analysis Strategy Based on Hadoop Scheduling Optimization for Smart Grid ApplicationFengquan Zhou, Xin Song, Yinghua Han, Jing Gao. 326-333 [doi]