Algorithms for Multiterminal Cuts. - Mingyu Xiao 001 (CSR, 2008)

An Improved Divide-and-Conquer Algorithm for Finding All Minimum k-Way Cuts. - Mingyu Xiao 001 (ISAAC, 2008)

Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem - Mingyu Xiao 001; Leizhen Cai; Andrew C. Yao (CoRR, 2008)

Algorithms for graph multiway partition problems. - Mingyu Xiao 001 (2008)

New Branching Rules: Improvements on Independent Set and Vertex Cover in Sparse Graphs - Mingyu Xiao 001 (CoRR, 2009)

Exact and Parameterized Algorithms for Edge Dominating Set in 3-Degree Graphs. - Mingyu Xiao 001 (COCOA (2), 2010)

A Note on Vertex Cover in Graphs with Maximum Degree 3. - Mingyu Xiao 001 (COCOON, 2010)

FPTAS's for Some Cut Problems in Weighted Trees. - Mingyu Xiao 001; Takuro Fukunaga; Hiroshi Nagamochi (FAW, 2010)

A Simple and Fast Algorithm for Maximum Independent Set in 3-Degree Graphs. - Mingyu Xiao 001 (WALCOM, 2010)

Finding minimum 3-way cuts in hypergraphs. - Mingyu Xiao 001 (Inf. Process. Lett., 2010)

Simple and Improved Parameterized Algorithms for Multiterminal Cuts. - Mingyu Xiao 001 (Theory Comput. Syst., 2010)

Parameterized Edge Dominating Set in Cubic Graphs - (Extended Abstract). - Mingyu Xiao 001; Hiroshi Nagamochi (FAW-AAIM, 2011)

Further Improvement on Maximum Independent Set in Degree-4 Graphs. - Mingyu Xiao 001; Hiroshi Nagamochi (COCOA, 2011)

Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem. - Mingyu Xiao 001; Leizhen Cai; Andrew Chi-Chih Yao (Algorithmica, 2011)

New parameterized algorithms for edge dominating set - Mingyu Xiao 001; Ton Kloks; Sheung-Hung Poon (CoRR, 2011)

An Improved Exact Algorithm for TSP in Degree-4 Graphs. - Mingyu Xiao 001; Hiroshi Nagamochi (COCOON, 2012)

New Results on Polynomial Inapproximability and Fixed Parameter Approximability of edge dominating set. - Bruno Escoffier; Jérôme Monnot; Vangelis Th. Paschos; Mingyu Xiao 001 (IPEC, 2012)

An FPT algorithm for edge subset feedback edge set. - Mingyu Xiao 001; Hiroshi Nagamochi (Inf. Process. Lett., 2012)

Exact Algorithms for Annotated Edge Dominating Set in Graphs with Degree Bounded by 3. - Mingyu Xiao 001; Hiroshi Nagamochi (IEICE Trans. Inf. Syst., 2013)

FPTASs for trimming weighted trees. - Mingyu Xiao 001; Takuro Fukunaga; Hiroshi Nagamochi (Theor. Comput. Sci., 2013)

New parameterized algorithms for the edge dominating set problem. - Mingyu Xiao 001; Ton Kloks; Sheung-Hung Poon (Theor. Comput. Sci., 2013)

Confining sets and avoiding bottleneck cases: A simple maximum independent set algorithm in degree-3 graphs. - Mingyu Xiao 001; Hiroshi Nagamochi (Theor. Comput. Sci., 2013)

Parameterized edge dominating set in graphs with degree bounded by 3. - Mingyu Xiao 001; Hiroshi Nagamochi (Theor. Comput. Sci., 2013)

On the Exact Block Cover Problem. - Haitao Jiang; Bing Su 002; Mingyu Xiao 001; Yinfeng Xu; Farong Zhong; Binhai Zhu (AAIM, 2014)

A New Linear Kernel for Undirected Planar Feedback Vertex Set: Smaller and Simpler. - Mingyu Xiao 001 (AAIM, 2014)

A refined exact algorithm for Edge Dominating Set. - Mingyu Xiao 001; Hiroshi Nagamochi (Theor. Comput. Sci., 2014)

Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in Graphs. - Mingyu Xiao 001; Shaowei Kou (FAW, 2015)

