tamc2026-山大计算机科学与技术学院

#1

Improved Approximation Algorithms for Squared-Metric Facility Location with Outliers

Zhen Zhang, Fuzhen Liang, Lin Jiang (Hunan University of Technology and Business); Qilong Feng (Central South University)

#2

On the difficulty of order constrained pattern matching with applications to feature matching based malware detection

Adiesha Liyanage, Braeden Sopp, Binhai Zhu (Montana State University)

#5

Approximation Algorithms for Parallel Machine Scheduling with Rejection and Cost Constraint

Neng Ouyang, Xin Liu (Yunnan University)

#6

Chore Allocation under Graph Constraints and Information Asymmetry

Yue Tan, Han Xiao, Wenjing Liu, Qizhi Fang (Ocean University of China)

#7

Toward General Kernelization Techniques for Edge Modification Problems

Zhongyi Zhang, Jiong Guo (Shandong University)

#8

Decoding LoRA: Path Structural Entropy as a Generalization Signal

Zihan Guo, Ningyuan Gong, Yang Yu, Jianghua Lv (Beihang University)

#9

Mechanism Design for Bridge Location with Optional Preferences

Xiaoshuang Geng, Wenjing Liu, Genjie Qin, Qizhi Fang (Ocean University of China)

#10

An Approximation Algorithm for Minimum Weight Partial Connected Vertex Cover in Unit Disk Graphs

Zengwei Chen, Yingli Ran (Zhejiang Normal University)

#11

On the minimum line-fixed k-Steiner tree problem

Jianping Li, Huijuan Yang (Yunnan University); Junran Lichen (Beijing University of Chemical Technology)

#12

Maximum k-Dominating Set in Vertex-Arrival Streams

Huifei Dai, Yingli Ran (Zhejiang Normal University)

#13

On the bidirection-constrained windy postman problem

Jianping Li, Shuang Ge, Xiaoxiao Yang (Yunnan University)

#14

Minimum Spanning Trees for Square Crop Plots

Mingyang Gong, Adiesha Liyanage, Braeden Sopp, Muzhou Chen, Binhai Zhu (Montana State University)

#15

An Optimal Universally Strategyproof Mechanism for Non-Optional Obnoxious Two-Facility Location with Candidate Locations

Xiaowei Li (Changsha University of Science and Technology)

#16

Fairness Meets Knapsack: Bicriteria Approximation Algorithms for Fair Submodular Maximization

Mingchao Zhou, Chensheng Ma (Zhejiang Normal University); Xuanxing Du (China Telecom Corporation Limited Jinhua Branch); Zhao Zhang (Zhejiang Normal University)

#18

Approximation for Multi-Type Competitive Facility Location under a TMNL-Based Choice Rule

Xiaoyu Shao, Runjie Miao (Beijing University of Technology); Chenchen Wu (Tianjin University of Technology); Yapu Zhang (Beijing University of Technology)

#19

DisZero: Balanced Complementary Submodels for Resource-Adaptive Distributed Zeroth-Order Optimization

Jun Zhang, Mingyi Li (Shandong University); Ruisheng Zheng (University of Macau); Yuan Yuan (Shandong University)

#24

Parameterized Approximation Algorithms for Minimum Weighted Dominating Set

Peihua Li, Jiong Guo (Shandong University)

#26

SubDoc: Heterogeneous-Cost Submodular Selection for Multimodal Document Summarization

Dongzhao Wang, Kang Wang, Yang Li, Zhenning Zhang, Changjing Zhuge (Beijing University of Technology)

#27

Strictly Unfriendly k-Partitions: Sharp Degree Thresholds and ETH-Based Lower Bounds

Sanjay Jain, Frank Stephan, Haoyun Tang (National University of Singapore)

#28

Parallel-Batch Contracts under Hidden Effort and Coarse Completion-Time Monitoring

Wenxiao Wang, Jiaming Hu (Shandong Management University); Cuixia Miao (Qufu Normal University); Xianhao Meng (Nankai University)

#29

Cost-sharing mechanisms for the capacitated clique partition problem

Zhikang Zhang, Weidong Li (Yunnan University)

#30

On the Fairness of Maximum Nash Social Welfare under Cardinality Constraints

Sijia Dai, Huahua Miao, Yicheng Xu, Yong Zhang (Chinese Academy of Sciences)

#31

Automated Guided Vehicle Scheduling with Flexible Charging

