Abstract is missing.
- Algorithms for Queryable UncertaintyThomas Erlebach. 1-7 [doi]
- Genomic Scaffold Filling: A Progress ReportBinhai Zhu. 8-16 [doi]
- Better Approximation Algorithms for Scaffolding ProblemsZhi-Zhong Chen, Youta Harada, Eita Machida, Fei Guo, Lusheng Wang. 17-28 [doi]
- How to Block Blood Flow by Using Elastic CoilZihe Chen, Danyang Chen, Xiangyu Wang, Jianping Xiang, Hui Meng, Jinhui Xu 0001. 29-40 [doi]
- d Under Convex Polyhedral Distance FunctionSandip Das, Ayan Nandy, Swami Sarvottamananda. 41-52 [doi]
- Positive Zero Forcing and Edge Clique CoveringsShaun M. Fallat, Karen Meagher, Abolghasem Soltani, Boting Yang. 53-64 [doi]
- Improved Algorithms for Several Parameterized Problems Based on Random MethodsQilong Feng, Xiong Jiang, Jianxin Wang. 65-74 [doi]
- Parameterized Algorithms for Maximum Edge Biclique and Related ProblemsQilong Feng, Zeyang Zhou, Jianxin Wang. 75-83 [doi]
- The Scheduling Strategy of Virtual Machine Migration Based on the Gray Forecasting ModelHe Hong, Cao Boyan. 84-91 [doi]
- A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval GraphsXingfu Li, Haodi Feng, Haitao Jiang, Binhai Zhu. 92-101 [doi]
- Fractional Edge Cover Number of Model RBTian Liu. 102-110 [doi]
- Breaking Cycle Structure to Improve Lower Bound for Max-SATYan-Li Liu, Chumin Li, Kun He, Yi Fan. 111-124 [doi]
- On Counting Parameterized Matching and PackingYunlong Liu, Jianxin Wang. 125-134 [doi]
- Online Scheduling with Increasing Subsequence Serving ConstraintKelin Luo, Yin-Feng Xu, Xin Feng. 135-144 [doi]
- Notes on the 6/5-Approximation Algorithm for One-Sided Scaffold FillingJingjing Ma, Haitao Jiang. 145-157 [doi]
- Nonlinear Dimension Reduction by Local Multidimensional ScalingYuzhe Ma, Kun He, John E. Hopcroft, Pan Shi. 158-171 [doi]
- Mechanism Design for One-Facility Location Game with Obnoxious EffectsLili Mei, Deshi Ye, Guochuan Zhang. 172-182 [doi]
- Realtime Channel Recommendation: Switch Smartly While Watching TVLi Ning, Zhongying Zhao, Rong Zhou, Yong Zhang, Shengzhong Feng. 183-193 [doi]
- Empirical Study of Phase Transition of Hamiltonian Cycle Problem in Random Graphs with Degrees Greater Than OneWei Peng, Dongxia Wang, Xinwen Jiang. 194-204 [doi]
- Can a Breakpoint Graph be Decomposed into None Other Than 2-Cycles?Lianrong Pu, Haitao Jiang. 205-214 [doi]
- A Much Faster Branch-and-Bound Algorithm for Finding a Maximum CliqueEtsuji Tomita, Kohei Yoshida, Takuro Hatta, Atsuki Nagao, Hiro Ito, Mitsuo Wakatsuki. 215-226 [doi]
- A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the MakespanWeitian Tong, Eiji Miyano, Randy Goebel, Guohui Lin. 227-237 [doi]
- Kernelization of Two Path Searching Problems on Split GraphsYongjie Yang, Yash Raj Shrestha, Wenjun Li, Jiong Guo. 238-249 [doi]
- The Bounded Batch Scheduling with Common Due Window and Non-identical Size JobsHongluan Zhao, Guoyong Han, Gongwen Xu. 250-256 [doi]
- d)-Motifs in Biosequences Using CPU and GPU ComputingCheng Zhong, Jing Zhang, Bei Hua, Feng Yang, Zhengping Liu. 257-268 [doi]
- On the Lower Bounds of Random Max 3 and 4-SATGuangyan Zhou. 269-278 [doi]
- Finding Disjoint Dense Clubs in an Undirected GraphPeng Zou, Hui Li, Chunlin Xin, Wencheng Wang, Binhai Zhu. 279-288 [doi]