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

**Weakly Nondominated Solutions of Set-Valued Optimization Problems with Variable Ordering Structures in Linear Spaces**

Zhiang Zhou, Wenbin Wei, Kequan Zhao**Improved Lower Bound for Estimating the Number of Defective Items**

Nader Bshouty**Popularity on the Roommate Diversity Problem**

Steven Ge, Toshiya Itoh**Zero-visibility Cops and Robber game on Cage graph**

Xiaoli Sun, yi sun**Restricted Holant Dichotomy on Domains 3 and 4**

Yin Liu, Austen Fan, Jin-Yi Cai**Strong edge coloring of subquartic graphs**

Junlei Zhu, Hongguo Zhu**Incorporating Neural Point Process-based Temporal Feature for Rumor Detection**

Runzhe Li, Zhipeng Jiang, Suixiang Gao, Wenguo Yang**An exact algorithm for the line-constrained bottleneck $k$-Steiner tree problem**

Jianping Li, Suding Liu, Junran Lichen**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**Differentiable Discrete Optimization using Dataless Neural Networks**

SANGRAM KISHOR JENA, K. Subramani, Alvaro Velasquez**On Connectedness of Solutions to Integer Linear Systems**

Takasugu Shigenobu, Naoyuki Kamiyama**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**Improving Contraction Hierarchies by Combining with All-Pairs Shortest Paths Problem Algorithms**

Xinyu Song, Zhipeng Jiang, Wenguo Yang, Suixiang Gao**Two multicolor Ramsey numbers involving bipartite graphs**

Yan Li, Ye Wang**Online Facility Assignment for General Layout of Servers on a Line**

Tsubasa Harada, Toshiya Itoh**Guarding Precise and Imprecise Polyhedral Terrains with Segments**

Bradley McCoy, Binhai Zhu, Aakash Dutt**The Longest Subsequence-Repeated Subsequence Problem**

Manuel Lafond, Wenfeng Lai, Binhai Zhu, Adiesha Liyanage**An Efficient Local Search Algorithm for Correlation Clustering on Large Graphs**

Nathan Cordner, George Kollios**The Bag-Based Search: A meta-algorithm to construct tractable logical circuits for graphs based on tree decomposition**

Masakazu Ishihata**Two Exact Algorithms for the Packet Scheduling Problem**

Fei Li, Ningshi Yao**On Half Guarding Polygons**

Erik Krohn, Alex Pahlow, Zhongxiu Yang**Algorithms on a path covering problem with applications in transportation**

Ruxandra Marinescu-Ghemeci, Alexandru Popa, Tiberiu-Iulian Sirbu**Dynamic Programming for the Fixed Route Hybrid Electric Aircraft Charging Problem**

Anthony Deschênes, Raphaël Boudreault, Vanessa Simard, Jonathan Gaudreault, Claude-Guy Quimper**Earliest Deadline First is a $2$-approximation for DARP with Time Windows**

Barbara Anthony, Christine Chung, Ananya Das, David Yuen**The MaxIS-Shapley Value in Perfect Graphs**

Junqi Tan, Dongjing Miao, Pengyu Chen**Information Theory of Blockchain Systems**

Quan-Lin Li, Yaqian Ma, Jing-Yu Ma, Yan-Xia Chang**On Problems Related to Absent Subsequences**

Zdenek Tronicek**A Two-stage Seeds Algorithm for Competitive Influence Maximization considering User Demand**

Zhiheng You, Hongwei Du, Liang Ziwei**Some Combinatorial Algorithms on the Dominating Number of Anti-Rank k Hypergraphs**

Zhuo Diao, Zhongzheng Tang**Mechanism Design for Time-Varying Value Tasks in High-Load Edge Computing Markets**

Qie Li, Zichen Wang, Hongwei Du**When Advertising meets Assortment Planning: Joint Advertising and Assortment Optimization under Multinomial Logit Model**

Chenhao Wang, Yao Wang, Shaojie Tang**Asteroidal Sets and Dominating Paths**

Oleksiy Al-saadi, Jamie Radcliffe**Testing Higher-order Clusterability on graphs**

Yifei Li, Donghua Yang, Jianzhong Li**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**A Novel Approximation Algorithm for Max-Covering Circle Problem**

Kaiqi Zhang, Siyuan Zhang, Jirun Gao, Hongzhi Wang, Hong Gao, Jianzhong Li**An Approximation Algorithm for Covering Vertices by 4^+-Paths**

Mingyang Gong, Zhizhong Chen, Guohui Lin, Lusheng Wang**Twin-treewidth: A single-exponential logic-based approach**

Maurício Da Silva Pires, Ueverton Souza, Bruno Lopes**An O(log n)-Competitive Posted-Price Algorithm for Online Matching on the Line**

Stephen Arndt, Josh Ascher, Kirk Pruhs**The $2$-mixed-center color spanning problem**