Liu Xin, Weidong Li (Yunnan University); Sunyan Hong (Kunming University); Jinfu Deng (Yunnan University)

#34

Improved approximation algorithms for packing 3⁺- and 4⁺-paths

Mingyang Gong (Montana State University); Zhi-Zhong Chen (Tokyo Denki University); Binhai Zhu (Montana State University)

#35

Efficient Streaming Algorithms for Submodular Maximization under d-Dimensional Knapsack Constraints

Shufang Gong (Shandong Technology and Business University); Zhicheng Liu (Chinese Academy of Sciences)

#36

Online hierarchical extensible bin packing with three bins

Zhikang Zhang (Yunnan University)

#39

A Sharp Service-Radius Threshold for Random-Order Online Facility Location with Prescribed Sites

Mengzhen Li (Beijing University of Technology)

#41

Recursive Bounds for the Frobenius Number via Apery Sets

Xinru Zhu, Zhongzheng Tang (Beijing University of Posts and Telecommunications)

#43

Card-Based Zero-Knowledge Proofs for n-Queens Completion Problem

Shota Ikeda (Ibaraki University); Kazumasa Shinagawa (University of Tsukuba / National Institute of Advanced Industrial Science and Technology)

#44

NEST: Locally Certified Search for Structural-Entropy Hierarchies

Dingli Su, Yicheng Pan, Angsheng Li (Beihang University)

#46

Regular Games on Undirected Graphs are as Hard as on Directed Graphs

Ivan Adrian Koswara (National University of Singapore)

#47

Color spanning problems for line segments and points under static and dynamic setup: Query version

Sanjib Sadhu (National Institute of Technology Durgapur)

#48

Minimum-Load Location on a Bidirected Path

Guihao Wang, Jiahe Wang (Beijing University of Technology)

#50

Two Exact Quantum Queries Use at Most Six Variables

Yaqiao Li (Shenzhen University of Advanced Technology)

#51

On Kernelization for Bipartite Crossing Removal with One-sided Vertex Splitting

Yunlong Liu, Bingyang Wang (Hunan Normal University)

#53

Pure-DP Metric k-Median with Linear-in-k Error

Xiang Li, Sai Ji (Hebei University of Technology); Fan Yuan (Yantai University)

#55

Generating All Triangulations of a Biconnected Plane Graph in Constant Amortized Time

Tawkir Aziz Rahman (Bangladesh University of Engineering and Technology (BUET)); Debajyoti Mondal (University of Saskatchewan); Md. Saidur Rahman (Bangladesh University of Engineering and Technology (BUET))

#56

Submodular Maximization under a Convex Quadratic Knapsack Constraint

Jiahe Wang (Beijing University of Technology); Zhicheng Liu (Chinese Academy of Sciences); Chenchen Wu (Tianjin University of Technology); Ruiqi Yang (Beijing University of Technology)

#57

Prophet Inequalities for Online Knapsack and Assignment under Markov Random Field

Guihao Wang (Beijing University of Technology)

#58

A Near-Linear-Time Algorithm for Minimum Dominating Set on Convex Bipartite Graphs

Zexu Yang, Feng Shi, Qilong Feng (Central South University)

#59

Structural-Encoding Algorithms for Phylogenetic Network Isomorphism

Fengkai Liu, Xin Zeng, Feng Shi (Central South University)

#60

Signed Adjacency Recovery for Flanked Reversals

Siqi Jiang, Tiantian Li, Daming Zhu (Shandong University)

#64

Certifying Recognition of Interval Graphs Using Graph Searches

Yixin Cao (The Hong Kong Polytechnic University)

#65

The Price of EFX for Binary-Valued Agents under Knapsack Constraints

Lili Mei, Zhen Wang, Shuai Yang (Hangzhou Dianzi University); Guochuan Zhang (Zhejiang University); Qiaomu Zheng (Hangzhou Dianzi University)

#67

On Languages Recognized by a Finite Automaton with 1QFA and 2PFA Parts

Kamil Khadiev, Chulpan Sharafulislamova, Aliya Khadieva (Kazan Federal University)

Theory and Applications of Models of Computation

Call for Papers

Important Dates

Topics of Interest

Submission Guidelines

Awards

Proceedings

Special Issue Journals

Past TAMC Proceedings

Committees

Steering Committee

General Chairs

Program Committee Chairs

Program Committee

Invited Speakers

Accepted Papers