Table of Contents

• Routing Among Convex Polygonal Obstacles in the PlaneR. Inkulu, Pawan Kumar. 1-11 [doi]
• Target Coverage with Minimum Number of Camera SensorsPei-yao, Longkun Guo, Shuangjuan Li, Huihong Peng. 12-24 [doi]
• Two-Stage Submodular Maximization Under CurvatureYanzhi Li, Zhicheng Liu, Chuchu Xu, Ping Li, Hong Chang, Xiaoyan Zhang. 25-34 [doi]
• An Improved Approximation Algorithm for Capacitated Correlation Clustering ProblemSai Ji, Yukun Cheng, Jingjing Tan, Zhongrui Zhao. 35-45 [doi]
• The Selection of COVID-19 Epidemic Prevention and Control Programs Based on Group Decision MakingChunsheng Cui, Baiqiu Li, Liu Wang. 46-60 [doi]
• Which Option Is a Better Way to Improve Transfer Learning Performance?Honghui Xu, Zhipeng Cai, Wei Li. 61-74 [doi]
• On Maximizing the Difference Between an Approximately Submodular Function and a Linear Function Subject to a Matroid ConstraintYijing Wang, Yicheng Xu, Xiaoguang Yang. 75-85 [doi]
• On Various Open-End Bin Packing GameLing Gai, Weiwei Zhang, Wenchang Luo, Yukun Cheng. 86-95 [doi]
• A Linear-Time Streaming Algorithm for Cardinality-Constrained Maximizing Monotone Non-submodular Set FunctionsMin Cui, Donglei Du, Ling Gai, Ruiqi Yang. 96-110 [doi]
• Approximation Algorithms for Two Parallel Dedicated Machine Scheduling with Conflict ConstraintsAn Zhang, Liang Zhang, Yong Chen 0002, Guangting Chen, Xing Wang. 111-124 [doi]
• Computing the One-Visibility Cop-Win Strategies for TreesBoting Yang. 125-139 [doi]
• Complexity and Approximation Results on the Shared Transportation ProblemTom Davot, Rodolphe Giroudeau, Jean-Claude König. 140-151 [doi]
• The Complexity of Finding Optimal Subgraphs to Represent Spatial CorrelationJessica A. Enright, Duncan Lee, Kitty Meeks, William Pettersson, John Sylvester. 152-166 [doi]
• New Approximation Algorithms for the Rooted Budgeted Cycle Cover ProblemJiangkun Li, Peng Zhang 0008. 167-179 [doi]
• Evolutionary Equilibrium Analysis for Decision on Block Size in Blockchain SystemsJinmian Chen, Yukun Cheng, Zhiqi Xu, Yan Cao. 180-194 [doi]
• Efficient Algorithms for Scheduling Parallel Jobs with Interval Constraints in CloudsXuanming Xu, Longkun Guo. 195-202 [doi]
• Two-Stage Stochastic Max-Weight Independent Set ProblemsMin Li, Qian Liu, Yang Zhou 0018. 203-213 [doi]
• Routing and Scheduling Problems with Two Agents on a Line-Shaped NetworkHao Yan, Xiwen Lu. 214-223 [doi]
• The Price of Anarchy of Generic Valid Utility SystemsYin Yang, Qingqin Nong, Suning Gong, Jingwen Du, Yumei Liang. 224-233 [doi]
• Single Machine Scheduling with Rejection and Generalized ParametersXue Yu, Lingfa Lu, Liqi Zhang. 234-246 [doi]
• Approximation Algorithm and Hardness Results for Defensive Domination in GraphsMichael A. Henning, Arti Pandey, Vikash Tripathi. 247-261 [doi]
• An Improved Physical ZKP for NonogramSuthee Ruangwises. 262-272 [doi]
• Finding All Leftmost Separators of Size $\le k$Mahdi Belbasi, Martin Fürer. 273-287 [doi]
• Maximize the Probability of Union-Influenced in Social NetworksGuoyao Rao, Yongcai Wang, Wenping Chen, Deying Li 0001, Weili Wu 0001. 288-301 [doi]
• A Novel Algorithm for Max Sat Calling MOCE to OrderDaniel Berend, Shahar Golan, Yochai Twitto. 302-317 [doi]
• The Smallest Number of Vertices in a 2-Arc-Strong Digraph Without Pair of Arc-Disjoint In- and Out-BranchingsRan Gu, Gregory Z. Gutin, Shasha Li, Yongtang Shi, Zhenyu Taoqiu. 318-332 [doi]
• Generalized Self-profit Maximization in Attribute NetworksLiman Du, Wenguo Yang, Suixiang Gao. 333-347 [doi]
• Parameterized Complexity Classes Defined by Threshold Circuits: Using Sorting Networks to Show Collapses with W-hierarchy ClassesRaffael M. Paranhos, Janio Carlos Nascimento Silva, Uéverton S. Souza, Luiz Satoru Ochi. 348-363 [doi]
• Maximization of Monotone Non-submodular Functions with a Knapsack Constraint over the Integer LatticeJingjing Tan, Fengmin Wang, Xiaoqing Zhang, Yang Zhou. 364-373 [doi]
• Sublinear-Time Reductions for Big Data ComputingXiangyu Gao, Jian-Zhong Li 0001, Dongjing Miao. 374-388 [doi]
• ∞ -normXianyue Li, Ruowang Yang, Heping Zhang, Zhao Zhang 0002. 389-399 [doi]
• Approximation Algorithms for Some Min-Max and Minimum Stacker Crane Cover ProblemsYuhui Sun, Wei Yu 0011, Zhaohui Liu 0001. 400-415 [doi]
• Succinct Data Structures for Series-Parallel, Block-Cactus and 3-Leaf Power GraphsSankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane, Srinivasa Rao Satti. 416-430 [doi]
• Streaming Submodular Maximization Under Differential Privacy NoiseDi Xiao, Longkun Guo, Kewen Liao, Pei-yao. 431-444 [doi]
• Online Bottleneck Semi-matchingMan Xiao, Shu Zhao, Weidong Li 0002, Jinhua Yang. 445-455 [doi]
• Optimal Due Date Assignment Without Restriction and Convex Resource Allocation in Group Technology SchedulingYing Chen, Yongxi Cheng. 456-467 [doi]
• Constrained Stable Marriage with Free Edges or Few Blocking PairsYinghui Wen, Jiong Guo. 468-483 [doi]
• Backgammon Is HardR. Teal Witter. 484-496 [doi]
• Two-Facility Location Games with a Minimum Distance Requirement on a CircleXiaoyu Wu, Lili Mei, Guochuan Zhang. 497-511 [doi]
• Open Shop Scheduling Problem with a Non-resumable Flexible Maintenance PeriodYuan Yuan, Xin Han, XinBo Liu, Yan Lan. 512-526 [doi]
• Parallel Algorithm for Minimum Partial Dominating Set in Unit Disk GraphWeizhi Hong, Zhao Zhang 0002, Yingli Ran. 527-537 [doi]
• An Improved Approximation Algorithm for Squared Metric k-Facility LocationZhen Zhang 0024, Qilong Feng. 538-552 [doi]
• Parameterized Algorithms for Linear Layouts of Graphs with Respect to the Vertex Cover NumberYunlong Liu, Yixuan Li, Jingui Huang. 553-567 [doi]
• The Fractional k-truncated Metric Dimension of GraphsEunjeong Yi. 568-578 [doi]
• On Structural Parameterizations of the Offensive Alliance ProblemAjinkya Gaikwad, Soumen Maity. 579-586 [doi]
• On the k-colored Rainbow Sets in Fixed DimensionsVahideh Keikha, Hamidreza Keikha, Ali Mohades. 587-601 [doi]
• Cycle-Connected Mixed Graphs and Related ProblemsJunran Lichen. 602-614 [doi]
• Directed Width Parameters on Semicomplete DigraphsFrank Gurski, Dominique Komander, Carolin Rehs, Sebastian Wiederrecht. 615-628 [doi]
• Improved Parameterized Approximation for Balanced k-MedianZhen Zhang 0024, Qilong Feng. 629-640 [doi]
• A LP-based Approximation Algorithm for generalized Traveling Salesperson Path ProblemJian Sun, Gregory Z. Gutin, Xiaoyan Zhang. 641-652 [doi]
• Hardness Results of Connected Power Domination for Bipartite Graphs and Chordal GraphsPooja Goyal, B. S. Panda 0001. 653-667 [doi]
• Approximation Algorithm for Min-Max Correlation Clustering Problem with OutliersSai Ji, Min Li, Mei Liang, Zhenning Zhang. 668-675 [doi]
• Delay-Constrained Minimum Shortest Path Trees and Related ProblemsJunran Lichen, Lijian Cai, Jianping Li, Suding Liu, Pengxiang Pan, Wencheng Wang. 676-686 [doi]
• On the Feedback Number of 3-Uniform Linear Extremal HypergraphsZhongzheng Tang, Yucong Tang, Zhuo Diao. 687-700 [doi]
• A Multi-pass Streaming Algorithm for Regularized Submodular MaximizationQinqin Gong, Suixiang Gao, Fengmin Wang, Ruiqi Yang. 701-711 [doi]