Mingyu Xiao

ORCID

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 115

Top Venues

Chinese University of Hong Kong, Hong Kong (PHD)

Education History

Chinese University of Hong Kong, Hong Kong

PHD

Publications

Yuhang Guo, Dong Hao, Mingyu Xiao, Bin Li
Networked Combinatorial Auction for Crowdsourcing and Crowdsensing. IEEE Internet Things J. 11 (4) (2024)
Jingyang Zhao, Mingyu Xiao
A 5-approximation Algorithm for the Traveling Tournament Problem. CoRR (2023)
Yuan Fang, Mengxiao Zhang, Jiamou Liu, Bakh Khoussainov, Mingyu Xiao
Multi-unit Auction over a Social Network. CoRR (2023)
Mingyu Xiao, Guixin Lin, Bakh Khoussainov, Yuchao Song
Characterizations of Network Auctions and Generalizations of VCG. CoRR (2023)
Jingyang Zhao, Mingyu Xiao
Improved Approximation Algorithms for Multidepot Capacitated Vehicle Routing. COCOON (2) (2023)
Mingyu Xiao
Upper and lower bounds on approximating weighted mixed domination. Theor. Comput. Sci. 939 (2023)
Mingyu Xiao, Guixin Lin, Bakh Khoussainov, Yuchao Song
Characterizations of Network Auctions and Generalizations of VCG. ECAI (2023)
Yuhao Liu, Mingyu Xiao
The (3,3)-colorability of planar graphs without 4-cycles and 5-cycles. Discret. Math. 346 (4) (2023)
Zihui Liang, Bakh Khoussainov, Mingyu Xiao
Two new algorithms for solving Müller games and their applications. CoRR (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) (2023)
Jingyang Zhao, Mingyu Xiao
Improved Approximation Algorithms for Multidepot Capacitated Vehicle Routing. CoRR (2023)
Zihui Liang, Bakh Khoussainov, Toru Takisaka, Mingyu Xiao
Connectivity in the Presence of an Opponent. ESA (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 (2023)
Mingyu Xiao, Guoliang Qiu, Sen Huang
MMS Allocations of Chores with Connectivity Constraints: New Methods and New Results. CoRR (2023)
Zimo Sheng, Mingyu Xiao
A Discharging Method: Improved Kernels for Edge Triangle Packing and Covering. CoRR (2023)
Tian Bai, Mingyu Xiao
A parameterized algorithm for subset feedback vertex set in tournaments. Theor. Comput. Sci. 975 (2023)
Zhengren Wang, Yi Zhou, Chunyu Luo, Mingyu Xiao
A Fast Maximum k-Plex Algorithm Parameterized by the Degeneracy Gap. CoRR (2023)
Kangyi Tian, Mingyu Xiao, Boting Yang
Parameterized Algorithms for Cluster Vertex Deletion on Degree-4 Graphs and General Graphs. COCOON (1) (2023)
Yuan Fang, Mengxiao Zhang, Jiamou Liu, Bakh Khoussainov, Mingyu Xiao
Multi-Unit Auction over a Social Network. ECAI (2023)
Shan Hu, Yi Zhou, Mingyu Xiao, Zhang-Hua Fu, Zhipeng Lü
-relaxed-vertex connected components from large graphs. Inf. Sci. 620 (2023)
Yuxi Liu, Mingyu Xiao
An Improved Kernel and Parameterized Algorithm for Almost Induced Matching. CoRR (2023)
Jingyang Zhao, Mingyu Xiao
The Linear Distance Traveling Tournament Problem Allows an EPTAS. AAAI (2023)
Mingyu Xiao, Guoliang Qiu, Sen Huang
MMS Allocations of Chores with Connectivity Constraints: New Methods and New Results. AAMAS (2023)
Zimo Sheng, Mingyu Xiao
A Discharging Method: Improved Kernels for Edge Triangle Packing and Covering. COCOON (2) (2023)
Jingyang Zhao, Mingyu Xiao
Improved Approximation Algorithms for Cycle and Path Packings. CoRR (2023)
Junqiang Peng, Mingyu Xiao
Further improvements for SAT in terms of formula length. Inf. Comput. 294 (2023)
Jingyang Zhao, Mingyu Xiao
The APX-hardness of the Traveling Tournament Problem. CoRR (2023)
Junqiang Peng, Mingyu Xiao
Fast Algorithms for SAT with Bounded Occurrences of Variables. IJCAI (2023)
Zihui Liang, Bakh Khoussainov, Toru Takisaka, Mingyu Xiao
Connectivity in the presence of an opponent. CoRR (2023)
Mingyu Xiao, Shaowei Kou
-vertex kernel for 3-path vertex cover. Theor. Comput. Sci. 959 (2023)
Zhengren Wang, Yi Zhou, Chunyu Luo, Mingyu Xiao
A Fast Maximum k-Plex Algorithm Parameterized by the Degeneracy Gap. IJCAI (2023)
Mengfan Ma, Mingyu Xiao, Tian Bai, Bakh Khoussainov
Facility Location Games with Entrance Fees. AAAI (2023)
Jingyang Zhao, Mingyu Xiao, Chao Xu
Improved Approximation Algorithms for the Traveling Tournament Problem. MFCS (2022)
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) (2022)
Mingyu Xiao, Yuchao Song, Bakh Khoussainov
Multi-Unit Auction in Social Networks with Budgets. AAAI (2022)
Mingyu Xiao, Jianan Zhang, Weibo Lin
Parameterized algorithms and complexity for the traveling purchaser problem and its variants. J. Comb. Optim. 44 (4) (2022)
Binglin Tao, Mingyu Xiao, Bakhadyr Khoussainov, Junqiang Peng
Optimal Shielding to Guarantee Region-Based Connectivity under Geographical Failures. INFOCOM (2022)
Zimo Sheng, Mingyu Xiao
An improved kernel for planar vertex-disjoint triangle packing. Theor. Comput. Sci. 922 (2022)
Mengfan Ma, Mingyu Xiao, Tian Bai, Bakh Khoussainov
Facility Location with Entrance Fees. CoRR (2022)
Tian Bai, Mingyu Xiao
for Subset Feedback Vertex Set in Chordal Graphs. CoRR (2022)
Tian Bai, Mingyu Xiao
Exact and Parameterized Algorithms for Restricted Subset Feedback Vertex Set in Chordal Graphs. TAMC (2022)
Jingyang Zhao, Mingyu Xiao
Improved Approximation Algorithms for Capacitated Vehicle Routing with Fixed Capacity. CoRR (2022)
Zhengren Wang, Yi Zhou, Mingyu Xiao, Bakhadyr Khoussainov
Listing Maximal k-Plexes in Large Real-World Graphs. WWW (2022)
Mingyu Xiao
An Exact MaxSAT Algorithm: Further Observations and Further Improvements. IJCAI (2022)
Mingyu Xiao, Shaowei Kou
A simple and improved parameterized algorithm for bicluster editing. Inf. Process. Lett. 174 (2022)
Jingyang Zhao, Mingyu Xiao
Practical Algorithms with Guaranteed Approximation Ratio for TTP with Maximum Tour Length Two. CoRR (2022)
Xiaoyu Chen, Yi Zhou, Jin-Kao Hao, Mingyu Xiao
-defective cliques in massive graphs. Comput. Oper. Res. 127 (2021)
Huairui Chu, Mingyu Xiao, Zhe Zhang
An Improved Upper Bound for SAT. AAAI (2021)
Jingyang Zhao, Mingyu Xiao
The Traveling Tournament Problem with Maximum Tour Length Two: A Practical Algorithm with An Improved Approximation Bound. IJCAI (2021)
Junqiang Peng, Mingyu Xiao
A Fast Algorithm for SAT in Terms of Formula Length. CoRR (2021)
Zhenyu Guo, Mingyu Xiao, Yi Zhou, Dongxiang Zhang, Kian-Lee Tan
Enhancing Balanced Graph Edge Partition with Effective Local Search. AAAI (2021)
Huairui Chu, Mingyu Xiao, Zhe Zhang
An improved upper bound for SAT. Theor. Comput. Sci. 887 (2021)
Sen Huang, Mingyu Xiao, Xiaoyu Chen
Exact algorithms for maximum weighted independent set on sparse graphs. CoRR (2021)
Yi Zhou, Shan Hu, Mingyu Xiao, Zhang-Hua Fu
Improving Maximum k-plex Solver via Second-Order Reduction and Graph Color Bounding. AAAI (2021)
Jingyang Zhao, Mingyu Xiao
A Further Improvement on Approximating TTP-2. CoRR (2021)
Jingyang Zhao, Mingyu Xiao
A Further Improvement on Approximating TTP-2. COCOON (2021)
Mingyu Xiao, Sen Huang, Yi Zhou, Bolin Ding
Efficient Reductions and a Fast Algorithm of Maximum Weighted Independent Set. WWW (2021)
Sen Huang, Mingyu Xiao, Xiaoyu Chen
Exact Algorithms for Maximum Weighted Independent Set on Sparse Graphs (Extended Abstract). COCOON (2021)
Lianjun Yang, Taoyong Jin, Xianwen Gao, Hanjiang Wen, Tilo Schöne, Mingyu Xiao, Hailan Huang
Sea Level Fusion of Satellite Altimetry and Tide Gauge Data by Deep Learning in the Mediterranean Sea. Remote. Sens. 13 (5) (2021)
Junqiang Peng, Mingyu Xiao
A Fast Algorithm for SAT in Terms of Formula Length. SAT (2021)
Zhenyu Guo, Mingyu Xiao, Yi Zhou
The Complexity of the Partition Coloring Problem. TAMC (2020)
Huairui Chu, Mingyu Xiao, Zhe Zhang
An Improved Upper Bound for SAT. CoRR (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 (2020)
Yi Zhou, Jingwei Xu, Zhenyu Guo, Mingyu Xiao, Yan Jin
-Plexes with Worst-Case Time Guarantee. AAAI (2020)
Zhenyu Guo, Mingyu Xiao, Yi Zhou
The Complexity of the Partition Coloring Problem. CoRR (2020)
Sen Huang, Mingyu Xiao
Object reachability via swaps under strict and weak preferences. Auton. Agents Multi Agent Syst. 34 (2) (2020)
Mingyu Xiao, Shaowei Kou
Parameterized algorithms and kernels for almost induced matching. Theor. Comput. Sci. 846 (2020)
Mingyu Xiao, Hiroshi Nagamochi
Bounded-Degree Cut is Fixed-Parameter Tractable. CoRR (2020)
Mingyu Xiao, Zimo Sheng
Improved parameterized algorithms and kernels for mixed domination. Theor. Comput. Sci. 815 (2020)
Mingyu Xiao, Hiroshi Nagamochi
Characterizing Star-PCGs. Algorithmica 82 (10) (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 (2020)
Mingyu Xiao, Hiroshi Nagamochi
Some reduction operations to pairwise compatibility graphs. Inf. Process. Lett. 153 (2020)
Zhenyu Guo, Mingyu Xiao, Yi Zhou, Dongxiang Zhang, Kian-Lee Tan
Enhancing Balanced Graph Edge Partition with Effective Local Search. CoRR (2020)
Mingyu Xiao, Jiaxing Ling
Algorithms for Manipulating Sequential Allocation. AAAI (2020)
Binglin Tao, Mingyu Xiao, Jingyang Zhao
Finding Minimum-Weight Link-Disjoint Paths with a Few Common Nodes. AAAI (2020)
Sen Huang, Mingyu Xiao
Object Reachability via Swaps under Strict and Weak Preferences. CoRR (2019)
Mingyu Xiao
Upper and Lower Bounds on Approximating Weighted Mixed Domination. COCOON (2019)
Sen Huang, Mingyu Xiao
Object Reachability via Swaps along a Line. AAAI (2019)
Mingyu Xiao, Jianan Zhang, Weibo Lin
Parameterized Algorithms for the Traveling Purchaser Problem with Additional Constraints. COCOON (2019)
Mingyu Xiao, Jiaxing Ling
Algorithms for Manipulating Sequential Allocation. CoRR (2019)
Weibo Lin, Mingyu Xiao, Yi Zhou, Zhenyu Guo
Computing lower bounds for minimum sum coloring and optimum cost chromatic partition. Comput. Oper. Res. 109 (2019)
Mingyu Xiao, Zimo Sheng
Improved Parameterized Algorithms for Mixed Domination. AAIM (2019)
Weibo Lin, Mingyu Xiao
-vertex kernel for edge-disjoint triangle packing. Inf. Process. Lett. 142 (2019)
Mingyu Xiao
Upper and Lower Bounds on Approximating Weighted Mixed Domination. CoRR (2019)
Weibo Lin, Zhu He, Mingyu Xiao
Balanced Clustering: A Uniform Model and Fast Algorithm. IJCAI (2019)
Mingyu Xiao, Frances A. Rosamond
Frontiers in Algorithmics. Theor. Comput. Sci. 786 (2019)
Mingyu Xiao, Hiroshi Nagamochi
Characterizing Star-PCGs. COCOON (2018)
Mingyu Xiao, Xuanbei Wang
Exact Algorithms and Complexity of Kidney Exchange. IJCAI (2018)
Mingyu Xiao, Hiroshi Nagamochi
Some Reduction Operations to Pairwise Compatibility Graphs. CoRR (2018)
Jianan Zhang, Mingyu Xiao
带权混合支配问题的近似算法研究 (Approximation Algorithm for Weighted Mixed Domination Problem). 计算机科学 45 (4) (2018)
Mingyu Xiao, Hiroshi Nagamochi
Brief Announcement: Bounded-Degree Cut is Fixed-Parameter Tractable. ICALP (2018)
Mingyu Xiao, Yuqing Wang, Binglin Tao
A Geometric Least Squares Method for Peer Assessment. AAMAS (2018)
Mingyu Xiao, Hiroshi Nagamochi
Characterizing Star-PCGs. CoRR (2018)
Mingyu Xiao
On a generalization of Nemhauser and Trotter's local optimization theorem. J. Comput. Syst. Sci. 84 (2017)
Mingyu Xiao, Shaowei Kou
Kernelization and Parameterized Algorithms for 3-Path Vertex Cover. TAMC (2017)
Mingyu Xiao, Hiroshi Nagamochi
Complexity and kernels for bipartition into degree-bounded induced graphs. Theor. Comput. Sci. 659 (2017)
Mingyu Xiao, Weibo Lin, Yuanshun Dai, Yifeng Zeng
-Plexes in Social Network Analysis. AAAI (2017)
Mingyu Xiao, Huan Tan
Exact algorithms for Maximum Induced Matching. Inf. Comput. 256 (2017)
Mingyu Xiao, Hiroshi Nagamochi
Exact algorithms for maximum independent set. Inf. Comput. 255 (2017)
Mingyu Xiao, Shaowei Kou
Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems. Theor. Comput. Sci. 657 (2017)

Mingyu Xiao.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Mingyu Xiao