Table of Contents

• A Binary Search Double Greedy Algorithm for Non-monotone DR-submodular MaximizationShuyang Gu, Chuangen Gao, Weili Wu 0001. 3-14 [doi]
• An Approximation Algorithm for the Clustered Path Travelling Salesman ProblemJiaxuan Zhang, Suogang Gao, Bo Hou, Wen Liu. 15-27 [doi]
• Improved Approximation Algorithm for the Asymmetric Prize-Collecting TSPBo Hou, Zhenzhen Pang, Suogang Gao, Wen Liu. 28-32 [doi]
• Approximation Scheme for Single-Machine Rescheduling with Job Delay and RejectionRuiqing Sun, Xiaofei Liu. 35-45 [doi]
• Online Early Work Maximization Problem on Two Hierarchical Machines with Buffer or RearrangementsMan Xiao, Xihua Bai, Weidong Li. 46-54 [doi]
• On-line Single Machine Scheduling with Release Dates and Submodular Rejection PenaltiesXiaofei Liu, Yaoyu Zhu, Weidong Li, Lei Ma. 55-65 [doi]
• The Optimal Dynamic Rationing Policy in the Stock-Rationing QueueQuan-Lin Li, Yi-Meng Li, Jing-Yu Ma, Heng-Li Liu. 66-82 [doi]
• The Constrained Parallel-Machine Scheduling Problem with Divisible Processing Times and PenaltiesJianping Li, Runtao Xie, Junran Lichen, Guojun Hu, Pengxiang Pan, Ping Yang. 83-95 [doi]
• Obnoxious Facility Location Games with Candidate LocationsLing Gai, Mengpei Liang, Chenhao Wang 0001. 96-105 [doi]
• Streaming Adaptive Submodular MaximizationShaoJie Tang, Jing Yuan 0002. 109-120 [doi]
• Constrained Stochastic Submodular Maximization with State-Dependent CostsShaoJie Tang. 121-132 [doi]
• Bicriteria Algorithms for Maximizing the Difference Between Submodular Function and Linear Function Under NoiseMengxue Geng, Shufang Gong, Bin Liu 0009, Weili Wu 0001. 133-143 [doi]
• Monotone k-Submodular Knapsack Maximization: An Analysis of the Greedy+Singleton AlgorithmJingwen Chen, Zhongzheng Tang, Chenhao Wang 0001. 144-155 [doi]
• Guarantees for Maximization of k-Submodular Functions with a Knapsack and a Matroid ConstraintKemin Yu, Min Li, Yang Zhou, Qian Liu. 156-167 [doi]
• Defense of Scapegoating Attack in Network TomographyXiaojia Xu, Yongcai Wang, Yu Zhang, Deying Li. 171-182 [doi]
• Adaptive Competition-Based Diversified-Profit Maximization with Online Seed AllocationLiman Du, Wenguo Yang, Suixiang Gao. 183-194 [doi]
• Collaborative Service Caching in Mobile Edge NodesZichen Wang, Hongwei Du. 195-206 [doi]
• A Decentralized Auction Framework with Privacy Protection in Mobile CrowdsourcingJianxiong Guo, Qiufen Ni, Xingjian Ding. 207-218 [doi]
• Profit Maximization for Multiple Products in Community-Based Social NetworksQiufen Ni, Jianxiong Guo. 219-230 [doi]
• MCM: A Robust Map Matching Method by Tracking Multiple Road CandidatesWanting Li, Yongcai Wang, Deying Li 0001, Xiaojia Xu. 231-243 [doi]
• Pilot Pattern Design with Branch and Bound in PSA-OFDM SystemShuchen Wang, Suixiang Gao, Wenguo Yang. 244-254 [doi]
• AoI Minimizing of Wireless Rechargeable Sensor Network Based on Trajectory Optimization of Laser-Charged UAVChuanwen Luo, Yunan Hou, Yi Hong 0003, Zhibo Chen 0004, Ning Liu, Deying Li 0001. 255-267 [doi]
• Energy-Constrained Geometric Coverage ProblemHuan Lan. 268-277 [doi]
• Incremental SDN Deployment to Achieve Load Balance in ISP NetworksYunlong Cheng, Hao Zhou, Xiaofeng Gao 0001, Jiaqi Zheng, Guihai Chen. 278-290 [doi]
• Polynomial Time Algorithm for k-vertex-edge Dominating Problem in Interval GraphsPeng Li, Aifa Wang. 293-302 [doi]
• Cyclically Orderable Generalized Petersen GraphsXiaofeng Gu, William Zhang. 303-315 [doi]
• The r-Dynamic Chromatic Number of Planar Graphs Without Special Short CyclesYuehua Bu, Ruiying Yang, Hongguo Zhu. 316-326 [doi]
• Distance Magic Labeling of the Halved Folded n-CubeYi Tian, Na Kang, Weili Wu 0001, Ding-Zhu Du, Suogang Gao. 327-338 [doi]
• Balanced Graph Partitioning Based on Mixed 0-1 Linear Programming and Iteration Vertex Relocation AlgorithmZhengxi Yang, Zhipeng Jiang, Wenguo Yang, Suixiang Gao. 339-350 [doi]
• Partial Inverse Min-Max Spanning Tree Problem Under the Weighted Bottleneck Hamming DistanceQingzhen Dong, Xianyue Li, Yu Yang. 351-362 [doi]
• Mixed Metric Dimension of Some Plane GraphsNa Kang, Zhiquan Li, Lihang Hou, Jing Qu. 363-375 [doi]
• On the Transversal Number of k-Uniform Connected HypergraphsZian Chen, Bin Chen, Zhongzheng Tang, Zhuo Diao. 376-387 [doi]
• An Improvement of the Bound on the Odd Chromatic Number of 1-Planar GraphsBei Niu, Xin Zhang 0017. 388-393 [doi]
• Fast Searching on k-Combinable GraphsYuan Xue, Boting Yang, Sandra Zilles. 394-405 [doi]
• Class Ramsey Numbers Involving Induced GraphsYan Li 0070, Ye Wang 0016. 406-412 [doi]
• Injective Edge Coloring of Power Graphs and NecklacesYuehua Bu, Wenwen Chen, Junlei Zhu. 413-420 [doi]
• Total Coloring of Planar Graphs Without Some Adjacent CyclesLiting Wang, Huijuan Wang. 421-432 [doi]
• Security on Ethereum: Ponzi Scheme Detection in Smart ContractHongliang Zhang, Jiguo Yu, Biwei Yan, Ming Jing, Jianli Zhao. 435-443 [doi]
• Learning Signed Network Embedding via Muti-attention MechanismZekun Lu, Qiancheng Yu, Xiaofeng Wang, Xiaoning Li. 444-455 [doi]
• Three Algorithms for Converting Control Flow Statements from Python to XD-MJiarui Wang, Nan Zhang, Zhenhua Duan. 456-465 [doi]
• Hyperspectral Image Reconstruction for SD-CASSI Systems Based on Residual Attention NetworkHaobin Luo, Guowei Su, Yi Wang, Jiajia Zhang, Luobing Dong. 466-475 [doi]