Accepted papers can be viewed through the links to the proceedings:

Accepted Papers

  1. Weakly Nondominated Solutions of Set-Valued Optimization Problems with Variable Ordering Structures in Linear Spaces
    Zhiang Zhou, Wenbin Wei, Kequan Zhao

  2. Improved Lower Bound for Estimating the Number of Defective Items
    Nader Bshouty

  3. Popularity on the Roommate Diversity Problem
    Steven Ge, Toshiya Itoh

  4. Zero-visibility Cops and Robber game on Cage graph
    Xiaoli Sun, yi sun

  5. Restricted Holant Dichotomy on Domains 3 and 4
    Yin Liu, Austen Fan, Jin-Yi Cai

  6. Strong edge coloring of subquartic graphs
    Junlei Zhu, Hongguo Zhu

  7. Incorporating Neural Point Process-based Temporal Feature for Rumor Detection
    Runzhe Li, Zhipeng Jiang, Suixiang Gao, Wenguo Yang

  8. An exact algorithm for the line-constrained bottleneck $k$-Steiner tree problem
    Jianping Li, Suding Liu, Junran Lichen

  9. Practical Attribute-Based Multi-Keyword Search Scheme with Sensitive Information Hiding for Cloud Storage Systems
    Jie Zhao, Hejiao Huang, Yongliang Xu, Xiaojun Zhang, Hongwei Du

  10. Differentiable Discrete Optimization using Dataless Neural Networks
    SANGRAM KISHOR JENA, K. Subramani, Alvaro Velasquez

  11. On Connectedness of Solutions to Integer Linear Systems
    Takasugu Shigenobu, Naoyuki Kamiyama

  12. Exact and Approximation Algorithms for the Multi-depot Data Mule Scheduling with Handling Time and Time Span Constraints
    Minqin Liu, Wei Yu, Zhaohui Liu, Xinmeng Guo

  13. Improving Contraction Hierarchies by Combining with All-Pairs Shortest Paths Problem Algorithms
    Xinyu Song, Zhipeng Jiang, Wenguo Yang, Suixiang Gao

  14. Two multicolor Ramsey numbers involving bipartite graphs
    Yan Li, Ye Wang

  15. Online Facility Assignment for General Layout of Servers on a Line
    Tsubasa Harada, Toshiya Itoh

  16. Guarding Precise and Imprecise Polyhedral Terrains with Segments
    Bradley McCoy, Binhai Zhu, Aakash Dutt

  17. The Longest Subsequence-Repeated Subsequence Problem
    Manuel Lafond, Wenfeng Lai, Binhai Zhu, Adiesha Liyanage

  18. An Efficient Local Search Algorithm for Correlation Clustering on Large Graphs
    Nathan Cordner, George Kollios

  19. The Bag-Based Search: A meta-algorithm to construct tractable logical circuits for graphs based on tree decomposition
    Masakazu Ishihata

  20. Two Exact Algorithms for the Packet Scheduling Problem
    Fei Li, Ningshi Yao

  21. On Half Guarding Polygons
    Erik Krohn, Alex Pahlow, Zhongxiu Yang

  22. Algorithms on a path covering problem with applications in transportation
    Ruxandra Marinescu-Ghemeci, Alexandru Popa, Tiberiu-Iulian Sirbu

  23. Dynamic Programming for the Fixed Route Hybrid Electric Aircraft Charging Problem
    Anthony Deschênes, Raphaël Boudreault, Vanessa Simard, Jonathan Gaudreault, Claude-Guy Quimper

  24. Earliest Deadline First is a $2$-approximation for DARP with Time Windows
    Barbara Anthony, Christine Chung, Ananya Das, David Yuen

  25. The MaxIS-Shapley Value in Perfect Graphs
    Junqi Tan, Dongjing Miao, Pengyu Chen

  26. Information Theory of Blockchain Systems
    Quan-Lin Li, Yaqian Ma, Jing-Yu Ma, Yan-Xia Chang

  27. On Problems Related to Absent Subsequences
    Zdenek Tronicek

  28. A Two-stage Seeds Algorithm for Competitive Influence Maximization considering User Demand
    Zhiheng You, Hongwei Du, Liang Ziwei

  29. Some Combinatorial Algorithms on the Dominating Number of Anti-Rank k Hypergraphs
    Zhuo Diao, Zhongzheng Tang

  30. Mechanism Design for Time-Varying Value Tasks in High-Load Edge Computing Markets
    Qie Li, Zichen Wang, Hongwei Du

  31. When Advertising meets Assortment Planning: Joint Advertising and Assortment Optimization under Multinomial Logit Model
    Chenhao Wang, Yao Wang, Shaojie Tang

  32. Asteroidal Sets and Dominating Paths
    Oleksiy Al-saadi, Jamie Radcliffe

  33. Testing Higher-order Clusterability on graphs
    Yifei Li, Donghua Yang, Jianzhong Li

  34. Faster Algorithms for Evacuation Problems in Networks with a Single Sink of Small Degree and Bounded Capacitated Edges
    Yuki Tokuni, Katoh Naoki, Junichi Teruyama, Yuya Higashikawa

  35. A Novel Approximation Algorithm for Max-Covering Circle Problem
    Kaiqi Zhang, Siyuan Zhang, Jirun Gao, Hongzhi Wang, Hong Gao, Jianzhong Li

  36. An Approximation Algorithm for Covering Vertices by 4^+-Paths
    Mingyang Gong, Zhizhong Chen, Guohui Lin, Lusheng Wang

  37. Twin-treewidth: A single-exponential logic-based approach
    Maurício Da Silva Pires, Ueverton Souza, Bruno Lopes

  38. An O(log n)-Competitive Posted-Price Algorithm for Online Matching on the Line
    Stephen Arndt, Josh Ascher, Kirk Pruhs

  39. The $2$-mixed-center color spanning problem
    Yin Wang, Yi Xu, Yinfeng Xu, Huili Zhang

  40. Machine Learning with Low Resource Data from Psychiatric Clinics
    Hongmin Du, Xiao Li, Neil Chen, Miklos Vasarhelyi

  41. Algorithms for the Ridesharing with Profit Constraint Problem
    Qian-Ping Gu, Jiajian Liang

  42. A Dynamic Parameter Adaptive Path Planning Algorithm
    Guangyu Yao, Nan Zhang, Zhenhua Duan, Cong Tian

  43. On the Mating Between a Polygonal Curve and a Convex Polygon
    Jin-Yi Liu

  44. Parameterized and exact-exponential algorithms for the read-once integer refutation problem in UTVPI constraints
    K. Subramani, Piotr Wojciechowski

  45. Single Image Dehazing Based on Dynamic Convolution and Transformer
    Quancheng Ning, Nan Zhang

  46. Improved approximation for broadcasting in k-Path Graphs
    Narek Hovhannisyan, Hovhannes Harutyunyan

  47. A Faster Parameterized Algorithm for Bipartite 1-Sided Vertex Explosion
    Yunlong Liu, Guang Xiao, Ao Liu, Di Wu, Jingui Huang

  48. Multi-Candidate Carpooling Routing Problem and Its Approximation Algorithms
    Jiale Zhang, Xiuqi Huang, Zifeng Liu, Xiaofeng Gao, Guihai Chen

  49. V-Words, Lyndon Words and Substring circ-UMFFs
    Jacqueline W. Daykin, Neerja Mhaskar, William F. Smyth

  50. Maximizing Utilitarian and Egalitarian Welfare of Fractional Hedonic Games on Tree-like Graphs
    Tesshu Hanaka, Airi Ikeyama, Hirotaka Ono

  51. The fine-grained complexity of approximately counting proper connected colorings (extended abstract)
    Robert Barish, Tetsuo Shibuya

  52. The Two-Center Problem of Uncertain Points on Trees
    Haitao Xu, Jingru Zhang

  53. GAMA: Genetic algorithm for k-coverage and connectivity with minimum sensor activation in wireless sensor networks
    HABIB AMMARI, Syed Zaidi, Kevin Gutama

  54. The Line-constrained Maximum Coverage Facility Location Problem
    Hiroki Maegawa, Naoki Katoh, Yuki Tokuni, Yuya Higashikawa

  55. Improved Scheduling with a Shared Resource
    Peter Kling, Florian Schneider, Christoph Damerius

  56. Critical $(P_5,dart)$-Free Graphs
    Wen Xia, Jorik Jooken, Jan Goedgebeur, Shenwei Huang

  57. Simple Heuristics for the Rooted Max Tree Coverage Problem
    Jiang Zhou, Peng Zhang

  58. Space-Time Graph Planner for Unsignalized Intersections with CAVs
    Caner Mutlu, Ionut Cardei, Mihaela Cardei

  59. Highway Preferential Attachment Models for Geographic Routing
    Ofek Gila, Michael Goodrich, Evrim Ozel

  60. An Energy-efficient Scheduling Method for Real-time Multi-workflow in Container Cloud
    Zaixing Sun, Zhikai Li, Chonglin Gu, Hejiao Huang

  61. Efficient Algorithms for k-Submodular Maximization with the p-system and d-knapsack Constraints
    Wenzhe Zhang, Shufang Gong, Bin Liu

  62. Graph Clustering through Users' Properties and Social Influence
    Jianxiong Guo, Zhehao Zhu, Yucen Gao, Xiaofeng Gao

  63. Online Dominating Set and Coloring
    MINATI DE, Satyam Singh, Sambhav Khurana

  64. Data Summarization beyond Monotonicity: Non-monotone Two-Stage Submodular Maximization
    Shaojie Tang

  65. Multi-Winner Approval Voting with Grouped Voters
    Yinghui Wen, Jiong Guo, Chunjiao Song, Aizhong Zhou

  66. EFX Allocation to Chores Over Small Graph
    Huahua Miao, Sijia Dai, Yong Zhang, Yicheng Xu

  67. Reinforcement Learning for Combating Cyberbullying in Online Social Networks
    Wenting Wang, Tiantian Chen, Weili Wu

  68. Near-Bipartiteness, Connected Near-Bipartiteness, Independent Feedback Vertex Set and Acyclic Vertex Cover on graphs having small dominating sets
    Ueverton Souza, Raquel Bravo, Maria Luiza Cruz, Roldofo Oliveira

  69. Exactly k MSTs: How many vertices suffice?
    Apratim Dutta, Rahul Muthu, anuj tawari, Sunitha V

  70. Minimum Monotone Tree Decomposition of Density Functions Defined on Graphs
    Lucas Magee, Yusu Wang

  71. The Two Sheriffs Problem: Cryptographic Formalization and Generalization
    Kota Sugimoto, Takeshi Nakai, Yohei Watanabe, Mitsugu Iwamoto

  72. Computing random r-orthogonal Latin squares
    Sergey Bereg

  73. Greedy+Max: An Efficient Approximation Algorithm for $k$-Submodular Knapsack Maximization
    Zhongzheng Tang, Jingwen Chen, Chenhao Wang, Tian Wang, Weijia Jia