| 2026 | AAAI | How Hard Is It to Rig a Tournament When Few Players Can Beat or Be Beaten by the Favorite? | Zhonghao Wang, Junqiang Peng, Yuxi Liu, Mingyu Xiao |
| 2026 | AAAI | FPT Approximation Algorithms for TSP on Non-Metric Graphs. | Jingyang Zhao, Zimo Sheng, Mingyu Xiao |
| 2026 | AAAI | A TSP-Based Algorithm for Multi-League Traveling Tournament. | Jingyang Zhao, Mingyu Xiao, Ken-ichi Kawarabayashi |
| 2026 | AAAI | Improved Algorithms for Trip-Vehicle Assignment in Ride-Sharing. | Jingyang Zhao, Mingyu Xiao, Yonghang Su |
| 2026 | COCOON | Feedback Set Problems on Bounded-Degree (Planar) Graphs. | Tian Bai, Yixin Cao, Mingyu Xiao |
| 2026 | WWW | Sustained Vertex Cover on Temporal Graphs. | Junqiang Peng, Tian Bai, Jingyang Zhao, Mingyu Xiao |
| 2026 | SAT | New Algorithms for Parity-SAT and Its Bounded-Occurrence Versions. | Sanjay Jain, Junqiang Peng, Frank Stephan, Haoyun Tang, Mingyu Xiao |
| 2025 | AAAI | Improved Approximation Algorithms for Clustered TSP and Subgroup Planning. | Jingyang Zhao, Mingyu Xiao, Junqiang Peng, Ziliang Xiong |
| 2025 | AAAI | A Matching-Based Algorithm for the Traveling Tournament Problem. | Jingyang Zhao, Mingyu Xiao |
| 2025 | ICASSP | Map-Free Visual Relocalization Enhanced by Instance Knowledge and Depth Knowledge. | Mingyu Xiao, Runze Chen, Haiyong Luo, Fang Zhao, Fan Wu, Hao Xiong, Xuepeng Ma, Juan Wang |
| 2025 | ICASSP | CSS: Overcoming Pose and Scene Challenges in Crowd-Sourced 3D Gaussian Splatting. | Runze Chen, Mingyu Xiao, Haiyong Luo, Fang Zhao, Fan Wu, Hao Xiong, Qi Liu, Meng Song |
| 2025 | ICASSP | A Conditional KAN Diffusion Network for Human Activity Recognition with Missing Sensor Signal Series. | Hao Xiong, Jiayi Gong, Haiyong Luo, Fang Zhao, Yang Gao, Runze Chen, Mingyu Xiao |
| 2025 | IJCAI | New Algorithms for #2-SAT and #3-SAT. | Junqiang Peng, Zimo Sheng, Mingyu Xiao |
| 2025 | IJCAI | Strategyproofness and Monotone Allocation of Auction in Social Networks. | Yuhang Guo, Dong Hao, Bin Li, Mingyu Xiao, Bakh Khoussainov |
| 2025 | MFCS | Improved Approximation Algorithms for Capacitated Vehicle Routing with Fixed Capacity. | Jingyang Zhao, Mingyu Xiao |
| 2025 | MFCS | Deciding Regular Games: a Playground for Exponential Time Algorithms. | Zihui Liang, Bakh Khoussainov, Mingyu Xiao |
| 2024 | AAAI | A Fast Exact Solver with Theoretical Analysis for the Maximum Edge-Weighted Clique Problem. | Lu Liu, Mingyu Xiao, Yi Zhou |
| 2024 | COCOON | Facility Assignment with Fair Cost Sharing: Equilibrium and Mechanism Design. | Mengfan Ma, Tian Bai, Xin Cheng, Mingyu Xiao |
| 2024 | COCOON | A Quadratic Vertex Kernel for Diamond-Free Edge Deletion. | Kangyi Tian, Haotian Pan, Mingyu Xiao |
| 2024 | ECAI | A Faster Branching Algorithm for the Maximum k-Defective Clique Problem. | Chunyu Luo, Yi Zhou, Zhengren Wang, Mingyu Xiao |
| 2024 | ESA | Solving Directed Multiway Cut Faster Than 2ⁿ. | Mingyu Xiao |
| 2024 | ICONIP | Improved Approximation Algorithms for the Cumulative Vehicle Routing Problem. | Jingyang Zhao, Mingyu Xiao |
| 2024 | IJCAI | A Fast Algorithm for MaxSAT above Half Number of Clauses. | Junqiang Peng, Mingyu Xiao |
| 2024 | IJCAI | A Better Approximation for Bipartite Traveling Tournament in Inter-League Sports Scheduling. | Jingyang Zhao, Mingyu Xiao |
| 2024 | IJCAI | Improved Approximation Algorithms for Capacitated Location Routing. | Jingyang Zhao, Mingyu Xiao, Shunwang Wang |
| 2024 | IJCAI | Exactly Solving Minimum Dominating Set and Its Generalization. | Ziliang Xiong, Mingyu Xiao |
| 2024 | ISAAC | Approximation Algorithms for Cumulative Vehicle Routing with Stochastic Demands. | Jingyang Zhao, Mingyu Xiao |
| 2024 | MFCS | Breaking the Barrier 2^k for Subset Feedback Vertex Set in Chordal Graphs. | Tian Bai, Mingyu Xiao |
| 2024 | TAMC | An Improved Kernel and Parameterized Algorithm for Almost Induced Matching. | Yuxi Liu, Mingyu Xiao |
| 2024 | TAMC | An Improved Approximation Algorithm for Metric Triangle Packing. | Jingyang Zhao, Mingyu Xiao |
| 2024 | WALCOM | Improved Approximation Algorithms for Cycle and Path Packings. | Jingyang Zhao, Mingyu Xiao |
| 2023 | AAAI | The Linear Distance Traveling Tournament Problem Allows an EPTAS. | Jingyang Zhao, Mingyu Xiao |
| 2023 | AAAI | Facility Location Games with Entrance Fees. | Mengfan Ma, Mingyu Xiao, Tian Bai, Bakh Khoussainov |
| 2023 | COCOON | A Discharging Method: Improved Kernels for Edge Triangle Packing and Covering. | Zimo Sheng, Mingyu Xiao |
| 2023 | COCOON | Parameterized Algorithms for Cluster Vertex Deletion on Degree-4 Graphs and General Graphs. | Kangyi Tian, Mingyu Xiao, Boting Yang |
| 2023 | COCOON | Improved Approximation Algorithms for Multidepot Capacitated Vehicle Routing. | Jingyang Zhao, Mingyu Xiao |
| 2023 | ECAI | Multi-Unit Auction over a Social Network. | Yuan Fang, Mengxiao Zhang, Jiamou Liu, Bakh Khoussainov, Mingyu Xiao |
| 2023 | ECAI | Characterizations of Network Auctions and Generalizations of VCG. | Mingyu Xiao, Guixin Lin, Bakh Khoussainov, Yuchao Song |
| 2023 | ESA | Connectivity in the Presence of an Opponent. | Zihui Liang, Bakh Khoussainov, Toru Takisaka, Mingyu Xiao |
| 2023 | IJCAI | Fast Algorithms for SAT with Bounded Occurrences of Variables. | Junqiang Peng, Mingyu Xiao |
| 2023 | IJCAI | A Fast Maximum k-Plex Algorithm Parameterized by the Degeneracy Gap. | Zhengren Wang, Yi Zhou, Chunyu Luo, Mingyu Xiao |
| 2022 | AAAI | Multi-Unit Auction in Social Networks with Budgets. | Mingyu Xiao, Yuchao Song, Bakh Khoussainov |
| 2022 | IJCAI | An Exact MaxSAT Algorithm: Further Observations and Further Improvements. | Mingyu Xiao |
| 2022 | INFOCOM | Optimal Shielding to Guarantee Region-Based Connectivity under Geographical Failures. | Binglin Tao, Mingyu Xiao, Bakhadyr Khoussainov, Junqiang Peng |
| 2022 | MFCS | Improved Approximation Algorithms for the Traveling Tournament Problem. | Jingyang Zhao, Mingyu Xiao, Chao Xu |
| 2022 | WWW | Listing Maximal k-Plexes in Large Real-World Graphs. | Zhengren Wang, Yi Zhou, Mingyu Xiao, Bakhadyr Khoussainov |
| 2022 | TAMC | Exact and Parameterized Algorithms for Restricted Subset Feedback Vertex Set in Chordal Graphs. | Tian Bai, Mingyu Xiao |
| 2021 | AAAI | An Improved Upper Bound for SAT. | Huairui Chu, Mingyu Xiao, Zhe Zhang |
| 2021 | AAAI | Enhancing Balanced Graph Edge Partition with Effective Local Search. | Zhenyu Guo, Mingyu Xiao, Yi Zhou, Dongxiang Zhang, Kian-Lee Tan |
| 2021 | AAAI | Improving Maximum k-plex Solver via Second-Order Reduction and Graph Color Bounding. | Yi Zhou, Shan Hu, Mingyu Xiao, Zhang-Hua Fu |
| 2021 | COCOON | Exact Algorithms for Maximum Weighted Independent Set on Sparse Graphs (Extended Abstract). | Sen Huang, Mingyu Xiao, Xiaoyu Chen |
| 2021 | COCOON | A Further Improvement on Approximating TTP-2. | Jingyang Zhao, Mingyu Xiao |
| 2021 | IJCAI | The Traveling Tournament Problem with Maximum Tour Length Two: A Practical Algorithm with An Improved Approximation Bound. | Jingyang Zhao, Mingyu Xiao |
| 2021 | WWW | Efficient Reductions and a Fast Algorithm of Maximum Weighted Independent Set. | Mingyu Xiao, Sen Huang, Yi Zhou, Bolin Ding |
| 2021 | SAT | A Fast Algorithm for SAT in Terms of Formula Length. | Junqiang Peng, Mingyu Xiao |
| 2020 | AAAI | Finding Minimum-Weight Link-Disjoint Paths with a Few Common Nodes. | Binglin Tao, Mingyu Xiao, Jingyang Zhao |
| 2020 | AAAI | Algorithms for Manipulating Sequential Allocation. | Mingyu Xiao, Jiaxing Ling |
| 2020 | AAAI | Enumerating Maximal | Yi Zhou, Jingwei Xu, Zhenyu Guo, Mingyu Xiao, Yan Jin |
| 2020 | TAMC | The Complexity of the Partition Coloring Problem. | Zhenyu Guo, Mingyu Xiao, Yi Zhou |
| 2019 | AAAI | Object Reachability via Swaps along a Line. | Sen Huang, Mingyu Xiao |
| 2019 | AAIM | Improved Parameterized Algorithms for Mixed Domination. | Mingyu Xiao, Zimo Sheng |
| 2019 | COCOON | Upper and Lower Bounds on Approximating Weighted Mixed Domination. | Mingyu Xiao |
| 2019 | COCOON | Parameterized Algorithms for the Traveling Purchaser Problem with Additional Constraints. | Mingyu Xiao, Jianan Zhang, Weibo Lin |
| 2019 | IJCAI | Balanced Clustering: A Uniform Model and Fast Algorithm. | Weibo Lin, Zhu He, Mingyu Xiao |
| 2018 | COCOON | Characterizing Star-PCGs. | Mingyu Xiao, Hiroshi Nagamochi |
| 2018 | ICALP | Brief Announcement: Bounded-Degree Cut is Fixed-Parameter Tractable. | Mingyu Xiao, Hiroshi Nagamochi |
| 2018 | IJCAI | Exact Algorithms and Complexity of Kidney Exchange. | Mingyu Xiao, Xuanbei Wang |
| 2017 | AAAI | A Fast Algorithm to Compute Maximum | Mingyu Xiao, Weibo Lin, Yuanshun Dai, Yifeng Zeng |
| 2017 | IJCAI | Score Aggregation via Spectral Method. | Mingyu Xiao, Yuqing Wang |
| 2017 | TAMC | Kernelization and Parameterized Algorithms for 3-Path Vertex Cover. | Mingyu Xiao, Shaowei Kou |
| 2016 | COCOON | A Parameterized Algorithm for Bounded-Degree Vertex Deletion. | Mingyu Xiao |
| 2016 | ISAAC | A Linear-Time Algorithm for Integral Multiterminal Flows in Trees. | Mingyu Xiao, Hiroshi Nagamochi |
| 2016 | MFCS | An Improved Approximation Algorithm for the Traveling Tournament Problem with Maximum Trip Length Two. | Mingyu Xiao, Shaowei Kou |
| 2016 | WG | Almost Induced Matching: Linear Kernels and Parameterized Algorithms. | Mingyu Xiao, Shaowei Kou |
| 2015 | FAW | Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in Graphs. | Mingyu Xiao, Shaowei Kou |
| 2015 | ISAAC | On a Generalization of Nemhauser and Trotter's Local Optimization Theorem. | Mingyu Xiao |
| 2015 | TAMC | An Improved Exact Algorithm for Maximum Induced Matching. | Mingyu Xiao, Huan Tan |
| 2014 | AAIM | On the Exact Block Cover Problem. | Haitao Jiang, Bing Su, Mingyu Xiao, Yinfeng Xu, Farong Zhong, Binhai Zhu |
| 2014 | AAIM | A New Linear Kernel for Undirected Planar Feedback Vertex Set: Smaller and Simpler. | Mingyu Xiao |
| 2014 | ISAAC | Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs. | Mingyu Xiao, Hiroshi Nagamochi |
| 2013 | AAIM | An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs. | Mingyu Xiao, Hiroshi Nagamochi |
| 2013 | COCOA | An Improved Exact Algorithm for Undirected Feedback Vertex Set. | Mingyu Xiao, Hiroshi Nagamochi |
| 2013 | ISAAC | Exact Algorithms for Maximum Independent Set. | Mingyu Xiao, Hiroshi Nagamochi |
| 2013 | TAMC | An Exact Algorithm for TSP in Degree-3 Graphs via Circuit Procedure and Amortization on Connectivity Structure. | Mingyu Xiao, Hiroshi Nagamochi |
| 2012 | COCOON | An Improved Exact Algorithm for TSP in Degree-4 Graphs. | Mingyu Xiao, Hiroshi Nagamochi |
| 2012 | MFCS | A Quadratic Vertex Kernel for Feedback Arc Set in Bipartite Tournaments. | Mingyu Xiao, Jiong Guo |
| 2012 | TAMC | A Refined Exact Algorithm for Edge Dominating Set. | Mingyu Xiao, Hiroshi Nagamochi |
| 2011 | AAIM | Parameterized Edge Dominating Set in Cubic Graphs - (Extended Abstract). | Mingyu Xiao, Hiroshi Nagamochi |
| 2011 | COCOA | Further Improvement on Maximum Independent Set in Degree-4 Graphs. | Mingyu Xiao, Hiroshi Nagamochi |
| 2011 | MFCS | New Parameterized Algorithms for the Edge Dominating Set Problem. | Mingyu Xiao, Ton Kloks, Sheung-Hung Poon |
| 2010 | COCOA | Exact and Parameterized Algorithms for Edge Dominating Set in 3-Degree Graphs. | Mingyu Xiao |
| 2010 | COCOON | A Note on Vertex Cover in Graphs with Maximum Degree 3. | Mingyu Xiao |
| 2010 | FAW | FPTAS's for Some Cut Problems in Weighted Trees. | Mingyu Xiao, Takuro Fukunaga, Hiroshi Nagamochi |
| 2010 | WALCOM | A Simple and Fast Algorithm for Maximum Independent Set in 3-Degree Graphs. | Mingyu Xiao |
| 2008 | CSR | Algorithms for Multiterminal Cuts. | Mingyu Xiao |
| 2008 | ISAAC | An Improved Divide-and-Conquer Algorithm for Finding All Minimum k-Way Cuts. | Mingyu Xiao |
| 2008 | TAMC | Finding Minimum 3-Way Cuts in Hypergraphs. | Mingyu Xiao |