An Improved Exact Algorithm for Maximum Induced Matching. - Mingyu Xiao 001; Huan Tan (TAMC, 2015)

A Quadratic Vertex Kernel for Feedback Arc Set in Bipartite Tournaments. - Mingyu Xiao 001; Jiong Guo (Algorithmica, 2015)

Exact algorithms for dominating induced matching based on graph partition. - Mingyu Xiao 001; Hiroshi Nagamochi (Discret. Appl. Math., 2015)

An improved exact algorithm for undirected feedback vertex set. - Mingyu Xiao 001; Hiroshi Nagamochi (J. Comb. Optim., 2015)

New Results on Polynomial Inapproximabilityand Fixed Parameter Approximability of Edge Dominating Set. - Bruno Escoffier; Jérôme Monnot; Vangelis Th. Paschos; Mingyu Xiao 001 (Theory Comput. Syst., 2015)

A Parameterized Algorithm for Bounded-Degree Vertex Deletion. - Mingyu Xiao 001 (COCOON, 2016)

A Linear-Time Algorithm for Integral Multiterminal Flows in Trees. - Mingyu Xiao 001; Hiroshi Nagamochi (ISAAC, 2016)

An Improved Approximation Algorithm for the Traveling Tournament Problem with Maximum Trip Length Two. - Mingyu Xiao 001; Shaowei Kou (MFCS, 2016)

Almost Induced Matching: Linear Kernels and Parameterized Algorithms. - Mingyu Xiao 001; Shaowei Kou (WG, 2016)

An Exact Algorithm for TSP in Degree-3 Graphs Via Circuit Procedure and Amortization on Connectivity Structure. - Mingyu Xiao 001; Hiroshi Nagamochi (Algorithmica, 2016)

An exact algorithm for maximum independent set in degree-5 graphs. - Mingyu Xiao 001; Hiroshi Nagamochi (Discret. Appl. Math., 2016)

An Improved Exact Algorithm for TSP in Graphs of Maximum Degree 4. - Mingyu Xiao 001; Hiroshi Nagamochi (Theory Comput. Syst., 2016)

A Fast Algorithm to Compute Maximum k-Plexes in Social Network Analysis. - Mingyu Xiao 001; Weibo Lin; Yuanshun Dai; Yifeng Zeng (AAAI, 2017)

Score Aggregation via Spectral Method. - Mingyu Xiao 001; Yuqing Wang (IJCAI, 2017)

Kernelization and Parameterized Algorithms for 3-Path Vertex Cover. - Mingyu Xiao 001; Shaowei Kou (TAMC, 2017)

Exact algorithms for maximum independent set. - Mingyu Xiao 001; Hiroshi Nagamochi (Inf. Comput., 2017)

Exact algorithms for Maximum Induced Matching. - Mingyu Xiao 001; Huan Tan (Inf. Comput., 2017)

A refined algorithm for maximum independent set in degree-4 graphs. - Mingyu Xiao 001; Hiroshi Nagamochi (J. Comb. Optim., 2017)

On a generalization of Nemhauser and Trotter's local optimization theorem. - Mingyu Xiao 001 (J. Comput. Syst. Sci., 2017)

Linear kernels for separating a graph into components of bounded size. - Mingyu Xiao 001 (J. Comput. Syst. Sci., 2017)

Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems. - Mingyu Xiao 001; Shaowei Kou (Theor. Comput. Sci., 2017)

Complexity and kernels for bipartition into degree-bounded induced graphs. - Mingyu Xiao 001; Hiroshi Nagamochi (Theor. Comput. Sci., 2017)

A Geometric Least Squares Method for Peer Assessment. - Mingyu Xiao 001; Yuqing Wang; Binglin Tao (AAMAS, 2018)

Brief Announcement: Bounded-Degree Cut is Fixed-Parameter Tractable. - Mingyu Xiao 001; Hiroshi Nagamochi (ICALP, 2018)

Exact Algorithms and Complexity of Kidney Exchange. - Mingyu Xiao 001; Xuanbei Wang (IJCAI, 2018)

