Accepted Papers

---

• Investigating the $3$-Path Vertex Cover polytope in trees
  Anand Subramani, Ramaswamy Chandrasekaran and K. Subramani
  
  
• The Rounding Algorithm for Fuzzy Uncapacitated Facility Location Problem
  Yiyun Jiang, Qian Liu, Yang Zhou and Min Li
  
  
• On the constrained windy postman problem
  Jianping Li, Xiaoxiao Yang, Wei Li, Runtao Xie, Ping Yang and Li Fang
  
  
• Modeling wireless routing problems using colored digraphs
  Anand Subramani, Piotr Wojciechowski and K. Subramani
  
  
• The Regularized Chebyshev-Halley Method with Global Convergence
  Huan Gao, Haibin Zhang, Jianyu Xiao and Zhibao Li
  
  
• The Bichromatic Two-Center Problem on Graphs
  Qi Sun and Jingru Zhang
  
  
• An analysis of the All Or None Maximum Dissociation Set problem
  Anand Subramani and K. Subramani
  
  
• Graph-based Scheduling in multi-trees with {1,L}-Task Weights
  Yanzhi Li, Junran Yu, Donglei Du and Xiaoyan Zhang
  
  
• A Best Possible Online Algorithm for Scheduling with an Unexpected Machine Unavailable Interval
  Ran Ma, Sainan Guo, Juannian Xu and Xiaoyan Zhang
  
  
• An improved local improvement algorithm for $k^-$-star partition
  Mingyang Gong, Guohui Lin and Brendan Mumey
  
  
• A 1/2-Approximation Algorithm on k-Correlation Clustering of Uniform Hypergraphs
  Zhongzheng Tang, Yaxuan Li and Zhuo Diao
  
  
• On the $f$-clustered prize-collecting traveling salesman problem
  Jianping Li and Hong Li
  
  
• Parameterized Approximations for the $k$-Center and $k$-Supplier Problems in General Finite-Dimensional Normed Linear Space
  Wei Ding, Guangting Chen and Yu Zhou
  
  
• Multi-Objective Evolutionary Algorithm for k-Submodular Maximization with a Knapsack Constraint
  Heqing Li, Min Li, Yang Zhou and Qian Liu
  
  
• Combinatorial approximation algorithms for solving bottleneck $k$-assignment problems
  Junran Lichen, Yafei Liu, Shuwen Ge and Jean Yeh
  
  
• Approximation Algorithms for Single-machine Scheduling with Weighted Makespan and General Penalties
  Guojun Hu and Binchao Huang
  
  
• Collision-free Exploration by Mobile Agents with Pebbles in Tree Networks and Grids
  Bibhuti Das, Sajal K. Das, Amit Kumar Dhar, Barun Gorain and Madhuri Mahawar
  
  
• Single machine scheduling subject to a restricted job rejection constraint in cloud-edge collaborative computing
  Yanzhou Zuo, Lin Chen and Wenchang Luo
  
  
• Semi-Supervised Graph Attention Regression with Pseudo-Labeling for Large-Scale Seismic Data
  Yanfeng Zhang and Lingchen Kong
  
  
• Online Busy Time Scheduling with Flexible Jobs
  Susanne Albers and Wessel van der Heijden
  
  
• Fast Algorithms for Correlation Clustering with Partition Size Constraints
  Nathan Cordner and George Kollios
  
  
• Broadcasting in Fully Connected Cliques
  Akash Ambashankar and Hovhannes Harutyunyan
  
  
• An approximation algorithm based on LP rounding for the capacitated power cover problem
  Jiaming Zhang and Zhikang Zhang
  
  
• Beyond Prime Implicants: Explaining Satisfiability with Prime Partitions
  Guillaume Escamocher and Barry O'Sullivan
  
  
• Job Scheduling to Minimize Peak Demand Above a Resource Curve
  Caleb Eardley, Joseph Barrows, Marshall Axsom, Alec Kyritsis and Sean Yaw
  
  
• On Some Structural Insights of $(p+1)K_2$-Saturated Graphs
  Hanchun Yuan and Zhen Zhang
  
  
• Approximation Algorithms for the Metric Maximum-Weight $k$-Star Partition Problem
  Na Han, Wei Yu and Zhaohui Liu
  
  
• Partial inverse optimal value problem on minimum spanning tree
  Xiaowen Kong, Xianyue Li, Shujun Li and Zongze Xing
  
  
• Incentive Compatible Auctions for Digital Goods with Externalities
  Miao Li, Zixin Gu, Yukun Cheng, Jie Zhang and Dengji Zhao
  
  
• Facility Location Games for Multi-Location Agents with Satisfaction
  Huanjun Wang, Qizhi Fang and Wenjing Liu
  
  
• Rounding Two Dimensional Solutions of the SDP Relaxation of Quantum Generalization of Max Cut
  Guangfeng Li, Deren Han, Donglei Du, Jian Sun and Xiaoyan Zhang
  
  
• Identical scheduling game problem of m machines with two hierarchies
  Liu Xin and Guan Li
  
  
• An efficient Moss Growth Optimization algorithm for the task mapping problem in the Network-on-Chip design
  Tingting Zhu, Sun Jie, Yao Lei and Zijun Wu
  
  
• Parallel Dynamic Complexity of Maintaining Count of Spanning Trees
  Anuj Tawari
  
  
• LWT-XNet : A Skin Lesion Segmentation Network with Learnable Wavelet Transform Integration
  Xincheng Tian and Xiaoyun Tian
  
  
• Traub and Vygen Algorithm for the Asymmetric Traveling Salesman Problem: Implementation and Experimental Analysis
  Ksenia Rizhenko, Daniil Khachai and Michael Khachay
  
  
• Polynomial time algorithm for a Bi-objective Spanning Star Forest Problem on Trees
  Thanh Loan Nguyen and Viet Hung Nguyen
  
  
• Approximation schemes for early work scheduling on hierarchical identical parallel machines with a common due date
  Qingyu Luo and Ruiqing Sun
  
  
• Multitasking Parallel-Machine Scheduling with Due-Window and Resource Allocation
  Mengya Li, Ran Ma, Sainan Guo, Min Ji and Yuzhong Zhang
  
  
• A Local Search Approximation Algorithm for a Sum of Squares k-Facility Location Problem
  Xiaoyun Tian, Dachuan Xu, Dongmei Zhang, Peng Zhang and Zhenning Zhang
  
  
• On the minimum doubly resolving set problem in line graphs
  Qingjie Ye
  
  
• Improved Semi-Streaming Algorithms for $k$-Submodular Maximization with the Knapsack Constraint
  Shufang Gong and Bin Liu
  
  
• DGRec++: Enhancing Diversified Recommendation via Advanced GNN Architectures
  Xin Sun, Mingyang Bai and Xinhui Si
  
  
• Node-weighted k-prize-collecting Steiner tree problem on planar graphs
  Chengcheng Duan, Lu Han and Yicheng Xu
  
  

---