Mingyu Xiao - RankMe

247 papers A* 36A 8B 19C 14Misc 12Journal 142Unranked 11

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A Faster Deterministic Algorithm for Kidney Exchange via Representative Set. CoRR Kangyi Tian, Mingyu Xiao
2026	A*	`conf`	A TSP-Based Algorithm for Multi-League Traveling Tournament. AAAI Jingyang Zhao, Mingyu Xiao, Ken-ichi Kawarabayashi
2026	J	`jnl`	Better approximation algorithms for clustered TSP and subgroup planning. Comput. Oper. Res. Jingyang Zhao, Mingyu Xiao, Junqiang Peng, Ziliang Xiong
2026	—	`ed.`	Computing and Combinatorics - 31st International Computing and Combinatorics Conference, COCOON 2025, Chengdu, China, August 15-17, 2025, Proceedings, Part I COCOON (1) Fedor V. Fomin, Mingyu Xiao
2026	—	`ed.`	Computing and Combinatorics - 31st International Computing and Combinatorics Conference, COCOON 2025, Chengdu, China, August 15-17, 2025, Proceedings, Part II COCOON (2) Fedor V. Fomin, Mingyu Xiao
2026	J	`jnl`	Exponential time algorithms for deciding regular games. Inf. Comput. Zihui Liang, Bakh Khoussainov, Mingyu Xiao
2026	A*	`conf`	FPT Approximation Algorithms for TSP on Non-Metric Graphs. AAAI Jingyang Zhao, Zimo Sheng, Mingyu Xiao
2026	J	`jnl`	Fast exact algorithms for the maximum diversity problem. Eur. J. Oper. Res. Jinping Lei, Lu Liu, Mingyu Xiao, Yi Zhou
2026	J	`jnl`	Faster Parameterized Vertex Multicut. CoRR Huairui Chu, Yuxi Liu, Daniel Lokshtanov, Junqiang Peng, Kangyi Tian, Mingyu Xiao
2026	A*	`conf`	How Hard Is It to Rig a Tournament When Few Players Can Beat or Be Beaten by the Favorite? AAAI Zhonghao Wang, Junqiang Peng, Yuxi Liu, Mingyu Xiao
2026	J	`jnl`	How Hard Is It to Rig a Tournament When Few Players Can Beat or Be Beaten by the Favorite? CoRR Zhonghao Wang, Junqiang Peng, Yuxi Liu, Mingyu Xiao
2026	A*	`conf`	Improved Algorithms for Trip-Vehicle Assignment in Ride-Sharing. AAAI Jingyang Zhao, Mingyu Xiao, Yonghang Su
2026	J	`jnl`	Improved Approximation Algorithms for the Multiple-Depot Split Delivery Vehicle Routing Problem. CoRR Jingyang Zhao, Yonghang Su, Mingyu Xiao
2026	J	`jnl`	Improved Approximations for Dial-a-Ride Problems. CoRR Jingyang Zhao, Mingyu Xiao
2026	J	`jnl`	Improved Approximations for the Unsplittable Capacitated Vehicle Routing Problem. CoRR Jingyang Zhao, Mingyu Xiao
2026	J	`jnl`	Improved approximations for the capacitated vehicle routing problem with fixed capacity. Inf. Comput. Jingyang Zhao, Mingyu Xiao
2026	J	`jnl`	Optimal Shielding to Guarantee Region-Based Connectivity Between Multiple Pairs of Nodes. IEEE Trans. Netw. Binglin Tao, Mingyu Xiao, Junqiang Peng, Zimo Sheng, Bakh Khoussainov
2026	J	`jnl`	Solving Co-Path/Cycle Packing and Co-Path Packing faster than 3. Inf. Comput. Yuxi Liu, Mingyu Xiao
2026	J	`jnl`	Special issue on selected papers from the 19th International Workshop on Algorithms and Computation (WALCOM 2025). Inf. Comput. Shin-Ichi Nakano, Mingyu Xiao
2026	A*	`conf`	Sustained Vertex Cover on Temporal Graphs. WWW Junqiang Peng, Tian Bai, Jingyang Zhao, Mingyu Xiao
2026	J	`jnl`	The Complexity of Tournament Fixing: Subset FAS Number and Acyclic Neighborhoods. CoRR Yuxi Liu, Junqiang Peng, Mingyu Xiao
2025	J	`jnl`	A 5-approximation algorithm for the traveling tournament problem. Ann. Oper. Res. Jingyang Zhao, Mingyu Xiao
2025	A*	`conf`	A Matching-Based Algorithm for the Traveling Tournament Problem. AAAI Jingyang Zhao, Mingyu Xiao
2025	J	`jnl`	A Reduction-Driven Local Search for the Generalized Independent Set Problem. CoRR Yiping Liu, Yi Zhou, Zhenxiang Xu, Mingyu Xiao, Jin-Kao Hao
2025	J	`jnl`	A Refined Kernel for CoRR Yuxi Liu, Mingyu Xiao
2025	—	`conf`	A Simplified Parameterized Algorithm for Directed Feedback Vertex Set. SOSA Ziliang Xiong, Mingyu Xiao
2025	J	`jnl`	A matching-based approximation algorithm for the traveling tournament problem. Theor. Comput. Sci. Jingyang Zhao, Mingyu Xiao
2025	J	`jnl`	An Improved Algorithm for a Bipartite Traveling Tournament in Interleague Sports Scheduling. CoRR Jingyang Zhao, Mingyu Xiao
2025	J	`jnl`	An Improved Approximation Algorithm for Maximum Weight 3-Path Packing. CoRR Jingyang Zhao, Mingyu Xiao
2025	J	`jnl`	An Improved Approximation Algorithm for the Capacitated Arc Routing Problem. CoRR Jingyang Zhao, Mingyu Xiao
2025	J	`jnl`	An improved kernel and parameterized algorithm for deletion to induced matching. Theor. Comput. Sci. Yuxi Liu, Mingyu Xiao
2025	J	`jnl`	Approximation Algorithms for the Cumulative Vehicle Routing Problem with Stochastic Demands. CoRR Jingyang Zhao, Mingyu Xiao
2025	J	`jnl`	Approximation algorithms for cycle and path partitions in complete graphs. Theor. Comput. Sci. Jingyang Zhao, Mingyu Xiao
2025	J	`jnl`	Contracting with a Mechanism Designer. CoRR Tian Bai, Yiding Feng, Yaohao Liu, Mengfan Ma, Mingyu Xiao
2025	B	`conf`	Deciding Regular Games: a Playground for Exponential Time Algorithms. MFCS Zihui Liang, Bakh Khoussainov, Mingyu Xiao
2025	J	`jnl`	Enhanced Approximation Algorithms for the Capacitated Location Routing Problem. CoRR Jingyang Zhao, Mingyu Xiao, Shunwang Wang
2025	J	`jnl`	Fast exact algorithms for the SAT problem with bounded occurrences of variables. Theor. Comput. Sci. Junqiang Peng, Mingyu Xiao
2025	B	`conf`	Improved Approximation Algorithms for Capacitated Vehicle Routing with Fixed Capacity. MFCS Jingyang Zhao, Mingyu Xiao
2025	A*	`conf`	Improved Approximation Algorithms for Clustered TSP and Subgroup Planning. AAAI Jingyang Zhao, Mingyu Xiao, Junqiang Peng, Ziliang Xiong
2025	J	`jnl`	Improved FPT Approximation Algorithms for TSP. CoRR Jingyang Zhao, Zimo Sheng, Mingyu Xiao
2025	J	`jnl`	Improved Parameterized Algorithms for Cluster Vertex Deletion. Theory Comput. Syst. Kangyi Tian, Mingyu Xiao, Boting Yang
2025	J	`jnl`	Joint computation offloading and resource allocation in multi-cell MEC networks. J. Supercomput. Qimu Xiao, Mingyu Xiao
2025	J	`jnl`	Multidepot capacitated vehicle routing with improved approximation guarantees. Theor. Comput. Sci. Jingyang Zhao, Mingyu Xiao
2025	J	`jnl`	Network control games played on graphs. Theor. Comput. Sci. Zihui Liang, Bakh Khoussainov, Mingyu Xiao
2025	A*	`conf`	New Algorithms for #2-SAT and #3-SAT. IJCAI Junqiang Peng, Zimo Sheng, Mingyu Xiao
2025	J	`jnl`	New Algorithms for #2-SAT and #3-SAT. CoRR Junqiang Peng, Zimo Sheng, Mingyu Xiao
2025	J	`jnl`	Practical Algorithms with Guaranteed Approximation Ratio for Traveling Tournament Problem with Maximum Tour Length 2. Math. Oper. Res. Jingyang Zhao, Mingyu Xiao
2025	A*	`conf`	Strategyproofness and Monotone Allocation of Auction in Social Networks. IJCAI Yuhang Guo, Dong Hao, Bin Li, Mingyu Xiao, Bakh Khoussainov
2025	J	`jnl`	Strategyproofness and Monotone Allocation of Auction in Social Networks. CoRR Yuhang Guo, Dong Hao, Bin Li, Mingyu Xiao, Bakh Khoussainov
2025	J	`jnl`	Systematic Parameter Decision in Approximate Model Counting. CoRR Jinping Lei, Toru Takisaka, Junqiang Peng, Mingyu Xiao
2025	J	`jnl`	The APX-hardness of the Traveling Tournament Problem. Oper. Res. Lett. Jingyang Zhao, Mingyu Xiao
2025	J	`jnl`	The traveling tournament problem: Improved algorithms based on cycle packing. Theor. Comput. Sci. Jingyang Zhao, Mingyu Xiao, Chao Xu
2025	B	`ed.`	WALCOM: Algorithms and Computation - 19th International Conference and Workshops on Algorithms and Computation, WALCOM 2025, Chengdu, China, February 28 - March 2, 2025, Proceedings WALCOM Shin-Ichi Nakano, Mingyu Xiao
2025	J	`jnl`	Weighted Envy-Freeness Revisited: Indivisible Resource and House Allocations. CoRR Yuxi Liu, Mingyu Xiao
2024	A*	`conf`	A Better Approximation for Bipartite Traveling Tournament in Inter-League Sports Scheduling. IJCAI Jingyang Zhao, Mingyu Xiao
2024	A*	`conf`	A Fast Algorithm for MaxSAT above Half Number of Clauses. IJCAI Junqiang Peng, Mingyu Xiao
2024	A*	`conf`	A Fast Exact Solver with Theoretical Analysis for the Maximum Edge-Weighted Clique Problem. AAAI Lu Liu, Mingyu Xiao, Yi Zhou
2024	J	`jnl`	A Faster Branching Algorithm for the Maximum CoRR Chunyu Luo, Yi Zhou, Zhengren Wang, Mingyu Xiao
2024	A	`conf`	A Faster Branching Algorithm for the Maximum k-Defective Clique Problem. ECAI Chunyu Luo, Yi Zhou, Zhengren Wang, Mingyu Xiao
2024	—	`conf`	A Quadratic Vertex Kernel for Diamond-Free Edge Deletion. COCOON (1) Kangyi Tian, Haotian Pan, Mingyu Xiao
2024	J	`jnl`	A Simplified Parameterized Algorithm for Directed Feedback Vertex Set. CoRR Ziliang Xiong, Mingyu Xiao
2024	J	`jnl`	A deterministic approximation algorithm for metric triangle packing. Theor. Comput. Sci. Jingyang Zhao, Mingyu Xiao
2024	C	`conf`	An Improved Approximation Algorithm for Metric Triangle Packing. TAMC Jingyang Zhao, Mingyu Xiao
2024	J	`jnl`	An Improved Approximation Algorithm for Metric Triangle Packing. CoRR Jingyang Zhao, Mingyu Xiao
2024	C	`conf`	An Improved Kernel and Parameterized Algorithm for Almost Induced Matching. TAMC Yuxi Liu, Mingyu Xiao
2024	B	`conf`	Approximation Algorithms for Cumulative Vehicle Routing with Stochastic Demands. ISAAC Jingyang Zhao, Mingyu Xiao
2024	B	`conf`	Breaking the Barrier 2^k for Subset Feedback Vertex Set in Chordal Graphs. MFCS Tian Bai, Mingyu Xiao
2024	J	`jnl`	Deciding regular games: a playground for exponential time algorithms. CoRR Zihui Liang, Bakh Khoussainov, Mingyu Xiao
2024	J	`jnl`	Deduction, Constrained Zero Forcing, and Constrained Searching. CoRR Andrea C. Burgess, Danny Dyer, Kerry Ojakian, Lusheng Wang, Mingyu Xiao, Boting Yang
2024	J	`jnl`	Exact algorithms for restricted subset feedback vertex set in chordal and split graphs. Theor. Comput. Sci. Tian Bai, Mingyu Xiao
2024	A*	`conf`	Exactly Solving Minimum Dominating Set and Its Generalization. IJCAI Ziliang Xiong, Mingyu Xiao
2024	—	`conf`	Facility Assignment with Fair Cost Sharing: Equilibrium and Mechanism Design. COCOON (1) Mengfan Ma, Tian Bai, Xin Cheng, Mingyu Xiao
2024	J	`jnl`	Facility Assignment with Fair Cost Sharing: Equilibrium and Mechanism Design. CoRR Mengfan Ma, Mingyu Xiao, Tian Bai, Xin Cheng
2024	J	`jnl`	Finding small feedback arc sets on large graphs. Comput. Oper. Res. Ziliang Xiong, Yi Zhou, Mingyu Xiao, Bakhadyr Khoussainov
2024	A*	`conf`	Improved Approximation Algorithms for Capacitated Location Routing. IJCAI Jingyang Zhao, Mingyu Xiao, Shunwang Wang
2024	B	`conf`	Improved Approximation Algorithms for Cycle and Path Packings. WALCOM Jingyang Zhao, Mingyu Xiao
2024	—	`conf`	Improved Approximation Algorithms for the Cumulative Vehicle Routing Problem. ICONIP (1) Jingyang Zhao, Mingyu Xiao
2024	J	`jnl`	Kernelization for edge triangle packing and covering via a discharging method. Theor. Comput. Sci. Zimo Sheng, Mingyu Xiao
2024	J	`jnl`	Maximum Weighted Independent Set: Effective Reductions and Fast Algorithms on Sparse Graphs. Algorithmica Mingyu Xiao, Sen Huang, Xiaoyu Chen
2024	J	`jnl`	Networked Combinatorial Auction for Crowdsourcing and Crowdsensing. IEEE Internet Things J. Yuhang Guo, Dong Hao, Mingyu Xiao, Bin Li
2024	—	`conf`	Price of Non-discrimination in Public Combinatorial Contracts. WINE Yiding Feng, Mengfan Ma, Mingyu Xiao
2024	J	`jnl`	Solving Co-Path/Cycle Packing Faster than 3 CoRR Yuxi Liu, Mingyu Xiao
2024	B	`conf`	Solving Co-Path/Cycle Packing and Co-Path Packing Faster Than 3^k. IPEC Yuxi Liu, Mingyu Xiao
2024	A	`conf`	Solving Directed Multiway Cut Faster Than 2ⁿ. ESA Mingyu Xiao
2024	J	`jnl`	The Traveling Tournament Problem: Improved Algorithms Based on Cycle Packing. CoRR Jingyang Zhao, Mingyu Xiao, Chao Xu
2024	—	`ed.`	Theoretical Computer Science - 41st National Conference, NCTCS 2023, Guangzhou, China, July 21-23, 2023, Revised Selected Papers NCTCS Zhiping Cai, Mingyu Xiao, Jialin Zhang
2023	J	`jnl`	A 5 Theor. Comput. Sci. Mingyu Xiao, Shaowei Kou
2023	J	`jnl`	A 5-approximation Algorithm for the Traveling Tournament Problem. CoRR Jingyang Zhao, Mingyu Xiao
2023	—	`conf`	A Discharging Method: Improved Kernels for Edge Triangle Packing and Covering. COCOON (2) Zimo Sheng, Mingyu Xiao
2023	J	`jnl`	A Discharging Method: Improved Kernels for Edge Triangle Packing and Covering. CoRR Zimo Sheng, Mingyu Xiao
2023	A*	`conf`	A Fast Maximum k-Plex Algorithm Parameterized by the Degeneracy Gap. IJCAI Zhengren Wang, Yi Zhou, Chunyu Luo, Mingyu Xiao
2023	J	`jnl`	A Fast Maximum k-Plex Algorithm Parameterized by the Degeneracy Gap. CoRR Zhengren Wang, Yi Zhou, Chunyu Luo, Mingyu Xiao
2023	J	`jnl`	A parameterized algorithm for subset feedback vertex set in tournaments. Theor. Comput. Sci. Tian Bai, Mingyu Xiao
2023	J	`jnl`	A vertex-separator-based integer linear programming formulation for the partitioned Steiner tree problem. Comput. Oper. Res. Mengfan Ma, Ziyang Men, André Rossi, Yi Zhou, Mingyu Xiao
2023	J	`jnl`	An Improved Kernel and Parameterized Algorithm for Almost Induced Matching. CoRR Yuxi Liu, Mingyu Xiao
2023	A	`conf`	Characterizations of Network Auctions and Generalizations of VCG. ECAI Mingyu Xiao, Guixin Lin, Bakh Khoussainov, Yuchao Song
2023	J	`jnl`	Characterizations of Network Auctions and Generalizations of VCG. CoRR Mingyu Xiao, Guixin Lin, Bakh Khoussainov, Yuchao Song
2023	A	`conf`	Connectivity in the Presence of an Opponent. ESA Zihui Liang, Bakh Khoussainov, Toru Takisaka, Mingyu Xiao
2023	J	`jnl`	Connectivity in the presence of an opponent. CoRR Zihui Liang, Bakh Khoussainov, Toru Takisaka, Mingyu Xiao
2023	A*	`conf`	Facility Location Games with Entrance Fees. AAAI Mengfan Ma, Mingyu Xiao, Tian Bai, Bakh Khoussainov
2023	A*	`conf`	Fast Algorithms for SAT with Bounded Occurrences of Variables. IJCAI Junqiang Peng, Mingyu Xiao
2023	J	`jnl`	Further improvements for SAT in terms of formula length. Inf. Comput. Junqiang Peng, Mingyu Xiao
2023	J	`jnl`	Improved Approximation Algorithms for Cycle and Path Packings. CoRR Jingyang Zhao, Mingyu Xiao
2023	—	`conf`	Improved Approximation Algorithms for Multidepot Capacitated Vehicle Routing. COCOON (2) Jingyang Zhao, Mingyu Xiao
2023	J	`jnl`	Improved Approximation Algorithms for Multidepot Capacitated Vehicle Routing. CoRR Jingyang Zhao, Mingyu Xiao
2023	J	`jnl`	Listing maximal Inf. Sci. Shan Hu, Yi Zhou, Mingyu Xiao, Zhang-Hua Fu, Zhipeng Lü
2023	A	`conf`	MMS Allocations of Chores with Connectivity Constraints: New Methods and New Results. AAMAS Mingyu Xiao, Guoliang Qiu, Sen Huang
2023	J	`jnl`	MMS Allocations of Chores with Connectivity Constraints: New Methods and New Results. CoRR Mingyu Xiao, Guoliang Qiu, Sen Huang
2023	J	`jnl`	Minimum-Weight Link-Disjoint Paths With a Bounded Number of Shared Nodes. IEEE Trans. Netw. Serv. Manag. Binglin Tao, Mingyu Xiao, Jingyang Zhao
2023	A	`conf`	Multi-Unit Auction over a Social Network. ECAI Yuan Fang, Mengxiao Zhang, Jiamou Liu, Bakh Khoussainov, Mingyu Xiao
2023	J	`jnl`	Multi-unit Auction over a Social Network. CoRR Yuan Fang, Mengxiao Zhang, Jiamou Liu, Bakh Khoussainov, Mingyu Xiao
2023	—	`conf`	Parameterized Algorithms for Cluster Vertex Deletion on Degree-4 Graphs and General Graphs. COCOON (1) Kangyi Tian, Mingyu Xiao, Boting Yang
2023	J	`jnl`	The (3,3)-colorability of planar graphs without 4-cycles and 5-cycles. Discret. Math. Yuhao Liu, Mingyu Xiao
2023	J	`jnl`	The APX-hardness of the Traveling Tournament Problem. CoRR Jingyang Zhao, Mingyu Xiao
2023	A*	`conf`	The Linear Distance Traveling Tournament Problem Allows an EPTAS. AAAI Jingyang Zhao, Mingyu Xiao
2023	J	`jnl`	Two new algorithms for solving Müller games and their applications. CoRR Zihui Liang, Bakh Khoussainov, Mingyu Xiao
2023	J	`jnl`	Upper and lower bounds on approximating weighted mixed domination. Theor. Comput. Sci. Mingyu Xiao
2022	—	`book`	A Guide to Graph Algorithms Ton Kloks, Mingyu Xiao
2022	J	`jnl`	A simple and improved parameterized algorithm for bicluster editing. Inf. Process. Lett. Mingyu Xiao, Shaowei Kou
2022	A*	`conf`	An Exact MaxSAT Algorithm: Further Observations and Further Improvements. IJCAI Mingyu Xiao
2022	J	`jnl`	An effective branch-and-bound algorithm for the maximum s-bundle problem. Eur. J. Oper. Res. Yi Zhou, Weibo Lin, Jin-Kao Hao, Mingyu Xiao, Yan Jin
2022	J	`jnl`	An improved kernel for planar vertex-disjoint triangle packing. Theor. Comput. Sci. Zimo Sheng, Mingyu Xiao
2022	J	`jnl`	Breaking the Barrier 2 CoRR Tian Bai, Mingyu Xiao
2022	C	`conf`	Exact and Parameterized Algorithms for Restricted Subset Feedback Vertex Set in Chordal Graphs. TAMC Tian Bai, Mingyu Xiao
2022	J	`jnl`	Facility Location with Entrance Fees. CoRR Mengfan Ma, Mingyu Xiao, Tian Bai, Bakh Khoussainov
2022	J	`jnl`	Improved Approximation Algorithms for Capacitated Vehicle Routing with Fixed Capacity. CoRR Jingyang Zhao, Mingyu Xiao
2022	B	`conf`	Improved Approximation Algorithms for the Traveling Tournament Problem. MFCS Jingyang Zhao, Mingyu Xiao, Chao Xu
2022	A*	`conf`	Listing Maximal k-Plexes in Large Real-World Graphs. WWW Zhengren Wang, Yi Zhou, Mingyu Xiao, Bakhadyr Khoussainov
2022	J	`jnl`	Listing Maximal k-Plexes in Large Real-World Graphs. CoRR Zhengren Wang, Yi Zhou, Mingyu Xiao, Bakhadyr Khoussainov
2022	A*	`conf`	Multi-Unit Auction in Social Networks with Budgets. AAAI Mingyu Xiao, Yuchao Song, Bakh Khoussainov
2022	A*	`conf`	Optimal Shielding to Guarantee Region-Based Connectivity under Geographical Failures. INFOCOM Binglin Tao, Mingyu Xiao, Bakhadyr Khoussainov, Junqiang Peng
2022	J	`jnl`	Parameterized algorithms and complexity for the traveling purchaser problem and its variants. J. Comb. Optim. Mingyu Xiao, Jianan Zhang, Weibo Lin
2022	J	`jnl`	Practical Algorithms with Guaranteed Approximation Ratio for TTP with Maximum Tour Length Two. CoRR Jingyang Zhao, Mingyu Xiao
2021	A	`conf`	A Fast Algorithm for SAT in Terms of Formula Length. SAT Junqiang Peng, Mingyu Xiao
2021	J	`jnl`	A Fast Algorithm for SAT in Terms of Formula Length. CoRR Junqiang Peng, Mingyu Xiao
2021	Misc	`conf`	A Further Improvement on Approximating TTP-2. COCOON Jingyang Zhao, Mingyu Xiao
2021	J	`jnl`	A Further Improvement on Approximating TTP-2. CoRR Jingyang Zhao, Mingyu Xiao
2021	A*	`conf`	An Improved Upper Bound for SAT. AAAI Huairui Chu, Mingyu Xiao, Zhe Zhang
2021	J	`jnl`	An improved upper bound for SAT. Theor. Comput. Sci. Huairui Chu, Mingyu Xiao, Zhe Zhang
2021	J	`jnl`	Computing maximum Comput. Oper. Res. Xiaoyu Chen, Yi Zhou, Jin-Kao Hao, Mingyu Xiao
2021	A*	`conf`	Efficient Reductions and a Fast Algorithm of Maximum Weighted Independent Set. WWW Mingyu Xiao, Sen Huang, Yi Zhou, Bolin Ding
2021	A*	`conf`	Enhancing Balanced Graph Edge Partition with Effective Local Search. AAAI Zhenyu Guo, Mingyu Xiao, Yi Zhou, Dongxiang Zhang, Kian-Lee Tan
2021	Misc	`conf`	Exact Algorithms for Maximum Weighted Independent Set on Sparse Graphs (Extended Abstract). COCOON Sen Huang, Mingyu Xiao, Xiaoyu Chen
2021	J	`jnl`	Exact algorithms for maximum weighted independent set on sparse graphs. CoRR Sen Huang, Mingyu Xiao, Xiaoyu Chen
2021	A*	`conf`	Improving Maximum k-plex Solver via Second-Order Reduction and Graph Color Bounding. AAAI Yi Zhou, Shan Hu, Mingyu Xiao, Zhang-Hua Fu
2021	A*	`conf`	The Traveling Tournament Problem with Maximum Tour Length Two: A Practical Algorithm with An Improved Approximation Bound. IJCAI Jingyang Zhao, Mingyu Xiao
2020	A*	`conf`	Algorithms for Manipulating Sequential Allocation. AAAI Mingyu Xiao, Jiaxing Ling
2020	J	`jnl`	An Improved Upper Bound for SAT. CoRR Huairui Chu, Mingyu Xiao, Zhe Zhang
2020	J	`jnl`	Bounded-Degree Cut is Fixed-Parameter Tractable. CoRR Mingyu Xiao, Hiroshi Nagamochi
2020	J	`jnl`	Characterizing Star-PCGs. Algorithmica Mingyu Xiao, Hiroshi Nagamochi
2020	J	`jnl`	Enhancing Balanced Graph Edge Partition with Effective Local Search. CoRR Zhenyu Guo, Mingyu Xiao, Yi Zhou, Dongxiang Zhang, Kian-Lee Tan
2020	A*	`conf`	Enumerating Maximal AAAI Yi Zhou, Jingwei Xu, Zhenyu Guo, Mingyu Xiao, Yan Jin
2020	A*	`conf`	Finding Minimum-Weight Link-Disjoint Paths with a Few Common Nodes. AAAI Binglin Tao, Mingyu Xiao, Jingyang Zhao
2020	J	`jnl`	Improved parameterized algorithms and kernels for mixed domination. Theor. Comput. Sci. Mingyu Xiao, Zimo Sheng
2020	J	`jnl`	Multi-View Video Synopsis via Simultaneous Object-Shifting and View-Switching Optimization. IEEE Trans. Image Process. Zhensong Zhang, Yongwei Nie, Hanqiu Sun, Qing Zhang, Qiuxia Lai, Guiqing Li, Mingyu Xiao
2020	J	`jnl`	Object reachability via swaps under strict and weak preferences. Auton. Agents Multi Agent Syst. Sen Huang, Mingyu Xiao
2020	J	`jnl`	Parameterized algorithms and kernels for almost induced matching. Theor. Comput. Sci. Mingyu Xiao, Shaowei Kou
2020	J	`jnl`	Some reduction operations to pairwise compatibility graphs. Inf. Process. Lett. Mingyu Xiao, Hiroshi Nagamochi
2020	C	`conf`	The Complexity of the Partition Coloring Problem. TAMC Zhenyu Guo, Mingyu Xiao, Yi Zhou
2020	J	`jnl`	The Complexity of the Partition Coloring Problem. CoRR Zhenyu Guo, Mingyu Xiao, Yi Zhou
2020	J	`jnl`	Video super-resolution via pre-frame constrained and deep-feature enhanced sparse reconstruction. Pattern Recognit. Qiuxia Lai, Yongwei Nie, Hanqiu Sun, Qiang Xu, Zhensong Zhang, Mingyu Xiao
2019	J	`jnl`	A (3 +  Inf. Process. Lett. Weibo Lin, Mingyu Xiao
2019	J	`jnl`	Algorithms for Manipulating Sequential Allocation. CoRR Mingyu Xiao, Jiaxing Ling
2019	A*	`conf`	Balanced Clustering: A Uniform Model and Fast Algorithm. IJCAI Weibo Lin, Zhu He, Mingyu Xiao
2019	J	`jnl`	Computing lower bounds for minimum sum coloring and optimum cost chromatic partition. Comput. Oper. Res. Weibo Lin, Mingyu Xiao, Yi Zhou, Zhenyu Guo
2019	J	`jnl`	Frontiers in Algorithmics. Theor. Comput. Sci. Mingyu Xiao, Frances A. Rosamond
2019	C	`conf`	Improved Parameterized Algorithms for Mixed Domination. AAIM Mingyu Xiao, Zimo Sheng
2019	A*	`conf`	Object Reachability via Swaps along a Line. AAAI Sen Huang, Mingyu Xiao
2019	J	`jnl`	Object Reachability via Swaps under Strict and Weak Preferences. CoRR Sen Huang, Mingyu Xiao
2019	Misc	`conf`	Parameterized Algorithms for the Traveling Purchaser Problem with Additional Constraints. COCOON Mingyu Xiao, Jianan Zhang, Weibo Lin
2019	Misc	`conf`	Upper and Lower Bounds on Approximating Weighted Mixed Domination. COCOON Mingyu Xiao
2019	J	`jnl`	Upper and Lower Bounds on Approximating Weighted Mixed Domination. CoRR Mingyu Xiao
2018	A	`conf`	A Geometric Least Squares Method for Peer Assessment. AAMAS Mingyu Xiao, Yuqing Wang, Binglin Tao
2018	A*	`conf`	Brief Announcement: Bounded-Degree Cut is Fixed-Parameter Tractable. ICALP Mingyu Xiao, Hiroshi Nagamochi
2018	Misc	`conf`	Characterizing Star-PCGs. COCOON Mingyu Xiao, Hiroshi Nagamochi
2018	J	`jnl`	Characterizing Star-PCGs. CoRR Mingyu Xiao, Hiroshi Nagamochi
2018	A*	`conf`	Exact Algorithms and Complexity of Kidney Exchange. IJCAI Mingyu Xiao, Xuanbei Wang
2018	J	`jnl`	Some Reduction Operations to Pairwise Compatibility Graphs. CoRR Mingyu Xiao, Hiroshi Nagamochi
2018	J	`jnl`	带权混合支配问题的近似算法研究 (Approximation Algorithm for Weighted Mixed Domination Problem). 计算机科学 Jianan Zhang, Mingyu Xiao
2017	A*	`conf`	A Fast Algorithm to Compute Maximum AAAI Mingyu Xiao, Weibo Lin, Yuanshun Dai, Yifeng Zeng
2017	J	`jnl`	A refined algorithm for maximum independent set in degree-4 graphs. J. Comb. Optim. Mingyu Xiao, Hiroshi Nagamochi
2017	J	`jnl`	Complexity and kernels for bipartition into degree-bounded induced graphs. Theor. Comput. Sci. Mingyu Xiao, Hiroshi Nagamochi
2017	J	`jnl`	Exact algorithms for Maximum Induced Matching. Inf. Comput. Mingyu Xiao, Huan Tan
2017	J	`jnl`	Exact algorithms for maximum independent set. Inf. Comput. Mingyu Xiao, Hiroshi Nagamochi
2017	J	`jnl`	Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems. Theor. Comput. Sci. Mingyu Xiao, Shaowei Kou
2017	Misc	`ed.`	Frontiers in Algorithmics - 11th International Workshop, FAW 2017, Chengdu, China, June 23-25, 2017, Proceedings FAW Mingyu Xiao, Frances A. Rosamond
2017	C	`conf`	Kernelization and Parameterized Algorithms for 3-Path Vertex Cover. TAMC Mingyu Xiao, Shaowei Kou
2017	J	`jnl`	Linear kernels for separating a graph into components of bounded size. J. Comput. Syst. Sci. Mingyu Xiao
2017	J	`jnl`	On a generalization of Nemhauser and Trotter's local optimization theorem. J. Comput. Syst. Sci. Mingyu Xiao
2017	A*	`conf`	Score Aggregation via Spectral Method. IJCAI Mingyu Xiao, Yuqing Wang
2016	B	`conf`	A Linear-Time Algorithm for Integral Multiterminal Flows in Trees. ISAAC Mingyu Xiao, Hiroshi Nagamochi
2016	J	`jnl`	A Linear-time Algorithm for Integral Multiterminal Flows in Trees. CoRR Mingyu Xiao, Hiroshi Nagamochi
2016	Misc	`conf`	A Parameterized Algorithm for Bounded-Degree Vertex Deletion. COCOON Mingyu Xiao
2016	J	`jnl`	A Parameterized algorithm for Bounded-Degree Vertex Deletion. CoRR Mingyu Xiao
2016	B	`conf`	Almost Induced Matching: Linear Kernels and Parameterized Algorithms. WG Mingyu Xiao, Shaowei Kou
2016	J	`jnl`	An Exact Algorithm for TSP in Degree-3 Graphs Via Circuit Procedure and Amortization on Connectivity Structure. Algorithmica Mingyu Xiao, Hiroshi Nagamochi
2016	B	`conf`	An Improved Approximation Algorithm for the Traveling Tournament Problem with Maximum Trip Length Two. MFCS Mingyu Xiao, Shaowei Kou
2016	J	`jnl`	An Improved Exact Algorithm for TSP in Graphs of Maximum Degree 4. Theory Comput. Syst. Mingyu Xiao, Hiroshi Nagamochi
2016	J	`jnl`	An exact algorithm for maximum independent set in degree-5 graphs. Discret. Appl. Math. Mingyu Xiao, Hiroshi Nagamochi
2016	J	`jnl`	Kernelization and Parameterized Algorithms for 3-Path Vertex Cover. CoRR Mingyu Xiao, Shaowei Kou
2016	J	`jnl`	Linear Kernels for Separating a Graph into Components of Bounded Size. CoRR Mingyu Xiao
2016	J	`jnl`	On a generalization of Nemhauser and Trotter's local optimization theorem. CoRR Mingyu Xiao
2015	J	`jnl`	A Quadratic Vertex Kernel for Feedback Arc Set in Bipartite Tournaments. Algorithmica Mingyu Xiao, Jiong Guo
2015	C	`conf`	An Improved Exact Algorithm for Maximum Induced Matching. TAMC Mingyu Xiao, Huan Tan
2015	J	`jnl`	An improved exact algorithm for undirected feedback vertex set. J. Comb. Optim. Mingyu Xiao, Hiroshi Nagamochi
2015	J	`jnl`	Exact algorithms for dominating induced matching based on graph partition. Discret. Appl. Math. Mingyu Xiao, Hiroshi Nagamochi
2015	Misc	`conf`	Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in Graphs. FAW Mingyu Xiao, Shaowei Kou
2015	J	`jnl`	New Results on Polynomial Inapproximabilityand Fixed Parameter Approximability of Edge Dominating Set. Theory Comput. Syst. Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos, Mingyu Xiao
2015	B	`conf`	On a Generalization of Nemhauser and Trotter's Local Optimization Theorem. ISAAC Mingyu Xiao
2014	C	`conf`	A New Linear Kernel for Undirected Planar Feedback Vertex Set: Smaller and Simpler. AAIM Mingyu Xiao
2014	J	`jnl`	A refined exact algorithm for Edge Dominating Set. Theor. Comput. Sci. Mingyu Xiao, Hiroshi Nagamochi
2014	B	`conf`	Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs. ISAAC Mingyu Xiao, Hiroshi Nagamochi
2014	J	`jnl`	Exact Algorithms for Dominating Induced Matching Based on Graph Partition. CoRR Mingyu Xiao, Hiroshi Nagamochi
2014	C	`conf`	On the Exact Block Cover Problem. AAIM Haitao Jiang, Bing Su, Mingyu Xiao, Yinfeng Xu, Farong Zhong, Binhai Zhu
2013	—	`conf`	An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs. FAW-AAIM Mingyu Xiao, Hiroshi Nagamochi
2013	C	`conf`	An Exact Algorithm for TSP in Degree-3 Graphs via Circuit Procedure and Amortization on Connectivity Structure. TAMC Mingyu Xiao, Hiroshi Nagamochi
2013	C	`conf`	An Improved Exact Algorithm for Undirected Feedback Vertex Set. COCOA Mingyu Xiao, Hiroshi Nagamochi
2013	J	`jnl`	Confining sets and avoiding bottleneck cases: A simple maximum independent set algorithm in degree-3 graphs. Theor. Comput. Sci. Mingyu Xiao, Hiroshi Nagamochi
2013	J	`jnl`	Exact Algorithms for Annotated Edge Dominating Set in Graphs with Degree Bounded by 3. IEICE Trans. Inf. Syst. Mingyu Xiao, Hiroshi Nagamochi
2013	B	`conf`	Exact Algorithms for Maximum Independent Set. ISAAC Mingyu Xiao, Hiroshi Nagamochi
2013	J	`jnl`	Exact Algorithms for Maximum Independent Set. CoRR Mingyu Xiao, Hiroshi Nagamochi
2013	J	`jnl`	FPTASs for trimming weighted trees. Theor. Comput. Sci. Mingyu Xiao, Takuro Fukunaga, Hiroshi Nagamochi
2013	J	`jnl`	New parameterized algorithms for the edge dominating set problem. Theor. Comput. Sci. Mingyu Xiao, Ton Kloks, Sheung-Hung Poon
2013	J	`jnl`	Parameterized edge dominating set in graphs with degree bounded by 3. Theor. Comput. Sci. Mingyu Xiao, Hiroshi Nagamochi
2012	B	`conf`	A Quadratic Vertex Kernel for Feedback Arc Set in Bipartite Tournaments. MFCS Mingyu Xiao, Jiong Guo
2012	C	`conf`	A Refined Exact Algorithm for Edge Dominating Set. TAMC Mingyu Xiao, Hiroshi Nagamochi
2012	J	`jnl`	An Exact Algorithm for TSP in Degree-3 Graphs via Circuit Procedure and Amortization on Connectivity Structure CoRR Mingyu Xiao, Hiroshi Nagamochi
2012	J	`jnl`	An FPT algorithm for edge subset feedback edge set. Inf. Process. Lett. Mingyu Xiao, Hiroshi Nagamochi
2012	Misc	`conf`	An Improved Exact Algorithm for TSP in Degree-4 Graphs. COCOON Mingyu Xiao, Hiroshi Nagamochi
2012	B	`conf`	New Results on Polynomial Inapproximability and Fixed Parameter Approximability of edge dominating set. IPEC Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos, Mingyu Xiao
2011	C	`conf`	Further Improvement on Maximum Independent Set in Degree-4 Graphs. COCOA Mingyu Xiao, Hiroshi Nagamochi
2011	B	`conf`	New Parameterized Algorithms for the Edge Dominating Set Problem. MFCS Mingyu Xiao, Ton Kloks, Sheung-Hung Poon
2011	J	`jnl`	New parameterized algorithms for edge dominating set CoRR Mingyu Xiao, Ton Kloks, Sheung-Hung Poon
2011	—	`conf`	Parameterized Edge Dominating Set in Cubic Graphs - (Extended Abstract). FAW-AAIM Mingyu Xiao, Hiroshi Nagamochi
2011	J	`jnl`	Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum Algorithmica Mingyu Xiao, Leizhen Cai, Andrew Chi-Chih Yao
2010	Misc	`conf`	A Note on Vertex Cover in Graphs with Maximum Degree 3. COCOON Mingyu Xiao
2010	B	`conf`	A Simple and Fast Algorithm for Maximum Independent Set in 3-Degree Graphs. WALCOM Mingyu Xiao
2010	—	`conf`	Exact and Parameterized Algorithms for Edge Dominating Set in 3-Degree Graphs. COCOA (2) Mingyu Xiao
2010	Misc	`conf`	FPTAS's for Some Cut Problems in Weighted Trees. FAW Mingyu Xiao, Takuro Fukunaga, Hiroshi Nagamochi
2010	J	`jnl`	Finding minimum 3-way cuts in hypergraphs. Inf. Process. Lett. Mingyu Xiao
2010	J	`jnl`	Simple and Improved Parameterized Algorithms for Multiterminal Cuts. Theory Comput. Syst. Mingyu Xiao
2009	J	`jnl`	New Branching Rules: Improvements on Independent Set and Vertex Cover in Sparse Graphs CoRR Mingyu Xiao
2008	Misc	`conf`	Algorithms for Multiterminal Cuts. CSR Mingyu Xiao
2008	—	`—`	Algorithms for graph multiway partition problems. Mingyu Xiao
2008	B	`conf`	An Improved Divide-and-Conquer Algorithm for Finding All Minimum k-Way Cuts. ISAAC Mingyu Xiao
2008	C	`conf`	Finding Minimum 3-Way Cuts in Hypergraphs. TAMC Mingyu Xiao
2008	J	`jnl`	Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem CoRR Mingyu Xiao, Leizhen Cai, Andrew C. Yao