2026

• Jingyang Zhao, Zimo Sheng, Mingyu Xiao: FPT Approximation Algorithms for TSP on Non-Metric Graphs. AAAI 2026 (accepted)
• Jingyang Zhao, Mingyu Xiao, Ken-Ichi Kawarabayashi: A TSP-Based Algorithm for Multi-League Traveling Tournament. AAAI 2026 (accepted)
• Jingyang Zhao, Mingyu Xiao, Yonghang Su: Improved Algorithms for Trip-Vehicle Assignment in Ride-Sharing. AAAI 2026 (accepted)
• Peng Yu, Yike Chen, Chao Xu, Albert Bifet, Jesse Read: Binary Split Categorical feature with Mean Absolute Error Criteria in CART, AAAI 2026 (accepted)
• Zhonghao Wang, Junqiang Peng, Yuxi Liu, Mingyu Xiao: How Hard Is It to Rig a Tournament When Few Players Can Beat or Be Beaten by the Favorite? AAAI 2026 (accepted)

2025

• Jinping Lei, Lu Liu, Mingyu Xiao, Yi Zhou: Fast Exact Algorithms for the Maximum Diversity Problem. Eur. J. Oper. Res. 2025 (accepted)
• Yike Chen, Ke Shi, Chao Xu: An Optimal Algorithm for the Stacker Crane Problem on Fixed Topologies, ISAAC 2025 (accepted)
• Kangyi Tian, Mingyu Xiao, Boting Yang: Improved Parameterized Algorithms for Cluster Vertex Deletion. Theory of Computing Systems 69, 37 (2025)
• Xiaoyang Gong, Bakh Khoussainov, Yuyang Zhuge: Word structures and their automatic presentations. MFCS 2025: 51:1-51:18.
• Zihui Liang, Bakh Khoussainov, Mingyu Xiao: Deciding regular games: a playground for exponential time algorithms. MFCS 2025: 66:1-66:18.
• Jingyang Zhao, Mingyu Xiao: Improved Approximation Algorithms for Capacitated Vehicle Routing with Fixed Capacity. MFCS 2025: 93:1-93:19.
• Yimin Hao, Yi Zhou, Chao Xu and Zhang-Hua Fu: Efficient Branch-and-Bound for Submodular Function Maximization under Knapsack Constraint. ECAI 2025: 911-918
• Rui Sun, Xinyu Wang, Yiyuan Wang, Jiangnan Li, Yi Zhou: A Novel Local Search Algorithm for the Vertex Bisection Minimization Problem. IJCAI 2025: 8956-8965
• Ming Sun, Xinyu Wu, Yi Zhou, Jin-Kao Hao, and Zhang-Hua Fu: Efficient Backbone Network Construction in Wireless Artificial Intelligent Computing Systems. Tsinghua Science and Technology 30.5 (2025): 2300-2319.
• Zhenxiang Xu, Yiping Liu, Yi Zhou, Yimin Hao, Zhengren Wang: Efficient Top-k s-Biplexes Search over Large Bipartite Graphs with Time Complexity Guarantees. Expert Systems with Applications (2025): 128380. 
• Libo Zhang, Yang Chen, Toru Takisaka, Kaiqi Zhao, Weidong Li, Jiamou Liu: Situational-Constrained Sequential Resources Allocation via Reinforcement Learning. IJCAI 2025: 9121-9129
• Yuhang Guo, Dong Hao , Bin Li, Mingyu Xiao, Bakh Khoussainov: Strategyproofness and Monotone Allocation of Auction in Social Networks. IJCAI 2025: 3883-3890
• Lijun Wu, Dong Hao, Zhiyi Fan: Explainable Graph Neural Networks via Structural Externalities. IJCAI 2025:  583-591
• Chenghao Zhu, Yi Zhou, Haoyu Jiang: A Reduction-based Algorithm for the Clique Interdiction Problem. IJCAI 2025: 9022-9030
• Yu Cong, Chao Xu, Yi Zhou: Large-Scale Trade-Off Curve Computation for Incentive Allocation with Cardinality and Matroid Constraints. IJCAI 2025: 2575-2582
• Junqiang Peng, Zimo Sheng, Mingyu Xiao: New Algorithms for #2-SAT and #3-SAT. IJCAI 2025: 2666-2674
• Yiping Liu, Mengxiao Zhang, Jiamou Liu, Song Yang: Data Pricing for Graph Neural Networks without Pre-purchased Inspection. AAMAS 2025: 1380-1388
• Jingyang Zhao, Mingyu Xiao: An Improved Algorithm for Bipartite Traveling Tournament in Inter-League Sports Scheduling. Mathematics of Operations Research 2025 (Accepted)
• Jingyang Zhao, Mingyu Xiao: The APX-hardness of the Traveling Tournament Problem. Operations Research Letters 62: 107311 (2025)
• Jingyang Zhao, Mingyu Xiao: Practical Algorithms with Guaranteed Approximation Ratio for TTP with Maximum Tour Length Two. Mathematics of Operations Research 50(2):910-934 (2025)
• 白天，肖鸣宇：反馈集问题与子集反馈集问题的计算复杂性研究进展[J]. 计算机研究与发展,2025, 62(1): 104-118
• Jingyang Zhao, Mingyu Xiao: A 5-approximation algorithm for the traveling tournament problem. Ann. Oper. Res. 346(3): 2287-2305 (2025)
• Qimu Xiao, Mingyu Xiao: Joint computation offloading and resource allocation in multi-cell MEC networks. The Journal of Supercomputing 81: 459 (2025)
• Jingyang Zhao, Mingyu Xiao, Chao Xu: The traveling tournament problem: Improved algorithms based on cycle packing. Theoretical Computer Science 1056: 115519 (2025)
• Jingyang Zhao, Mingyu Xiao: A Matching-Based Approximation Algorithm for the Traveling Tournament Problem. Theoretical Computer Science 1055: 115485 (2025)
• Jingyang Zhao, Mingyu Xiao: Multidepot capacitated vehicle routing with improved approximation guarantees. Theoretical Computer Science 1043: 115265 (2025)
• Yuxi Liu, Mingyu Xiao: An Improved Kernel and Parameterized Algorithm for Deletion to Induced Matching. Theoretical Computer Science 1041:115215 (2025)
• Zihui Liang, Bakh Khoussainov, Mingyu Xiao: Network control games played on graphs. Theoretical Computer Science 1034: 115123 (2025)
• Jingyang Zhao, Mingyu Xiao: Approximation Algorithms for Cycle and Path Partitions in Complete Graphs. Theoretical Computer Science 1029: 115049 (2025)
• Junqiang Peng, Mingyu Xiao: Fast Exact Algorithms for the SAT Problem with Bounded Occurrences of Variables. Theoretical Computer Science 1029: 115037 (2025)
• Jingyang Zhao, Mingyu Xiao: A Matching-Based Algorithm for the Traveling Tournament Problem. AAAI 2025: 26750-26758
• Jingyang Zhao, Mingyu Xiao, Junqiang Peng, Ziliang Xiong: Improved Approximation Algorithms for Clustered TSP and Subgroup Planning. AAAI 2025: 26742-26749
• Ziliang Xiong, Mingyu Xiao: A Simplified Parameterized Algorithm for Directed Feedback Vertex Set. SOSA 2025: 378-384