带权混合支配问题的近似算法研究 (Approximation Algorithm for Weighted Mixed Domination Problem). - Jianan Zhang; Mingyu Xiao 001 (计算机科学, 2018)

Object Reachability via Swaps along a Line. - Sen Huang; Mingyu Xiao 001 (AAAI, 2019)

Improved Parameterized Algorithms for Mixed Domination. - Mingyu Xiao 001; Zimo Sheng (AAIM, 2019)

Parameterized Algorithms for the Traveling Purchaser Problem with Additional Constraints. - Mingyu Xiao 001; Jianan Zhang; Weibo Lin (COCOON, 2019)

Balanced Clustering: A Uniform Model and Fast Algorithm. - Weibo Lin; Zhu He; Mingyu Xiao 001 (IJCAI, 2019)

Computing lower bounds for minimum sum coloring and optimum cost chromatic partition. - Weibo Lin; Mingyu Xiao 001; Yi Zhou 016; Zhenyu Guo (Comput. Oper. Res., 2019)

A (3 + ϵ)k-vertex kernel for edge-disjoint triangle packing. - Weibo Lin; Mingyu Xiao 001 (Inf. Process. Lett., 2019)

Frontiers in Algorithmics. - Mingyu Xiao 001; Frances A. Rosamond (Theor. Comput. Sci., 2019)

Finding Minimum-Weight Link-Disjoint Paths with a Few Common Nodes. - Binglin Tao; Mingyu Xiao 001; Jingyang Zhao 001 (AAAI, 2020)

Algorithms for Manipulating Sequential Allocation. - Mingyu Xiao 001; Jiaxing Ling (AAAI, 2020)

Enumerating Maximal k-Plexes with Worst-Case Time Guarantee. - Yi Zhou 016; Jingwei Xu; Zhenyu Guo; Mingyu Xiao 001; Yan Jin 005 (AAAI, 2020)

The Complexity of the Partition Coloring Problem. - Zhenyu Guo; Mingyu Xiao 001; Yi Zhou 016 (TAMC, 2020)

Object reachability via swaps under strict and weak preferences. - Sen Huang; Mingyu Xiao 001 (Auton. Agents Multi Agent Syst., 2020)

Characterizing Star-PCGs. - Mingyu Xiao 001; Hiroshi Nagamochi (Algorithmica, 2020)

Bounded-Degree Cut is Fixed-Parameter Tractable. - Mingyu Xiao 001; Hiroshi Nagamochi (CoRR, 2020)

Some reduction operations to pairwise compatibility graphs. - Mingyu Xiao 001; Hiroshi Nagamochi (Inf. Process. Lett., 2020)

Video super-resolution via pre-frame constrained and deep-feature enhanced sparse reconstruction. - Qiuxia Lai; Yongwei Nie; Hanqiu Sun; Qiang Xu 001; Zhensong Zhang; Mingyu Xiao 001 (Pattern Recognit., 2020)

Parameterized algorithms and kernels for almost induced matching. - Mingyu Xiao 001; Shaowei Kou (Theor. Comput. Sci., 2020)

Improved parameterized algorithms and kernels for mixed domination. - Mingyu Xiao 001; Zimo Sheng (Theor. Comput. Sci., 2020)

Multi-View Video Synopsis via Simultaneous Object-Shifting and View-Switching Optimization. - Zhensong Zhang; Yongwei Nie; Hanqiu Sun; Qing Zhang 006; Qiuxia Lai; Guiqing Li; Mingyu Xiao 001 (IEEE Trans. Image Process., 2020)

Enhancing Balanced Graph Edge Partition with Effective Local Search. - Zhenyu Guo; Mingyu Xiao 001; Yi Zhou 016; Dongxiang Zhang; Kian-Lee Tan (AAAI, 2021)

Improving Maximum k-plex Solver via Second-Order Reduction and Graph Color Bounding. - Yi Zhou 016; Shan Hu; Mingyu Xiao 001; Zhang-Hua Fu (AAAI, 2021)

Exact Algorithms for Maximum Weighted Independent Set on Sparse Graphs (Extended Abstract). - Sen Huang; Mingyu Xiao 001; Xiaoyu Chen (COCOON, 2021)