Yin Wang, Yi Xu, Yinfeng Xu, Huili Zhang**Machine Learning with Low Resource Data from Psychiatric Clinics**

Hongmin Du, Xiao Li, Neil Chen, Miklos Vasarhelyi**Algorithms for the Ridesharing with Profit Constraint Problem**

Qian-Ping Gu, Jiajian Liang**A Dynamic Parameter Adaptive Path Planning Algorithm**

Guangyu Yao, Nan Zhang, Zhenhua Duan, Cong Tian**On the Mating Between a Polygonal Curve and a Convex Polygon**

Jin-Yi Liu**Parameterized and exact-exponential algorithms for the read-once integer refutation problem in UTVPI constraints**

K. Subramani, Piotr Wojciechowski**Single Image Dehazing Based on Dynamic Convolution and Transformer**

Quancheng Ning, Nan Zhang**Improved approximation for broadcasting in k-Path Graphs**

Narek Hovhannisyan, Hovhannes Harutyunyan**A Faster Parameterized Algorithm for Bipartite 1-Sided Vertex Explosion**

Yunlong Liu, Guang Xiao, Ao Liu, Di Wu, Jingui Huang**Multi-Candidate Carpooling Routing Problem and Its Approximation Algorithms**

Jiale Zhang, Xiuqi Huang, Zifeng Liu, Xiaofeng Gao, Guihai Chen**V-Words, Lyndon Words and Substring circ-UMFFs**

Jacqueline W. Daykin, Neerja Mhaskar, William F. Smyth**Maximizing Utilitarian and Egalitarian Welfare of Fractional Hedonic Games on Tree-like Graphs**

Tesshu Hanaka, Airi Ikeyama, Hirotaka Ono**The fine-grained complexity of approximately counting proper connected colorings (extended abstract)**

Robert Barish, Tetsuo Shibuya**The Two-Center Problem of Uncertain Points on Trees**

Haitao Xu, Jingru Zhang**GAMA: Genetic algorithm for k-coverage and connectivity with minimum sensor activation in wireless sensor networks**

HABIB AMMARI, Syed Zaidi, Kevin Gutama**The Line-constrained Maximum Coverage Facility Location Problem**

Hiroki Maegawa, Naoki Katoh, Yuki Tokuni, Yuya Higashikawa**Improved Scheduling with a Shared Resource**

Peter Kling, Florian Schneider, Christoph Damerius**Critical $(P_5,dart)$-Free Graphs**

Wen Xia, Jorik Jooken, Jan Goedgebeur, Shenwei Huang**Simple Heuristics for the Rooted Max Tree Coverage Problem**

Jiang Zhou, Peng Zhang**Space-Time Graph Planner for Unsignalized Intersections with CAVs**

Caner Mutlu, Ionut Cardei, Mihaela Cardei**Highway Preferential Attachment Models for Geographic Routing**

Ofek Gila, Michael Goodrich, Evrim Ozel**An Energy-efficient Scheduling Method for Real-time Multi-workflow in Container Cloud**

Zaixing Sun, Zhikai Li, Chonglin Gu, Hejiao Huang**Efficient Algorithms for k-Submodular Maximization with the p-system and d-knapsack Constraints**

Wenzhe Zhang, Shufang Gong, Bin Liu**Graph Clustering through Users' Properties and Social Influence**

Jianxiong Guo, Zhehao Zhu, Yucen Gao, Xiaofeng Gao**Online Dominating Set and Coloring**

MINATI DE, Satyam Singh, Sambhav Khurana**Data Summarization beyond Monotonicity: Non-monotone Two-Stage Submodular Maximization**

Shaojie Tang**Multi-Winner Approval Voting with Grouped Voters**

Yinghui Wen, Jiong Guo, Chunjiao Song, Aizhong Zhou**EFX Allocation to Chores Over Small Graph**

Huahua Miao, Sijia Dai, Yong Zhang, Yicheng Xu**Reinforcement Learning for Combating Cyberbullying in Online Social Networks**

Wenting Wang, Tiantian Chen, Weili Wu**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**Exactly k MSTs: How many vertices suffice?**

Apratim Dutta, Rahul Muthu, anuj tawari, Sunitha V**Minimum Monotone Tree Decomposition of Density Functions Defined on Graphs**

Lucas Magee, Yusu Wang**The Two Sheriffs Problem: Cryptographic Formalization and Generalization**

Kota Sugimoto, Takeshi Nakai, Yohei Watanabe, Mitsugu Iwamoto**Computing random r-orthogonal Latin squares**

Sergey Bereg**Greedy+Max: An Efficient Approximation Algorithm for $k$-Submodular Knapsack Maximization**

Zhongzheng Tang, Jingwen Chen, Chenhao Wang, Tian Wang, Weijia Jia