2024

2023

• Toru Takisaka, Zhenya Zhang, Paolo Arcaini, Ichiro Hasuo: A Robustness-Based Confidence Measure for Hybrid System Falsification,  IEEE Trans. Comput. Aided Des. Integr. Circuits Syst 42(5): 1718-1731 (2023)
• Binglin Tao, Mingyu Xiao, Jingyang Zhao: Minimum-Weight Link-Disjoint Paths With a Bounded Number of Shared Nodes. IEEE Trans. Netw. Serv. Manag. 20(3): 2598-2610 (2023)
• Tian Bai, Mingyu Xiao: A parameterized algorithm for subset feedback vertex set in tournaments. Theor. Comput. Sci. 975: 114139 (2023)
• Junqiang Peng, Mingyu Xiao: Further improvements for SAT in terms of formula length. Inf. Comput. 294: 105085 (2023)
• Jianbo Wang, Chao Xu, Siyun Zhou: Solving systems of linear equations through zero forcing set. COCOON 2023:353-365.
• Zihui Liang, Haidong Yang, Bakh Khoussainov: Topological network-control games. COCOON 2023:144-156.
• Zimo Sheng, Mingyu Xiao: A Discharging Method: Improved Kernels for Edge Triangle Packing and Covering. COCOON 2023:171-183.
• Jingyang Zhao, Mingyu Xiao: Improved Approximation Algorithms for Multidepot Capacitated Vehicle Routing. COCOON 2023: 378-391. (Best Paper Award)
• Kangyi Tian, Mingyu Xiao, Boting Yang: An Improved Parameterized Algorithm for Cluster Vertex Deletion. COCOON 2023:182-194.
• Zihui Liang, Bakh Khoussainov, Toru Takisaka, Mingyu Xiao: Connectivity in the presence of an opponent. ESA 2023: 79:1-79:14.
• Fengjuan Jia, Mengxiao Zhang, Jiamou Liu, Bakh Khoussainov: Incentivising Diffusion while Preserving Differential Privacy. UAI 2023: 963-972.
• Yuan Fang, Mengxiao Zhang, Jiamou Liu, Bakh Khoussainov, Mingyu Xiao: Multi-unit Auction over a Social Network. ECAI 2023: 676-683.
• Weidong Li, Mengxiao Zhang, Libo Zhang, and Jiamou Liu. Integrated Private Data Trading Systems for Data Marketplaces. ECAI 2023: 1422-1429.
• Mingyu Xiao, Guixin Lin, Bakh Khoussainov, Yuchao Song: Characterizations of Network Auctions and Generalizations of VCG. ECAI 2023: 2736-2743.
• Zhengren Wang, Zhou Yi, Chunyu Luo, Mingyu Xiao: A Fast Maximum k-Plex Algorithm Parameterized by the Degeneracy Gap. IJCAI 2023: 5648-5656.
• Junqiang Peng, Mingyu Xiao: Fast Algorithms for SAT with Bounded Occurrences of Variables. IJCAI 2023: 2004-2012.
• Zeyu Zhang, Jiamou Liu, Kaiqi Zhao, Song Yang, Xianda Zheng, Yifei Wang: Contrastive Learning for Signed Bipartite Graphs. SIGIR 2023: 1629–1638.
• Mingyu Xiao, Guoliang Qiu, Sen Huang: MMS Allocations of Chores with Connectivity Constraints: New Methods and New Results. AAMAS 2023: 2886-2888.
• Fengjuan Jia, Mengxiao Zhang, Jiamou Liu, Bakh Khoussainov: Differentially Private Diffusion Auction: The Single-unit Case. AAMAS 2023: 2724-2726.
• Libo Zhang, Yang Chen, Toru Takisaka, Bakh Khoussainov, Michael Witbrock, Jiamou Liu: Learning Density-Based Correlated Equilibria for Markov Games. AAMAS 2023: 652-660.
• Mingyu Xiao, Shaowei Kou: A 5k-vertex kernel for 3-path vertex cover. Theor. Comput. Sci. 959: 113872 (2023)
• Mengfan Ma, Ziyang Men, André Rossi, Yi Zhou, Mingyu Xiao: A vertex-separator-based integer linear programming formulation for the partitioned Steiner tree problem. Comput. Oper. Res. 153: 106151 (2023)
• Yuhao Liu, Mingyu Xiao. The (3, 3)-colorability of planar graphs without 4-cycles and 5-cycles. Discrete Mathematics. 346(4), 113306 (2023)
• Jialing He, Zijian Zhang, Liran Ma, Zhouyu Zhang, Meng Li, Bakh Khoussainov, Jiamou Liu, and Liehuang Zhu. InFocus: Amplifying Critical Feature Influence on Non-Intrusive Load Monitoring through Self-Attention Mechanisms. IEEE Trans. Smart Grid. (2023)
• Mengfan Ma, Mingyu Xiao, Tian Bai, Bakh Khoussainov: Facility Location Games with Entrance Fees. AAAI 2023: 37(5), 5797-5804.
• Jingyang Zhao, Mingyu Xiao. The Linear Distance Traveling Tournament Problem Allows an EPTAS. AAAI 2023: 37(10), 12155-12162.
• Jialing He, Jiamou Liu, Zijian Zhang, Yang Chen, Yiwei Liu, Bakh Khoussainov, Liehuang Zhu. MSDC: Exploiting Multi-State Power Consumption in Non-Intrusive Load Monitoring Based on A Dual-CNN Model. AAAI 2023: 37(4), 5078-5086.
• Dmitry Berdinsky, Sanjay Jain, Bakh Khoussainov, Frank Stephan. String compression in FA–presentable structures. Theor. Comput. Sci. 947: 113705 (2023)
• Qi Shi and Dong Hao. Social Sourcing: Incorporating Social Networks Into Crowdsourcing Contest Design. IEEE/ACM Trans. Netw. Early Access 10.1109/TNET.2022.3223367.(2023)
• Tsuyoshi Hirayama, Yuhao Liu, Kazuhisa Makino, Ke Shi, Chao Xu. A Polynomial Time Algorithm for Finding a Minimum 4-Partition of a Submodular Function. SODA 2023: 1680-1691
• Calvin Beideman, Karthekeyan Chandrasekaran, Chao Xu. Multicriteria cuts and size-constrained k-cuts in hypergraphs. Math. Program. 197(1): 27-69 (2023)
• Shan Hu, Yi Zhou, Mingyu Xiao, Zhang-Hua Fu, Zhipeng Lü. Listing maximal k-relaxed-vertex connected components from large graphs. Inf. Sci. 620:67-83(2023)
• Mingyu Xiao. Upper and lower bounds on approximating weighted mixed domination. Theor. Comput. Sci. 939: 292-302 (2023)
• Mengxiao Zhang, Jiamou Liu, Kaiyu Feng, Fernando Beltran, Zijian Zhang. SmartAuction: A blockchain-based secure implementation of private data queries. Future Gener. Comput. Syst. 138: 198-211 (2023)