A Further Improvement on Approximating TTP-2. - Jingyang Zhao 001; Mingyu Xiao 001 (COCOON, 2021)

The Traveling Tournament Problem with Maximum Tour Length Two: A Practical Algorithm with An Improved Approximation Bound. - Jingyang Zhao 001; Mingyu Xiao 001 (IJCAI, 2021)

A Fast Algorithm for SAT in Terms of Formula Length. - Junqiang Peng 001; Mingyu Xiao 001 (SAT, 2021)

Efficient Reductions and a Fast Algorithm of Maximum Weighted Independent Set. - Mingyu Xiao 001; Sen Huang; Yi Zhou 016; Bolin Ding (WWW, 2021)

Computing maximum k-defective cliques in massive graphs. - Xiaoyu Chen; Yi Zhou 016; Jin-Kao Hao; Mingyu Xiao 001 (Comput. Oper. Res., 2021)

Exact algorithms for maximum weighted independent set on sparse graphs. - Sen Huang; Mingyu Xiao 001; Xiaoyu Chen (CoRR, 2021)

An improved upper bound for SAT. - Huairui Chu; Mingyu Xiao 001; Zhe Zhang (Theor. Comput. Sci., 2021)

A Guide to Graph Algorithms - Ton Kloks; Mingyu Xiao 001 (Springer, 2022)

Multi-Unit Auction in Social Networks with Budgets. - Mingyu Xiao 001; Yuchao Song; Bakh Khoussainov (AAAI, 2022)

An Exact MaxSAT Algorithm: Further Observations and Further Improvements. - Mingyu Xiao 001 (IJCAI, 2022)

Optimal Shielding to Guarantee Region-Based Connectivity under Geographical Failures. - Binglin Tao; Mingyu Xiao 001; Bakhadyr Khoussainov; Junqiang Peng 001 (INFOCOM, 2022)

Improved Approximation Algorithms for the Traveling Tournament Problem. - Jingyang Zhao 001; Mingyu Xiao 001; Chao Xu 002 (MFCS, 2022)

Exact and Parameterized Algorithms for Restricted Subset Feedback Vertex Set in Chordal Graphs. - Tian Bai 003; Mingyu Xiao 001 (TAMC, 2022)

Listing Maximal k-Plexes in Large Real-World Graphs. - Zhengren Wang; Yi Zhou 016; Mingyu Xiao 001; Bakhadyr Khoussainov (WWW, 2022)

Facility Location with Entrance Fees. - Mengfan Ma; Mingyu Xiao 001; Tian Bai 003; Bakh Khoussainov (CoRR, 2022)

Breaking the Barrier 2k for Subset Feedback Vertex Set in Chordal Graphs. - Tian Bai 003; Mingyu Xiao 001 (CoRR, 2022)

Practical Algorithms with Guaranteed Approximation Ratio for TTP with Maximum Tour Length Two. - Jingyang Zhao 001; Mingyu Xiao 001 (CoRR, 2022)

An effective branch-and-bound algorithm for the maximum s-bundle problem. - Yi Zhou 016; Weibo Lin; Jin-Kao Hao; Mingyu Xiao 001; Yan Jin 005 (Eur. J. Oper. Res., 2022)

A simple and improved parameterized algorithm for bicluster editing. - Mingyu Xiao 001; Shaowei Kou (Inf. Process. Lett., 2022)

Parameterized algorithms and complexity for the traveling purchaser problem and its variants. - Mingyu Xiao 001; Jianan Zhang; Weibo Lin (J. Comb. Optim., 2022)

An improved kernel for planar vertex-disjoint triangle packing. - Zimo Sheng; Mingyu Xiao 001 (Theor. Comput. Sci., 2022)

The Linear Distance Traveling Tournament Problem Allows an EPTAS. - Jingyang Zhao 001; Mingyu Xiao 001 (AAAI, 2023)

Facility Location Games with Entrance Fees. - Mengfan Ma; Mingyu Xiao 001; Tian Bai 003; Bakh Khoussainov (AAAI, 2023)

MMS Allocations of Chores with Connectivity Constraints: New Methods and New Results. - Mingyu Xiao 001; Guoliang Qiu 001; Sen Huang (AAMAS, 2023)

