Abstract is missing.
- A Polynomial Time Algorithm for Fair Resource Allocation in Resource ExchangeXiang Yan, Wei Zhu. 1-13 [doi]
- A Local Search 4/3-approximation Algorithm for the Minimum 3-path Partition ProblemYong Chen, Randy Goebel, Guohui Lin, Longcheng Liu, Bing Su, Weitian Tong, Yao Xu, An Zhang. 14-25 [doi]
- Efficient Guarding of Polygons and TerrainsPradeesha Ashok, Meghana M. Reddy. 26-37 [doi]
- Graph Orientation with Edge ModificationsYuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Sandhya T. P.. 38-50 [doi]
- Local Coloring: New Observations and New ReductionsJie You, Yixin Cao 0001, Jianxin Wang. 51-62 [doi]
- Secure Computation of Any Boolean Function Based on Any Deck of CardsKazumasa Shinagawa, Takaaki Mizuki. 63-75 [doi]
- A Novel Business Model for Electric Car SharingYukun Cheng, Xiaotie Deng, Mengqian Zhang. 76-87 [doi]
- Constructing Three Completely Independent Spanning Trees in Locally Twisted CubesKung-Jui Pai, Ruay Shiung Chang, Jou-Ming Chang, Ro-Yu Wu. 88-99 [doi]
- Read-Once Resolutions in Horn FormulasHans Kleine Büning, Piotr J. Wojciechowski, K. Subramani. 100-110 [doi]
- Vertex-Critical ( P_5 P 5 , banner)-Free GraphsQingqiong Cai, Shenwei Huang, Tao Li, Yongtang Shi. 111-120 [doi]
- An FPTAS for Stochastic Unbounded Min-Knapsack ProblemZhihao Jiang, Haoyu Zhao. 121-132 [doi]
- The Inapproximability of k-DominatingSet for Parameterized \mathsf AC^0 AC 0 CircuitsWenxing Lai. 133-143 [doi]
- Mutual Visibility by Robots with Persistent MemorySubhash Bhagat, Krishnendu Mukhopadhyaya. 144-155 [doi]
- Pushing the Online Matrix-Vector Conjecture Off-Line and Identifying Its Easy CasesLeszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Mia Persson. 156-169 [doi]
- An Improved Approximation Algorithm for the k-Means Problem with PenaltiesQilong Feng, Zhen Zhang, Feng Shi, Jianxin Wang. 170-181 [doi]