2022

• Peng Yu, Chao Xu, Albert Bifet, Jesse Read. Linear TreeShap. NeurIPS 2022
• Calvin Beideman, Karthekeyan Chandrasekaran, Chandra Chekuri, Chao Xu. Approximate Representation of Symmetric Submodular Functions via Hypergraph Cut Functions. FSTTCS 2022: 6:1-6:18
• Yi Zhou, Shan Hu, Zimo Sheng. Extracting Densest Sub-hypergraph with Convex Edge-Weight Functions. TAMC 2022: 305-321
• Tian Bai, Mingyu Xiao. Exact and Parameterized Algorithms for Restricted Subset Feedback Vertex Set in Chordal Graphs. TAMC 2022: 249-261
• Bakh Khoussainov and Alexander Melnikov. Decomposability and computability. Algebra and Logic. 61(2):153–159 (2022)
• Jingyang Zhao, Mingyu Xiao, Chao Xu: Improved Approximation Algorithms for the Traveling Tournament Problem. MFCS 2022: 83:1-83:15
• Mingyu Xiao, Jianan Zhang, Weibo Lin. Parameterized algorithms and complexity for the traveling purchaser problem and its variants. J. Comb. Optim. 44(4): 2269-2285 (2022)
• Bakh Khoussainov, Toru Takisaka. Infinite Strings and their Large Scale Properties. J. Symb. Log. 87(2): 585-625 (2022)
• Haotian Cao, Hao Yin, Feng Gao, Zijian Zhang, Bakh Khoussainov, Shubin Xu, Liehuang Zhu. Chain-Based Covert Data Embedding Schemes in Blockchain. IEEE Internet Things J. 9(16): 14699-14707 (2022)
• Jialing He, Zijian Zhang, Jian Mao, Liran Ma, Bakh Khoussainov, Rui Jin, Liehuang Zhu. Video Aficionado. We Know What You Are Watching. IEEE Trans. Mob. Comput. 21(8): 3041-3052 (2022).
• Mingyu Xiao. An Exact MaxSAT Algorithm: Further Observations and Further Improvements. IJCAI 2022: 1887-1893.
• Mingyu Xiao, Yuchao Song, Bakh Khoussainov. Multi-Unit Auction in Social Networks with Budgets. AAAI 2022: 5228-5235.
• Cristian S. Calude, Sanjay Jain, Bakh Khoussainov, Wei Li, Frank Stephan: Deciding Parity Games in Quasi-polynomial Time. SIAM J. Comput. 51(2): 17-152 (2022)
• Binglin Tao, Mingyu Xiao, Bakh Khoussainov, Junqiang Peng. Optimal Shielding to Guarantee Region-Based Connectivity under Geographical Failures. INFOCOM 2022: 1109-1118
• Hao Yin, Zijian Zhang, Jialing He, Liran Ma, Liehuang Zhu, Meng Li, Bakh Khoussainov. Proof of Continuous Work for Reliable Data Storage Over Permissionless Blockchain. IEEE Internet Things J. 9(10): 7866-7875 (2022)
• Zimo Sheng, Mingyu Xiao. An improved kernel for planar vertex-disjoint triangle packing. Theor. Comput. Sci. 922: 122-130 (2022)
• Ton Kloks, Mingyu Xiao. A Guide to Graph Algorithms. Springer 2022, ISBN 978-981-16-6349-9, pp. 1-340.
• Yan Jin, Bowen Xiong, Kun He, Yangming Zhou, Yi Zhou. On fast enumeration of maximal cliques in large graphs. Expert Syst. Appl. 187: 115915 (2022)
• Mingyu Xiao, Shaowei Kou. A simple and improved parameterized algorithm for bicluster editing. Inf. Process. Lett. 174: 106193 (2022)
• Zhengren Wang, Yi Zhou, Mingyu Xiao, Bakh Khoussainov. Listing Maximal k-Plexes in Large Real-World Graphs. WWW 2022: 1517-1527
• Yi Zhou, Weibo Lin, Jin-Kao Hao, Mingyu Xiao, Yan Jin. An effective branch-and-bound algorithm for the maximum s-bundle problem. Eur. J. Oper. Res. 297(1):27-39 (2022)