A Discharging Method: Improved Kernels for Edge Triangle Packing and Covering. - Zimo Sheng; Mingyu Xiao 001 (COCOON (2), 2023)

Parameterized Algorithms for Cluster Vertex Deletion on Degree-4 Graphs and General Graphs. - Kangyi Tian; Mingyu Xiao 001; Boting Yang (COCOON (1), 2023)

Improved Approximation Algorithms for Multidepot Capacitated Vehicle Routing. - Jingyang Zhao 001; Mingyu Xiao 001 (COCOON (2), 2023)

Multi-Unit Auction over a Social Network. - Yuan Fang; Mengxiao Zhang; Jiamou Liu; Bakh Khoussainov; Mingyu Xiao 001 (ECAI, 2023)

Characterizations of Network Auctions and Generalizations of VCG. - Mingyu Xiao 001; Guixin Lin; Bakh Khoussainov; Yuchao Song (ECAI, 2023)

Connectivity in the Presence of an Opponent. - Zihui Liang; Bakh Khoussainov; Toru Takisaka; Mingyu Xiao 001 (ESA, 2023)

Fast Algorithms for SAT with Bounded Occurrences of Variables. - Junqiang Peng 001; Mingyu Xiao 001 (IJCAI, 2023)

A Fast Maximum k-Plex Algorithm Parameterized by the Degeneracy Gap. - Zhengren Wang; Yi Zhou 016; Chunyu Luo; Mingyu Xiao 001 (IJCAI, 2023)

Two new algorithms for solving Müller games and their applications. - Zihui Liang; Bakh Khoussainov; Mingyu Xiao 001 (CoRR, 2023)

Listing maximal k-relaxed-vertex connected components from large graphs. - Shan Hu; Yi Zhou 016; Mingyu Xiao 001; Zhang-Hua Fu; Zhipeng Lü (Inf. Sci., 2023)

Upper and lower bounds on approximating weighted mixed domination. - Mingyu Xiao 001 (Theor. Comput. Sci., 2023)

The (3,3)-colorability of planar graphs without 4-cycles and 5-cycles. - Yuhao Liu 003; Mingyu Xiao 001 (Discret. Math., 2023)

A vertex-separator-based integer linear programming formulation for the partitioned Steiner tree problem. - Mengfan Ma; Ziyang Men; André Rossi; Yi Zhou 016; Mingyu Xiao 001 (Comput. Oper. Res., 2023)

A 5k-vertex kernel for 3-path vertex cover. - Mingyu Xiao 001; Shaowei Kou (Theor. Comput. Sci., 2023)

Minimum-Weight Link-Disjoint Paths With a Bounded Number of Shared Nodes. - Binglin Tao; Mingyu Xiao 001; Jingyang Zhao 001 (IEEE Trans. Netw. Serv. Manag., 2023)

Further improvements for SAT in terms of formula length. - Junqiang Peng 001; Mingyu Xiao 001 (Inf. Comput., 2023)

A parameterized algorithm for subset feedback vertex set in tournaments. - Tian Bai 003; Mingyu Xiao 001 (Theor. Comput. Sci., 2023)

A Fast Exact Solver with Theoretical Analysis for the Maximum Edge-Weighted Clique Problem. - Lu Liu; Mingyu Xiao 001; Yi Zhou 016 (AAAI, 2024)

Facility Assignment with Fair Cost Sharing: Equilibrium and Mechanism Design. - Mengfan Ma; Tian Bai 003; Xin Cheng; Mingyu Xiao 001 (COCOON (1), 2024)

A Quadratic Vertex Kernel for Diamond-Free Edge Deletion. - Kangyi Tian; Haotian Pan; Mingyu Xiao 001 (COCOON (1), 2024)

A Faster Branching Algorithm for the Maximum k-Defective Clique Problem. - Chunyu Luo; Yi Zhou 016; Zhengren Wang; Mingyu Xiao 001 (ECAI, 2024)

Solving Directed Multiway Cut Faster Than 2ⁿ. - Mingyu Xiao 001 (ESA, 2024)

Improved Approximation Algorithms for the Cumulative Vehicle Routing Problem. - Jingyang Zhao 001; Mingyu Xiao 001 (ICONIP (1), 2024)

