Accepted papers can be viewed through below links:

Accepted Papers

  1. Minsum Problem for Discrete and Weighted Set Flow on Dynamic Path Network
    Bubai Manna, Bodhayan Roy, Vorapong Suppakitpaisarn

  2. The Characterizations and Complexity of Roman {2}-Domination and 2-Domination in Graphs
    Cai-Xia Wang, Yu Yang, Ze-Peng Li, Shou-Jun Xu

  3. A polynomial time algorithm to find star chromatic index on bounded treewidth graphs with given maximum degree
    Yichen Wang, Mei Lu

  4. Quantum Annealing and GNN for Solving TSP with QUBO
    aoqi H

  5. Quantum Lung Segmentation: QCU-Net Applied to Chest X-ray Images
    Haoqi He, Mingkai Huang

  6. A distributed approximation algorithm for the total dominating set problem
    Limin Wang, Zhao Zhang, Donglei Du, Yaping Mao, Xiaoyan Zhang

  7. Improved approximation algorithms for Patrol-Scheduling with Min-Max Latency using Multiclass Minimum Spanning Forests
    Li-Hsuan Chen, Ling-Ju Hung, Ralf Klasing

  8. On the Existence of Parameterized Algorithms for the Shortest Common Supersequence and Related Problems
    Muzhou Chen, Haitao Jiang, Nan Liu, Lusheng Wang, Binhai Zhu

  9. Maximum Core Spanning Tree Insertion Maintenance for Large Dynamic Graphs
    Xiaowei Lv, Yongcai Wang, Deying Li, Haodi Ping

  10. Plane Segmentation for Proportional Division of Resources
    Jiangjun Shao, Hao Guo

  11. Approximation Algorithms for the Minimum Weight Cycle/Path Partition Problem
    Yaqi Li, Wei Yu, Zhaohui Liu

  12. A Distributed Method for Negative Content Spread Minimization on Social Networks
    Ruidong Yan, Zhenhua Guo, Weili Wu, Baoyu Fan

  13. Revisiting the stretch factor of Delaunay triangulations of points in convex position
    xuehou tan, Rong Chen, Qing Jaing

  14. Algorithms for the Constrained Assignment Problems with Bounds and Maximum Penalty
    Guojun Hu, Pengxiang Pan, Junran Lichen, Lijian Cai

  15. NFTO: DAG-Based Task Offloading and Energy Optimization Algorithm in Mobile Edge Computing
    Luchuan Zeng, Kunming Jin, Zichen Wang, Chen Zhang, Hongwei Du

  16. Finding Fair and Efficient Allocations of Indivisible Chores
    Zhe Liu, Wenguo Yang, Suixiang Gao

  17. Enabling Proactive Microservice Placement in Collaborative Edge Computing Networks
    Zichen Wang, Kunming Jin, Luchuan Zeng, Chen Zhang, Hongwei Du

  18. An Algebraic Perspective on Tree Imbalance Metrics
    Priyojit Palit, Ghosh Smita

  19. Time-Sensitive Target Coverage Under Visibility Constraints with UAVs
    Boxi Chen, Jingfang Su, Hongwei Du

  20. Monotone Submodular Meta-Learning under the Matroid Constraint
    Shufang Gong, Bin Liu, Qizhi Fang, Weili Wu

  21. Task Planning for The Multi-center Heterogeneous Vehicle Pickup and Delivery Problem
    Ruixi Huang, Yifei Li, Hejiao Huang

  22. Dynamic DR-Submodular Maximization with Linear Costs over the Integer Lattice
    Yuanyuan Qiang, Bin Liu

  23. Iterative rounding for bag of tasks scheduling with rejection in high performance computing
    uiqing Su

  24. Transition-based Heterogeneous Network Embedding by Self-Attention Model of Sparse Matrix
    Keqin Chen, Zhipeng Jiang

  25. Approximation Algorithms for $k$-Submodular Maximization under the Fair Constraints and Size Constraints
    Weijia Hu, Bin Liu

  26. Fair Division with Weighted and Prioritized Agents
    Liangsen Li, Bin Deng

  27. or-Submodular maximization under a Matroid Constraint and a Knapsack Constraint
    Qian Liu, Yang Zhou, Min Li, Haifeng Huang

  28. Online bottleneck matching on a star
    xiao, Weidong Li

  29. Algorithmic Construction of Tessellation Cover to QUBO Formulations
    Luis Felipe Cunha, Franklin Marquezino, Daniel Posner, Matheus Romaneli

  30. Revisit the online facility location problem with uniform facility cost
    Mengzhen Li, Ruijie Miao, Chenchen Wu, Dachuan Xu

  31. On the Kalai-Smorodinsky solutions for Bi-objective Spanning Tree Problem
    Thanh Loan Nguyen, Viet Hung Nguyen, Minh Hieu Nguyen, Thi Viet Thanh Vu

  32. Speeding Up Constrained k-Means Through 2-Means
    Qilong Feng, Bin Fu

  33. Detection and Analysis of Cryptocurrency Scams on Twitter
    Karuna K Chandra, Karan Kalla, Jagriti Bhatia, Mihir Jayaprakash, Sudeepa Dey

  34. Parity-Constrained Weighted k-Center
    Xinlan Xia, Lu Han, lili Mei

  35. ToI-based Data Utility Maximization for UAV-assisted Wireless Sensor Networks
    Qing Zhao, Zhen Li, Jianqiang Li, Jianxiong Guo, Xingjian Ding, Deying Li

  36. Approximation Algorithm for the Maximum Interval Multi-Cover Problem
    Yuxuan Xu, Yingli Ran, Zhao Zhang

  37. Stable Matching with Approval Preferences under Partial Information
    Yaqin Chu, Junjie Luo, Tianyang Zheng

  38. "Optimal Bridge, Twin Bridges and Beyond: Inserting Edges into a Road Network to Minimize the Constrained Diameters"
    Henning Fernau, Binhai Zhu, Zhidan Feng

  39. Systematic Review of Cybersecurity Disclosure Research
    Hongmin Du, Jiahui Xu, Miklos Vasarhelyi

  40. Cost-sharing mechanisms for the selfish open-end bin packing problem
    zhikang Zhang, Weidong Li

  41. Towards understanding news plagiarism: theoretical and experimental analysis
    Ruxandra Marinescu-Ghemeci, Adrian Miclaus, Ionut Muraretu, Alexandru Popa

  42. Efficient Approximation Algorithms for Parallel Batch Machine Scheduling of Malleable Jobs
    Fenghe Xia, Longkun Guo, Xiaoyan Zhang

  43. Integrated airline aircraft routing and crew pairing by alternating Lagrangian decomposition
    Cong Li, Suixiang Gao, Wenguo Yang, Zhipeng Jiang

  44. Representation of Dominating Set Variants using Dataless Neural Networks
    SANGRAM KISHOR JENA, Piotr Wojciechowski

  45. Submodular Participatory Budgeting
    Jing Yuan, Shaojie Tang