2021

• Sen Huang, Mingyu Xiao and Xiaoyu Chen. Exact algorithms for maximum weighted independent set on sparse graphs. COCOON 2021: 617-628
• Jingyang Zhao and Mingyu Xiao. A Further Improvement on Approximating TTP-2. COCOON 2021: 137-149
• Huairui Chu, Mingyu Xiao, and Zhe Zhang. An improved upper bound for SAT. Theor. Comput. Sci. 887: 51-62 (2021)
• Yiwei Liu, Jiamou Liu, Kaibin Wan, Zhan Qin, Zijian Zhang, Bakh Khoussainov, Liehuang Zhu. From Local to Global Norm Emergence: Dissolving Self-reinforcing Substructures with Incremental Social Instruments. ICML 2021: 6871-6881
• Jingyang Zhao, Mingyu Xiao. The Traveling Tournament Problem with Maximum Tour Length Two: A Practical Algorithm with An Improved Approximation Bound. IJCAI 2021: 4206-4212
• Amir Hossein Gharehgozli, Chao Xu, Wenda Zhang. High multiplicity asymmetric traveling salesman problem with feedback vertex set and its application to storage/retrieval system. Eur. J. Oper. Res. 289(2): 495-507 (2021)
• Karthekeyan Chandrasekaran, Chao Xu, Xilin Yu. Hypergraph k-cut in randomized polynomial time. Math. Program. 186(1): 85-113 (2021)
• Junqiang Peng, Mingyu Xiao. A Fast Algorithm for SAT in Terms of Formula Length. SAT 2021: 436-452
• Mingyu Xiao, Sen Huang, Yi Zhou, Bolin Ding. Efficient Reductions and a Fast Algorithm of Maximum Weighted Independent Set. WWW 2021: 3930-3940
• Yi Zhou, Shan Hu, Mingyu Xiao, Zhang-Hua Fu. Improving Maximum k-plex Solver via Second-Order Reduction and Graph Color Bounding. AAAI 2021: 12453-12460
• Zhenyu Guo, Mingyu Xiao, Yi Zhou, Dongxiang Zhang, Kian-Lee Tan. Enhancing Balanced Graph Edge Partition with Effective Local Search. AAAI 2021: 12336-12343
• Huairui Chu, Mingyu Xiao, Zhe Zhang. An Improved Upper Bound for SAT. AAAI 2021: 3707-3714
• Xiaoyu Chen, Yi Zhou, Jin-Kao Hao. Mingyu Xiao. Computing maximum k-defective cliques in massive graphs. Comput. Oper. Res. 127: 105131 (2021)