A Fast Algorithm for MaxSAT above Half Number of Clauses. - Junqiang Peng 001; Mingyu Xiao 001 (IJCAI, 2024)

A Better Approximation for Bipartite Traveling Tournament in Inter-League Sports Scheduling. - Jingyang Zhao 001; Mingyu Xiao 001 (IJCAI, 2024)

Improved Approximation Algorithms for Capacitated Location Routing. - Jingyang Zhao 001; Mingyu Xiao 001; Shunwang Wang (IJCAI, 2024)

Exactly Solving Minimum Dominating Set and Its Generalization. - Ziliang Xiong; Mingyu Xiao 001 (IJCAI, 2024)

Approximation Algorithms for Cumulative Vehicle Routing with Stochastic Demands. - Jingyang Zhao 001; Mingyu Xiao 001 (ISAAC, 2024)

Solving Co-Path/Cycle Packing and Co-Path Packing Faster Than 3^k. - Yuxi Liu; Mingyu Xiao 001 (IPEC, 2024)

Breaking the Barrier 2^k for Subset Feedback Vertex Set in Chordal Graphs. - Tian Bai 003; Mingyu Xiao 001 (MFCS, 2024)

An Improved Kernel and Parameterized Algorithm for Almost Induced Matching. - Yuxi Liu; Mingyu Xiao 001 (TAMC, 2024)

An Improved Approximation Algorithm for Metric Triangle Packing. - Jingyang Zhao 001; Mingyu Xiao 001 (TAMC, 2024)

Improved Approximation Algorithms for Cycle and Path Packings. - Jingyang Zhao 001; Mingyu Xiao 001 (WALCOM, 2024)

Finding small feedback arc sets on large graphs. - Ziliang Xiong; Yi Zhou 016; Mingyu Xiao 001; Bakhadyr Khoussainov (Comput. Oper. Res., 2024)

Solving Co-Path/Cycle Packing Faster than 3k. - Yuxi Liu; Mingyu Xiao 001 (CoRR, 2024)

A Faster Branching Algorithm for the Maximum k-Defective Clique Problem. - Chunyu Luo; Yi Zhou 016; Zhengren Wang; Mingyu Xiao 001 (CoRR, 2024)

Deduction, Constrained Zero Forcing, and Constrained Searching. - Andrea Burgess; Danny Dyer; Kerry Ojakian; Lusheng Wang 001; Mingyu Xiao 001; Boting Yang (CoRR, 2024)

Kernelization for edge triangle packing and covering via a discharging method. - Zimo Sheng; Mingyu Xiao 001 (Theor. Comput. Sci., 2024)

A deterministic approximation algorithm for metric triangle packing. - Jingyang Zhao 001; Mingyu Xiao 001 (Theor. Comput. Sci., 2024)

Networked Combinatorial Auction for Crowdsourcing and Crowdsensing. - Yuhang Guo 003; Dong Hao; Mingyu Xiao 001; Bin Li 035 (IEEE Internet Things J., 2024)

Exact algorithms for restricted subset feedback vertex set in chordal and split graphs. - Tian Bai 003; Mingyu Xiao 001 (Theor. Comput. Sci., 2024)

Maximum Weighted Independent Set: Effective Reductions and Fast Algorithms on Sparse Graphs. - Mingyu Xiao 001; Sen Huang; Xiaoyu Chen (Algorithmica, 2024)

Improved Approximation Algorithms for Clustered TSP and Subgroup Planning. - Jingyang Zhao 001; Mingyu Xiao 001; Junqiang Peng 001; Ziliang Xiong (AAAI, 2025)

A Matching-Based Algorithm for the Traveling Tournament Problem. - Jingyang Zhao 001; Mingyu Xiao 001 (AAAI, 2025)

Improved Approximation Algorithms for Capacitated Vehicle Routing with Fixed Capacity. - Jingyang Zhao 001; Mingyu Xiao 001 (MFCS, 2025)

Deciding Regular Games: a Playground for Exponential Time Algorithms. - Zihui Liang; Bakh Khoussainov; Mingyu Xiao 001 (MFCS, 2025)

