Abstract is missing.
- The Complexity of Testing Monomials in Multivariate PolynomialsZhixiang Chen, Bin Fu. 1-15 [doi]
- Algorithms for Testing Monomials in Multivariate PolynomialsZhixiang Chen, Bin Fu, Yang Liu, Robert T. Schweller. 16-30 [doi]
- Hybrid Artificial Bee Colony Search Algorithm Based on Disruptive Selection for Examination Timetabling ProblemsMalek Alzaqebah, Salwani Abdullah. 31-45 [doi]
- Heuristics for Parallel Machine Scheduling with Deterioration EffectMing Liu, Feifeng Zheng, Yinfeng Xu, Lu Wang. 46-51 [doi]
- A Comprehensive Study of an Online Packet Scheduling AlgorithmFei Li. 52-63 [doi]
- Optimal Policy for Single-Machine Scheduling with Deterioration Effects, Learning Effects, Setup Times, and Availability ConstraintsSheng Yu, Yinfeng Xu, Ming Liu, Feifeng Zheng. 64-73 [doi]
- Algebraic Algorithm for Scheduling Data Retrieval in Multi-channel Wireless Data Broadcast EnvironmentsXiaofeng Gao, Zaixin Lu, Weili Wu, Bin Fu. 74-81 [doi]
- Hamiltonian Cycles through Prescribed Edges in ::::k::::-Ary ::::n::::-CubesIain A. Stewart. 82-97 [doi]
- A Fast Parallel Algorithm for Finding a Most Reliable Source on a General Ring-Tree Graph with Unreliable EdgesWei Ding, Guoliang Xue. 98-112 [doi]
- Restricted Edge Connectivity of Harary GraphsQinghai Liu, Xiaohui Huang, Zhao Zhang. 113-125 [doi]
- Efficient Algorithms for Finding the ::::k:::: Most Vital Edges for the Minimum Spanning Tree ProblemCristina Bazgan, Sonia Toubaline, Daniel Vanderpooten. 126-140 [doi]
- Euclidean Chains and Their ShortcutsBoting Yang. 141-155 [doi]
- List Dynamic Coloring of Sparse GraphsSeog-Jin Kim, Won-Jin Park. 156-162 [doi]
- Further Improvement on Maximum Independent Set in Degree-4 GraphsMingyu Xiao, Hiroshi Nagamochi. 163-178 [doi]
- Approximation Algorithms for Minimum Energy Multicast Routing with Reception Cost in Wireless Sensor NetworksDeying Li, Zewen Liu, Yi Hong, Wenping Chen. 179-191 [doi]
- Public Communication Based on Russian Cards Protocol: A Case StudyJia He, Zhenhua Duan. 192-206 [doi]
- Minimum Latency Data Aggregation in Wireless Sensor Network with Directional AntennaHui Liu, Zewen Liu, Hongwei Du, Deying Li, XianLing Lu. 207-221 [doi]
- A Near-Optimal Memoryless Online Algorithm for FIFO Buffering Two Packet ClassesFei Li. 222-233 [doi]
- On the Maximum Locally Clustered Subgraph and Some Related ProblemsBang Ye Wu. 234-246 [doi]
- Quickest Paths in Anisotropic MediaRadwa El Shawi, Joachim Gudmundsson. 247-261 [doi]
- Mechanisms for Obnoxious Facility Game on a PathYukun Cheng, Wei Yu, Guochuan Zhang. 262-271 [doi]
- Algorithmic Aspects of Heterogeneous Biological Networks ComparisonGuillaume Blin, Guillaume Fertin, Hafedh Mohamed-Babou, Irena Rusu, Florian Sikora, Stéphane Vialette. 272-286 [doi]
- Minimum Interval Cover and Its Application to Genome SequencingLiang Ding, Bin Fu, Binhai Zhu. 287-298 [doi]
- Exponential and Polynomial Time Algorithms for the Minimum Common String Partition ProblemBin Fu, Haitao Jiang, Boting Yang, Binhai Zhu. 299-310 [doi]
- Complexity of the Stamp Folding ProblemTakuya Umesato, Toshiki Saitoh, Ryuhei Uehara, Hiro Ito. 311-321 [doi]
- On the Number of Solutions of the Discretizable Molecular Distance Geometry ProblemLeo Liberti, Benoît Masson, Jon Lee, Carlile Lavor, Antonio Mucherino. 322-342 [doi]
- Integration of an LP Solver into Interval Constraint PropagationErnst Althaus, Bernd Becker, Daniel Dumitriu, Stefan Kupferschmid. 343-356 [doi]
- A Saturation Algorithm for Homogeneous Binomial IdealsDeepanjan Kesh, Shashank K. Mehta. 357-371 [doi]
- Improved Algorithms for Farthest Colored Voronoi Diagram of SegmentsYongding Zhu, Jinhui Xu. 372-386 [doi]
- One-and-a-Half-Side Boundary LabelingChun-Cheng Lin, Sheung-Hung Poon, Shigeo Takahashi, Hsiang-Yun Wu, Hsu-Chun Yen. 387-398 [doi]
- Approximation Algorithms for a Bi-level Knapsack ProblemLin Chen, Guochuan Zhang. 399-410 [doi]
- On the Surface Area of the Asymmetric Twisted CubeEddie Cheng, Qiu Ke, Zhizhang Shen. 411-423 [doi]
- Tractable Feedback Vertex Sets in Restricted Bipartite GraphsWei Jiang, Tian Liu, Ke Xu. 424-434 [doi]
- On the Partition of 3-Colorable GraphsYang Liu, Qing Wang. 435-447 [doi]
- Kinetic Red-Blue Minimum Separating CircleYam Ki Cheung, Ovidiu Daescu, Marko Zivanic. 448-463 [doi]
- A Semantic Model for Many-Core Parallel ComputingNan Zhang, Zhenhua Duan. 464-479 [doi]
- On Unique Games with Negative WeightsPeng Cui, Tian Liu, Ke Xu. 480-490 [doi]
- A Note on Treewidth in Random GraphsChaoyi Wang, Tian Liu, Peng Cui, Ke Xu. 491-499 [doi]
- On the Two-Stage Stochastic Graph Partitioning ProblemNeng Fan, Qipeng P. Zheng, Panos M. Pardalos. 500-509 [doi]
- A Spatio-Temporal Approach to the Discovery of Online Social TrendsHarshavardhan Achrekar, Zheng Fang, You Li, Cindy Chen, Benyuan Liu, Jie Wang. 510-524 [doi]
- A New Approximation Algorithm for the Selective Single-Sink Buy-at-Bulk Problem in Network DesignPeng Zhang 0008. 525-536 [doi]
- Greedy Algorithm for Least Privilege in RBAC ModelJinling Liu, Hejiao Huang, Hongwei Du. 537-545 [doi]
- Towards Minimum Delay Broadcasting and Multicasting in Multihop Wireless NetworksMaggie X. Cheng, Quanmin Ye. 546-560 [doi]