2020

• Zijian Zhang, Nurilla Avazov, Jiamou Liu, Bakh Khoussainov, Xin Li, Keke Gai, Liehuang Zhu. WiPOS: A POS Terminal Password Inference System Based on Wireless Signals. IEEE Internet Things J. 7(8): 7506-7516 (2020)
• Shaoyuan Liu, Zhi Fang, Feng Gao, Bakh Khoussainov, Zijian Zhang, Jiamou Liu, Liehuang Zhu. Whispers on Ethereum: Blockchain-based Covert Data Embedding Schemes. BSCI 2020: 171-179
• Moses Ganardi, Bakh Khoussainov. Automatic Equivalence Structures of Polynomial Growth. CSL 2020: 21:1-21:16
• Binglin Tao, Mingyu Xiao, Jingyang Zhao. Finding Minimum-Weight Link-Disjoint Paths with a Few Common Nodes. AAAI 2020: 938-945
• Yi Zhou, Jingwei Xu, Zhenyu Guo, Mingyu Xiao, Yan Jin. Enumerating Maximal k-Plexes with Worst-Case Time Guarantee. AAAI 2020: 2442-2449
• Sen Huang, Mingyu Xiao. Object reachability via swaps under strict and weak preferences. Auton. Agents Multi Agent Syst. 34(2): 51 (2020)
• Mingyu Xiao, Hiroshi Nagamochi. Characterizing Star-PCGs. Algorithmica 82(10): 3066-3090 (2020)
• Mingyu Xiao, Hiroshi Nagamochi. Some reduction operations to pairwise compatibility graphs. Inf. Process. Lett. 153 (2020)
• Qiuxia Lai, Yongwei Nie, Hanqiu Sun, Qiang Xu, Zhensong Zhang, Mingyu Xiao. Video super-resolution via pre-frame constrained and deep-feature enhanced sparse reconstruction. Pattern Recognit. 100: 107139 (2020)
• Mingyu Xiao, Zimo Sheng. Improved parameterized algorithms and kernels for mixed domination. Theor. Comput. Sci. 815: 109-120 (2020)
• Mingyu Xiao, Shaowei Kou. Parameterized algorithms and kernels for almost induced matching. Theor. Comput. Sci. 846: 103-113 (2020)
• Zhensong Zhang, Yongwei Nie, Hanqiu Sun, Qing Zhang, Qiuxia Lai, Guiqing Li, Mingyu Xiao. Multi-View Video Synopsis via Simultaneous Object-Shifting and View-Switching Optimization. IEEE Trans. Image Process. 29: 971-985 (2020)
• Mingyu Xiao, Jiaxing Ling. Algorithms for Manipulating Sequential Allocation. AAAI 2020: 2302-2309
• Zhenyu Guo, Mingyu Xiao, Yi Zhou. The Complexity of the Partition Coloring Problem. TAMC 2020: 390-401