A Simplified Parameterized Algorithm for Directed Feedback Vertex Set. - Ziliang Xiong; Mingyu Xiao 001 (SOSA, 2025)

Practical Algorithms with Guaranteed Approximation Ratio for Traveling Tournament Problem with Maximum Tour Length 2. - Jingyang Zhao 001; Mingyu Xiao 001 (Math. Oper. Res., 2025)

The APX-hardness of the Traveling Tournament Problem. - Jingyang Zhao 001; Mingyu Xiao 001 (Oper. Res. Lett., 2025)

Network control games played on graphs. - Zihui Liang; Bakh Khoussainov; Mingyu Xiao 001 (Theor. Comput. Sci., 2025)

An improved kernel and parameterized algorithm for deletion to induced matching. - Yuxi Liu; Mingyu Xiao 001 (Theor. Comput. Sci., 2025)

Fast exact algorithms for the SAT problem with bounded occurrences of variables. - Junqiang Peng 001; Mingyu Xiao 001 (Theor. Comput. Sci., 2025)

Approximation algorithms for cycle and path partitions in complete graphs. - Jingyang Zhao 001; Mingyu Xiao 001 (Theor. Comput. Sci., 2025)

Multidepot capacitated vehicle routing with improved approximation guarantees. - Jingyang Zhao 001; Mingyu Xiao 001 (Theor. Comput. Sci., 2025)

A matching-based approximation algorithm for the traveling tournament problem. - Jingyang Zhao 001; Mingyu Xiao 001 (Theor. Comput. Sci., 2025)

The traveling tournament problem: Improved algorithms based on cycle packing. - Jingyang Zhao 001; Mingyu Xiao 001; Chao Xu 002 (Theor. Comput. Sci., 2025)

Joint computation offloading and resource allocation in multi-cell MEC networks. - Qimu Xiao; Mingyu Xiao 001 (J. Supercomput., 2025)

A 5-approximation algorithm for the traveling tournament problem. - Jingyang Zhao 001; Mingyu Xiao 001 (Ann. Oper. Res., 2025)

Improved FPT Approximation Algorithms for TSP. - Jingyang Zhao 001; Zimo Sheng; Mingyu Xiao 001 (CoRR, 2025)

Enhanced Approximation Algorithms for the Capacitated Location Routing Problem. - Jingyang Zhao 001; Mingyu Xiao 001; Shunwang Wang (CoRR, 2025)

Systematic Parameter Decision in Approximate Model Counting. - Jinping Lei; Toru Takisaka; Junqiang Peng 001; Mingyu Xiao 001 (CoRR, 2025)

Weighted Envy-Freeness Revisited: Indivisible Resource and House Allocations. - Yuxi Liu; Mingyu Xiao 001 (CoRR, 2025)

An Improved Algorithm for a Bipartite Traveling Tournament in Interleague Sports Scheduling. - Jingyang Zhao 001; Mingyu Xiao 001 (CoRR, 2025)

A Reduction-Driven Local Search for the Generalized Independent Set Problem. - Yiping Liu; Yi Zhou 016; Zhenxiang Xu; Mingyu Xiao 001; Jin-Kao Hao (CoRR, 2025)

A Refined Kernel for d-Hitting Set. - Yuxi Liu; Mingyu Xiao 001 (CoRR, 2025)

Approximation Algorithms for the Cumulative Vehicle Routing Problem with Stochastic Demands. - Jingyang Zhao 001; Mingyu Xiao 001 (CoRR, 2025)

Contracting with a Mechanism Designer. - Tian Bai 003; Yiding Feng; Yaohao Liu; Mengfan Ma; Mingyu Xiao 001 (CoRR, 2025)

Strategyproofness and Monotone Allocation of Auction in Social Networks. - Yuhang Guo 003; Dong Hao; Bin Li 035; Mingyu Xiao 001; Bakh Khoussainov (CoRR, 2025)

New Algorithms for #2-SAT and #3-SAT. - Junqiang Peng 001; Zimo Sheng; Mingyu Xiao 001 (CoRR, 2025)

An Improved Approximation Algorithm for the Capacitated Arc Routing Problem. - Jingyang Zhao 001; Mingyu Xiao 001 (CoRR, 2025)