default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMingyu Xiao 0001
肖鸣宇
Person information
- unicode name: 肖鸣宇
- affiliation: University of Electronic Science and Technology of China, Chengdu, China
- affiliation (PhD 2008): Chinese University of Hong Kong, Hong Kong
Other persons with the same name
- Mingyu Xiao 0002 — Wuhan University, School of Geodesy and Geomatics, China
- Mingyu Xiao 0003 — Beijing University of Posts and Telecommunications, China (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j57]Junqiang Peng, Mingyu Xiao
:
Fast exact algorithms for the SAT problem with bounded occurrences of variables. Theor. Comput. Sci. 1029: 115037 (2025)- [j56]Jingyang Zhao, Mingyu Xiao:
Approximation algorithms for cycle and path partitions in complete graphs. Theor. Comput. Sci. 1029: 115049 (2025) - 2024
- [j55]Mingyu Xiao, Sen Huang, Xiaoyu Chen:
Maximum Weighted Independent Set: Effective Reductions and Fast Algorithms on Sparse Graphs. Algorithmica 86(5): 1293-1334 (2024) - [j54]Ziliang Xiong, Yi Zhou, Mingyu Xiao, Bakhadyr Khoussainov:
Finding small feedback arc sets on large graphs. Comput. Oper. Res. 169: 106724 (2024) - [j53]Yuhang Guo, Dong Hao, Mingyu Xiao, Bin Li:
Networked Combinatorial Auction for Crowdsourcing and Crowdsensing. IEEE Internet Things J. 11(4): 5951-5966 (2024) - [j52]Tian Bai, Mingyu Xiao:
Exact algorithms for restricted subset feedback vertex set in chordal and split graphs. Theor. Comput. Sci. 984: 114326 (2024) - [j51]Zimo Sheng, Mingyu Xiao:
Kernelization for edge triangle packing and covering via a discharging method. Theor. Comput. Sci. 1004: 114635 (2024) - [j50]Jingyang Zhao, Mingyu Xiao:
A deterministic approximation algorithm for metric triangle packing. Theor. Comput. Sci. 1010: 114699 (2024) - [c82]Lu Liu, Mingyu Xiao, Yi Zhou:
A Fast Exact Solver with Theoretical Analysis for the Maximum Edge-Weighted Clique Problem. AAAI 2024: 20768-20776 - [c81]Chunyu Luo, Yi Zhou, Zhengren Wang, Mingyu Xiao:
A Faster Branching Algorithm for the Maximum k-Defective Clique Problem. ECAI 2024: 4132-4139 - [c80]Mingyu Xiao:
Solving Directed Multiway Cut Faster Than 2ⁿ. ESA 2024: 104:1-104:13 - [c79]Junqiang Peng, Mingyu Xiao:
A Fast Algorithm for MaxSAT above Half Number of Clauses. IJCAI 2024: 1935-1943 - [c78]Jingyang Zhao, Mingyu Xiao, Shunwang Wang:
Improved Approximation Algorithms for Capacitated Location Routing. IJCAI 2024: 6805-6813 - [c77]Jingyang Zhao, Mingyu Xiao:
A Better Approximation for Bipartite Traveling Tournament in Inter-League Sports Scheduling. IJCAI 2024: 6814-6822 - [c76]Ziliang Xiong, Mingyu Xiao:
Exactly Solving Minimum Dominating Set and Its Generalization. IJCAI 2024: 7056-7064 - [c75]Jingyang Zhao, Mingyu Xiao:
Approximation Algorithms for Cumulative Vehicle Routing with Stochastic Demands. ISAAC 2024: 59:1-59:18 - [c74]Yuxi Liu, Mingyu Xiao:
Solving Co-Path/Cycle Packing and Co-Path Packing Faster Than 3^k. IPEC 2024: 11:1-11:17 - [c73]Tian Bai, Mingyu Xiao:
Breaking the Barrier 2^k for Subset Feedback Vertex Set in Chordal Graphs. MFCS 2024: 15:1-15:18 - [c72]Jingyang Zhao, Mingyu Xiao:
An Improved Approximation Algorithm for Metric Triangle Packing. TAMC 2024: 50-62 - [c71]Yuxi Liu, Mingyu Xiao:
An Improved Kernel and Parameterized Algorithm for Almost Induced Matching. TAMC 2024: 86-98 - [c70]Jingyang Zhao, Mingyu Xiao:
Improved Approximation Algorithms for Cycle and Path Packings. WALCOM 2024: 179-193 - [e2]Zhiping Cai, Mingyu Xiao, Jialin Zhang:
Theoretical Computer Science - 41st National Conference, NCTCS 2023, Guangzhou, China, July 21-23, 2023, Revised Selected Papers. Communications in Computer and Information Science 1944, Springer 2024, ISBN 978-981-99-7742-0 [contents] - [i48]Jingyang Zhao, Mingyu Xiao:
An Improved Approximation Algorithm for Metric Triangle Packing. CoRR abs/2402.08216 (2024) - [i47]Mengfan Ma, Mingyu Xiao, Tian Bai, Xin Cheng:
Facility Assignment with Fair Cost Sharing: Equilibrium and Mechanism Design. CoRR abs/2404.08963 (2024) - [i46]Jingyang Zhao, Mingyu Xiao, Chao Xu:
The Traveling Tournament Problem: Improved Algorithms Based on Cycle Packing. CoRR abs/2404.10955 (2024) - [i45]Zihui Liang, Bakh Khoussainov, Mingyu Xiao:
Deciding regular games: a playground for exponential time algorithms. CoRR abs/2405.07188 (2024) - [i44]Yuxi Liu, Mingyu Xiao:
Solving Co-Path/Cycle Packing Faster than 3k. CoRR abs/2406.10829 (2024) - [i43]Chunyu Luo, Yi Zhou, Zhengren Wang, Mingyu Xiao:
A Faster Branching Algorithm for the Maximum k-Defective Clique Problem. CoRR abs/2407.16588 (2024) - [i42]Ziliang Xiong, Mingyu Xiao:
A Simplified Parameterized Algorithm for Directed Feedback Vertex Set. CoRR abs/2410.15411 (2024) - [i41]Andrea Burgess, Danny Dyer, Kerry Ojakian, Lusheng Wang, Mingyu Xiao, Boting Yang:
Deduction, Constrained Zero Forcing, and Constrained Searching. CoRR abs/2410.22962 (2024) - 2023
- [j49]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) - [j48]Yuhao Liu, Mingyu Xiao:
The (3,3)-colorability of planar graphs without 4-cycles and 5-cycles. Discret. Math. 346(4): 113306 (2023) - [j47]Junqiang Peng, Mingyu Xiao:
Further improvements for SAT in terms of formula length. Inf. Comput. 294: 105085 (2023) - [j46]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) - [j45]Mingyu Xiao:
Upper and lower bounds on approximating weighted mixed domination. Theor. Comput. Sci. 939: 292-302 (2023) - [j44]Mingyu Xiao, Shaowei Kou:
A 5k-vertex kernel for 3-path vertex cover. Theor. Comput. Sci. 959: 113872 (2023) - [j43]Tian Bai, Mingyu Xiao:
A parameterized algorithm for subset feedback vertex set in tournaments. Theor. Comput. Sci. 975: 114139 (2023) - [j42]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) - [c69]Mengfan Ma, Mingyu Xiao, Tian Bai, Bakh Khoussainov:
Facility Location Games with Entrance Fees. AAAI 2023: 5797-5804 - [c68]Jingyang Zhao, Mingyu Xiao:
The Linear Distance Traveling Tournament Problem Allows an EPTAS. AAAI 2023: 12155-12162 - [c67]Mingyu Xiao, Guoliang Qiu, Sen Huang:
MMS Allocations of Chores with Connectivity Constraints: New Methods and New Results. AAMAS 2023: 2886-2888 - [c66]Zimo Sheng, Mingyu Xiao:
A Discharging Method: Improved Kernels for Edge Triangle Packing and Covering. COCOON (2) 2023: 171-183 - [c65]Kangyi Tian, Mingyu Xiao, Boting Yang:
Parameterized Algorithms for Cluster Vertex Deletion on Degree-4 Graphs and General Graphs. COCOON (1) 2023: 182-194 - [c64]Jingyang Zhao, Mingyu Xiao:
Improved Approximation Algorithms for Multidepot Capacitated Vehicle Routing. COCOON (2) 2023: 378-391 - [c63]Yuan Fang, Mengxiao Zhang, Jiamou Liu, Bakh Khoussainov, Mingyu Xiao:
Multi-Unit Auction over a Social Network. ECAI 2023: 676-683 - [c62]Mingyu Xiao, Guixin Lin, Bakh Khoussainov, Yuchao Song:
Characterizations of Network Auctions and Generalizations of VCG. ECAI 2023: 2736-2743 - [c61]Zihui Liang, Bakh Khoussainov, Toru Takisaka, Mingyu Xiao:
Connectivity in the Presence of an Opponent. ESA 2023: 79:1-79:14 - [c60]Junqiang Peng, Mingyu Xiao:
Fast Algorithms for SAT with Bounded Occurrences of Variables. IJCAI 2023: 2004-2012 - [c59]Zhengren Wang, Yi Zhou, Chunyu Luo, Mingyu Xiao:
A Fast Maximum k-Plex Algorithm Parameterized by the Degeneracy Gap. IJCAI 2023: 5648-5656 - [i40]Yuan Fang, Mengxiao Zhang, Jiamou Liu, Bakh Khoussainov, Mingyu Xiao:
Multi-unit Auction over a Social Network. CoRR abs/2302.08924 (2023) - [i39]Mingyu Xiao, Guixin Lin, Bakh Khoussainov, Yuchao Song:
Characterizations of Network Auctions and Generalizations of VCG. CoRR abs/2302.09237 (2023) - [i38]Mingyu Xiao, Guoliang Qiu, Sen Huang:
MMS Allocations of Chores with Connectivity Constraints: New Methods and New Results. CoRR abs/2302.13224 (2023) - [i37]Zihui Liang, Bakh Khoussainov, Toru Takisaka, Mingyu Xiao:
Connectivity in the presence of an opponent. CoRR abs/2304.08783 (2023) - [i36]Zhengren Wang, Yi Zhou, Chunyu Luo, Mingyu Xiao:
A Fast Maximum k-Plex Algorithm Parameterized by the Degeneracy Gap. CoRR abs/2306.13258 (2023) - [i35]Yuxi Liu, Mingyu Xiao:
An Improved Kernel and Parameterized Algorithm for Almost Induced Matching. CoRR abs/2308.14116 (2023) - [i34]Jingyang Zhao, Mingyu Xiao:
The APX-hardness of the Traveling Tournament Problem. CoRR abs/2308.14124 (2023) - [i33]Jingyang Zhao, Mingyu Xiao:
Improved Approximation Algorithms for Multidepot Capacitated Vehicle Routing. CoRR abs/2308.14131 (2023) - [i32]Zimo Sheng, Mingyu Xiao:
A Discharging Method: Improved Kernels for Edge Triangle Packing and Covering. CoRR abs/2308.16515 (2023) - [i31]Jingyang Zhao, Mingyu Xiao:
A 5-approximation Algorithm for the Traveling Tournament Problem. CoRR abs/2309.01902 (2023) - [i30]Zihui Liang, Bakh Khoussainov, Mingyu Xiao:
Two new algorithms for solving Müller games and their applications. CoRR abs/2311.04655 (2023) - [i29]Jingyang Zhao, Mingyu Xiao:
Improved Approximation Algorithms for Cycle and Path Packings. CoRR abs/2311.11332 (2023) - 2022
- [b2]Ton Kloks, Mingyu Xiao:
A Guide to Graph Algorithms. Springer 2022, ISBN 978-981-16-6349-9, pp. 1-340 - [j41]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) - [j40]Mingyu Xiao, Shaowei Kou:
A simple and improved parameterized algorithm for bicluster editing. Inf. Process. Lett. 174: 106193 (2022) - [j39]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) - [j38]Zimo Sheng, Mingyu Xiao:
An improved kernel for planar vertex-disjoint triangle packing. Theor. Comput. Sci. 922: 122-130 (2022) - [c58]Mingyu Xiao, Yuchao Song, Bakh Khoussainov:
Multi-Unit Auction in Social Networks with Budgets. AAAI 2022: 5228-5235 - [c57]Mingyu Xiao:
An Exact MaxSAT Algorithm: Further Observations and Further Improvements. IJCAI 2022: 1887-1893 - [c56]Binglin Tao, Mingyu Xiao, Bakhadyr Khoussainov, Junqiang Peng:
Optimal Shielding to Guarantee Region-Based Connectivity under Geographical Failures. INFOCOM 2022: 1109-1118 - [c55]Jingyang Zhao, Mingyu Xiao, Chao Xu:
Improved Approximation Algorithms for the Traveling Tournament Problem. MFCS 2022: 83:1-83:15 - [c54]Tian Bai, Mingyu Xiao:
Exact and Parameterized Algorithms for Restricted Subset Feedback Vertex Set in Chordal Graphs. TAMC 2022: 249-261 - [c53]Zhengren Wang, Yi Zhou, Mingyu Xiao, Bakhadyr Khoussainov:
Listing Maximal k-Plexes in Large Real-World Graphs. WWW 2022: 1517-1527 - [i28]Zhengren Wang, Yi Zhou, Mingyu Xiao, Bakhadyr Khoussainov:
Listing Maximal k-Plexes in Large Real-World Graphs. CoRR abs/2202.08737 (2022) - [i27]Mengfan Ma, Mingyu Xiao, Tian Bai, Bakh Khoussainov:
Facility Location with Entrance Fees. CoRR abs/2204.11282 (2022) - [i26]Jingyang Zhao, Mingyu Xiao:
Improved Approximation Algorithms for Capacitated Vehicle Routing with Fixed Capacity. CoRR abs/2210.16534 (2022) - [i25]Tian Bai, Mingyu Xiao:
Breaking the Barrier 2k for Subset Feedback Vertex Set in Chordal Graphs. CoRR abs/2212.04726 (2022) - [i24]Jingyang Zhao, Mingyu Xiao:
Practical Algorithms with Guaranteed Approximation Ratio for TTP with Maximum Tour Length Two. CoRR abs/2212.12240 (2022) - 2021
- [j37]Xiaoyu Chen, Yi Zhou, Jin-Kao Hao, Mingyu Xiao:
Computing maximum k-defective cliques in massive graphs. Comput. Oper. Res. 127: 105131 (2021) - [j36]Huairui Chu, Mingyu Xiao, Zhe Zhang:
An improved upper bound for SAT. Theor. Comput. Sci. 887: 51-62 (2021) - [c52]Huairui Chu, Mingyu Xiao, Zhe Zhang:
An Improved Upper Bound for SAT. AAAI 2021: 3707-3714 - [c51]Zhenyu Guo, Mingyu Xiao, Yi Zhou, Dongxiang Zhang, Kian-Lee Tan:
Enhancing Balanced Graph Edge Partition with Effective Local Search. AAAI 2021: 12336-12343 - [c50]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 - [c49]Jingyang Zhao, Mingyu Xiao:
A Further Improvement on Approximating TTP-2. COCOON 2021: 137-149 - [c48]Sen Huang, Mingyu Xiao, Xiaoyu Chen:
Exact Algorithms for Maximum Weighted Independent Set on Sparse Graphs (Extended Abstract). COCOON 2021: 617-628 - [c47]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 - [c46]Junqiang Peng, Mingyu Xiao:
A Fast Algorithm for SAT in Terms of Formula Length. SAT 2021: 436-452 - [c45]Mingyu Xiao, Sen Huang, Yi Zhou, Bolin Ding:
Efficient Reductions and a Fast Algorithm of Maximum Weighted Independent Set. WWW 2021: 3930-3940 - [i23]Junqiang Peng, Mingyu Xiao:
A Fast Algorithm for SAT in Terms of Formula Length. CoRR abs/2105.06131 (2021) - [i22]Sen Huang, Mingyu Xiao, Xiaoyu Chen:
Exact algorithms for maximum weighted independent set on sparse graphs. CoRR abs/2108.12840 (2021) - [i21]Jingyang Zhao, Mingyu Xiao:
A Further Improvement on Approximating TTP-2. CoRR abs/2108.13060 (2021) - 2020
- [j35]Sen Huang, Mingyu Xiao:
Object reachability via swaps under strict and weak preferences. Auton. Agents Multi Agent Syst. 34(2): 51 (2020) - [j34]Mingyu Xiao, Hiroshi Nagamochi:
Characterizing Star-PCGs. Algorithmica 82(10): 3066-3090 (2020) - [j33]Mingyu Xiao, Hiroshi Nagamochi:
Some reduction operations to pairwise compatibility graphs. Inf. Process. Lett. 153 (2020) - [j32]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) - [j31]Mingyu Xiao, Zimo Sheng:
Improved parameterized algorithms and kernels for mixed domination. Theor. Comput. Sci. 815: 109-120 (2020) - [j30]Mingyu Xiao, Shaowei Kou:
Parameterized algorithms and kernels for almost induced matching. Theor. Comput. Sci. 846: 103-113 (2020) - [j29]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) - [c44]Binglin Tao, Mingyu Xiao, Jingyang Zhao:
Finding Minimum-Weight Link-Disjoint Paths with a Few Common Nodes. AAAI 2020: 938-945 - [c43]Mingyu Xiao, Jiaxing Ling:
Algorithms for Manipulating Sequential Allocation. AAAI 2020: 2302-2309 - [c42]Yi Zhou, Jingwei Xu, Zhenyu Guo, Mingyu Xiao, Yan Jin:
Enumerating Maximal k-Plexes with Worst-Case Time Guarantee. AAAI 2020: 2442-2449 - [c41]Zhenyu Guo, Mingyu Xiao, Yi Zhou:
The Complexity of the Partition Coloring Problem. TAMC 2020: 390-401 - [i20]Huairui Chu, Mingyu Xiao, Zhe Zhang:
An Improved Upper Bound for SAT. CoRR abs/2007.03829 (2020) - [i19]Zhenyu Guo, Mingyu Xiao, Yi Zhou:
The Complexity of the Partition Coloring Problem. CoRR abs/2007.14225 (2020) - [i18]Zhenyu Guo, Mingyu Xiao, Yi Zhou, Dongxiang Zhang, Kian-Lee Tan:
Enhancing Balanced Graph Edge Partition with Effective Local Search. CoRR abs/2012.09451 (2020) - [i17]Mingyu Xiao, Hiroshi Nagamochi:
Bounded-Degree Cut is Fixed-Parameter Tractable. CoRR abs/2012.14174 (2020)
2010 – 2019
- 2019
- [j28]Weibo Lin, Mingyu Xiao, Yi Zhou, Zhenyu Guo:
Computing lower bounds for minimum sum coloring and optimum cost chromatic partition. Comput. Oper. Res. 109: 263-272 (2019) - [j27]Weibo Lin, Mingyu Xiao:
A (3 + ϵ)k-vertex kernel for edge-disjoint triangle packing. Inf. Process. Lett. 142: 20-26 (2019) - [j26]Mingyu Xiao, Frances A. Rosamond:
Frontiers in Algorithmics. Theor. Comput. Sci. 786: 1 (2019) - [c40]Sen Huang, Mingyu Xiao:
Object Reachability via Swaps along a Line. AAAI 2019: 2037-2044 - [c39]Mingyu Xiao, Zimo Sheng:
Improved Parameterized Algorithms for Mixed Domination. AAIM 2019: 304-315 - [c38]Mingyu Xiao:
Upper and Lower Bounds on Approximating Weighted Mixed Domination. COCOON 2019: 554-566 - [c37]Mingyu Xiao, Jianan Zhang, Weibo Lin:
Parameterized Algorithms for the Traveling Purchaser Problem with Additional Constraints. COCOON 2019: 567-579 - [c36]Weibo Lin, Zhu He, Mingyu Xiao:
Balanced Clustering: A Uniform Model and Fast Algorithm. IJCAI 2019: 2987-2993 - [i16]Mingyu Xiao:
Upper and Lower Bounds on Approximating Weighted Mixed Domination. CoRR abs/1906.10801 (2019) - [i15]Mingyu Xiao, Jiaxing Ling:
Algorithms for Manipulating Sequential Allocation. CoRR abs/1909.06747 (2019) - [i14]Sen Huang, Mingyu Xiao:
Object Reachability via Swaps under Strict and Weak Preferences. CoRR abs/1909.07557 (2019) - 2018
- [j25]Jianan Zhang, Mingyu Xiao:
带权混合支配问题的近似算法研究 (Approximation Algorithm for Weighted Mixed Domination Problem). 计算机科学 45(4): 83-88 (2018) - [c35]Mingyu Xiao, Yuqing Wang, Binglin Tao:
A Geometric Least Squares Method for Peer Assessment. AAMAS 2018: 2124-2126 - [c34]Mingyu Xiao, Hiroshi Nagamochi:
Characterizing Star-PCGs. COCOON 2018: 504-515 - [c33]Mingyu Xiao, Hiroshi Nagamochi:
Brief Announcement: Bounded-Degree Cut is Fixed-Parameter Tractable. ICALP 2018: 112:1-112:6 - [c32]Mingyu Xiao, Xuanbei Wang:
Exact Algorithms and Complexity of Kidney Exchange. IJCAI 2018: 555-561 - [i13]Mingyu Xiao, Hiroshi Nagamochi:
Some Reduction Operations to Pairwise Compatibility Graphs. CoRR abs/1804.02887 (2018) - [i12]Mingyu Xiao, Hiroshi Nagamochi:
Characterizing Star-PCGs. CoRR abs/1804.02895 (2018) - 2017
- [j24]Mingyu Xiao, Hiroshi Nagamochi:
Exact algorithms for maximum independent set. Inf. Comput. 255: 126-146 (2017) - [j23]Mingyu Xiao, Huan Tan:
Exact algorithms for Maximum Induced Matching. Inf. Comput. 256: 196-211 (2017) - [j22]Mingyu Xiao, Hiroshi Nagamochi:
A refined algorithm for maximum independent set in degree-4 graphs. J. Comb. Optim. 34(3): 830-873 (2017) - [j21]Mingyu Xiao:
On a generalization of Nemhauser and Trotter's local optimization theorem. J. Comput. Syst. Sci. 84: 97-106 (2017) - [j20]Mingyu Xiao:
Linear kernels for separating a graph into components of bounded size. J. Comput. Syst. Sci. 88: 260-270 (2017) - [j19]Mingyu Xiao, Shaowei Kou:
Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems. Theor. Comput. Sci. 657: 86-97 (2017) - [j18]Mingyu Xiao, Hiroshi Nagamochi:
Complexity and kernels for bipartition into degree-bounded induced graphs. Theor. Comput. Sci. 659: 72-82 (2017) - [c31]Mingyu Xiao, Weibo Lin, Yuanshun Dai, Yifeng Zeng:
A Fast Algorithm to Compute Maximum k-Plexes in Social Network Analysis. AAAI 2017: 919-925 - [c30]Mingyu Xiao, Yuqing Wang:
Score Aggregation via Spectral Method. IJCAI 2017: 451-457 - [c29]Mingyu Xiao, Shaowei Kou:
Kernelization and Parameterized Algorithms for 3-Path Vertex Cover. TAMC 2017: 654-668 - [e1]Mingyu Xiao, Frances A. Rosamond:
Frontiers in Algorithmics - 11th International Workshop, FAW 2017, Chengdu, China, June 23-25, 2017, Proceedings. Lecture Notes in Computer Science 10336, Springer 2017, ISBN 978-3-319-59604-4 [contents] - 2016
- [j17]Mingyu Xiao, Hiroshi Nagamochi:
An Exact Algorithm for TSP in Degree-3 Graphs Via Circuit Procedure and Amortization on Connectivity Structure. Algorithmica 74(2): 713-741 (2016) - [j16]Mingyu Xiao, Hiroshi Nagamochi:
An exact algorithm for maximum independent set in degree-5 graphs. Discret. Appl. Math. 199: 137-155 (2016) - [j15]Mingyu Xiao, Hiroshi Nagamochi:
An Improved Exact Algorithm for TSP in Graphs of Maximum Degree 4. Theory Comput. Syst. 58(2): 241-272 (2016) - [c28]Mingyu Xiao:
A Parameterized Algorithm for Bounded-Degree Vertex Deletion. COCOON 2016: 79-91 - [c27]Mingyu Xiao, Hiroshi Nagamochi:
A Linear-Time Algorithm for Integral Multiterminal Flows in Trees. ISAAC 2016: 62:1-62:12 - [c26]Mingyu Xiao, Shaowei Kou:
An Improved Approximation Algorithm for the Traveling Tournament Problem with Maximum Trip Length Two. MFCS 2016: 89:1-89:14 - [c25]Mingyu Xiao, Shaowei Kou:
Almost Induced Matching: Linear Kernels and Parameterized Algorithms. WG 2016: 220-232 - [i11]Mingyu Xiao:
A Parameterized algorithm for Bounded-Degree Vertex Deletion. CoRR abs/1601.00163 (2016) - [i10]Mingyu Xiao:
On a generalization of Nemhauser and Trotter's local optimization theorem. CoRR abs/1601.00164 (2016) - [i9]Mingyu Xiao:
Linear Kernels for Separating a Graph into Components of Bounded Size. CoRR abs/1608.05816 (2016) - [i8]Mingyu Xiao, Shaowei Kou:
Kernelization and Parameterized Algorithms for 3-Path Vertex Cover. CoRR abs/1608.07022 (2016) - [i7]Mingyu Xiao, Hiroshi Nagamochi:
A Linear-time Algorithm for Integral Multiterminal Flows in Trees. CoRR abs/1611.08803 (2016) - 2015
- [j14]Mingyu Xiao, Jiong Guo:
A Quadratic Vertex Kernel for Feedback Arc Set in Bipartite Tournaments. Algorithmica 71(1): 87-97 (2015) - [j13]Mingyu Xiao, Hiroshi Nagamochi:
Exact algorithms for dominating induced matching based on graph partition. Discret. Appl. Math. 190-191: 147-162 (2015) - [j12]Mingyu Xiao, Hiroshi Nagamochi:
An improved exact algorithm for undirected feedback vertex set. J. Comb. Optim. 30(2): 214-241 (2015) - [j11]Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos, Mingyu Xiao:
New Results on Polynomial Inapproximabilityand Fixed Parameter Approximability of Edge Dominating Set. Theory Comput. Syst. 56(2): 330-346 (2015) - [c24]Mingyu Xiao, Shaowei Kou:
Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in Graphs. FAW 2015: 282-293 - [c23]Mingyu Xiao:
On a Generalization of Nemhauser and Trotter's Local Optimization Theorem. ISAAC 2015: 442-452 - [c22]Mingyu Xiao, Huan Tan:
An Improved Exact Algorithm for Maximum Induced Matching. TAMC 2015: 272-283 - 2014
- [j10]Mingyu Xiao, Hiroshi Nagamochi:
A refined exact algorithm for Edge Dominating Set. Theor. Comput. Sci. 560: 207-216 (2014) - [c21]Haitao Jiang, Bing Su, Mingyu Xiao, Yinfeng Xu, Farong Zhong, Binhai Zhu:
On the Exact Block Cover Problem. AAIM 2014: 13-22 - [c20]Mingyu Xiao:
A New Linear Kernel for Undirected Planar Feedback Vertex Set: Smaller and Simpler. AAIM 2014: 288-298 - [c19]Mingyu Xiao, Hiroshi Nagamochi:
Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs. ISAAC 2014: 429-440 - [i6]Mingyu Xiao, Hiroshi Nagamochi:
Exact Algorithms for Dominating Induced Matching Based on Graph Partition. CoRR abs/1408.6196 (2014) - 2013
- [j9]Mingyu Xiao, Hiroshi Nagamochi:
Exact Algorithms for Annotated Edge Dominating Set in Graphs with Degree Bounded by 3. IEICE Trans. Inf. Syst. 96-D(3): 408-418 (2013) - [j8]Mingyu Xiao, Hiroshi Nagamochi:
Confining sets and avoiding bottleneck cases: A simple maximum independent set algorithm in degree-3 graphs. Theor. Comput. Sci. 469: 92-104 (2013) - [j7]Mingyu Xiao, Takuro Fukunaga, Hiroshi Nagamochi:
FPTASs for trimming weighted trees. Theor. Comput. Sci. 469: 105-118 (2013) - [j6]Mingyu Xiao, Hiroshi Nagamochi:
Parameterized edge dominating set in graphs with degree bounded by 3. Theor. Comput. Sci. 508: 2-15 (2013) - [j5]Mingyu Xiao, Ton Kloks, Sheung-Hung Poon:
New parameterized algorithms for the edge dominating set problem. Theor. Comput. Sci. 511: 147-158 (2013) - [c18]Mingyu Xiao, Hiroshi Nagamochi:
An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs. FAW-AAIM 2013: 72-83 - [c17]Mingyu Xiao, Hiroshi Nagamochi:
An Improved Exact Algorithm for Undirected Feedback Vertex Set. COCOA 2013: 153-164 - [c16]Mingyu Xiao, Hiroshi Nagamochi:
Exact Algorithms for Maximum Independent Set. ISAAC 2013: 328-338 - [c15]Mingyu Xiao, Hiroshi Nagamochi:
An Exact Algorithm for TSP in Degree-3 Graphs via Circuit Procedure and Amortization on Connectivity Structure. TAMC 2013: 96-107 - [i5]Mingyu Xiao, Hiroshi Nagamochi:
Exact Algorithms for Maximum Independent Set. CoRR abs/1312.6260 (2013) - 2012
- [j4]Mingyu Xiao, Hiroshi Nagamochi:
An FPT algorithm for edge subset feedback edge set. Inf. Process. Lett. 112(1-2): 5-9 (2012) - [c14]Mingyu Xiao, Hiroshi Nagamochi:
An Improved Exact Algorithm for TSP in Degree-4 Graphs. COCOON 2012: 74-85 - [c13]Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos, Mingyu Xiao:
New Results on Polynomial Inapproximability and Fixed Parameter Approximability of edge dominating set. IPEC 2012: 25-36 - [c12]Mingyu Xiao, Jiong Guo:
A Quadratic Vertex Kernel for Feedback Arc Set in Bipartite Tournaments. MFCS 2012: 825-835 - [c11]Mingyu Xiao, Hiroshi Nagamochi:
A Refined Exact Algorithm for Edge Dominating Set. TAMC 2012: 360-372 - [i4]Mingyu Xiao, Hiroshi Nagamochi:
An Exact Algorithm for TSP in Degree-3 Graphs via Circuit Procedure and Amortization on Connectivity Structure. CoRR abs/1212.6831 (2012) - 2011
- [j3]Mingyu Xiao, Leizhen Cai, Andrew Chi-Chih Yao:
Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem. Algorithmica 59(4): 510-520 (2011) - [c10]Mingyu Xiao, Hiroshi Nagamochi:
Parameterized Edge Dominating Set in Cubic Graphs - (Extended Abstract). FAW-AAIM 2011: 100-112 - [c9]Mingyu Xiao, Hiroshi Nagamochi:
Further Improvement on Maximum Independent Set in Degree-4 Graphs. COCOA 2011: 163-178 - [c8]Mingyu Xiao, Ton Kloks, Sheung-Hung Poon:
New Parameterized Algorithms for the Edge Dominating Set Problem. MFCS 2011: 604-615 - [i3]Mingyu Xiao, Ton Kloks, Sheung-Hung Poon:
New parameterized algorithms for edge dominating set. CoRR abs/1104.4160 (2011) - 2010
- [j2]Mingyu Xiao:
Finding minimum 3-way cuts in hypergraphs. Inf. Process. Lett. 110(14-15): 554-558 (2010) - [j1]Mingyu Xiao:
Simple and Improved Parameterized Algorithms for Multiterminal Cuts. Theory Comput. Syst. 46(4): 723-736 (2010) - [c7]Mingyu Xiao:
Exact and Parameterized Algorithms for Edge Dominating Set in 3-Degree Graphs. COCOA (2) 2010: 387-400 - [c6]Mingyu Xiao:
A Note on Vertex Cover in Graphs with Maximum Degree 3. COCOON 2010: 150-159 - [c5]Mingyu Xiao, Takuro Fukunaga, Hiroshi Nagamochi:
FPTAS's for Some Cut Problems in Weighted Trees. FAW 2010: 210-221 - [c4]Mingyu Xiao:
A Simple and Fast Algorithm for Maximum Independent Set in 3-Degree Graphs. WALCOM 2010: 281-292
2000 – 2009
- 2009
- [i2]Mingyu Xiao:
New Branching Rules: Improvements on Independent Set and Vertex Cover in Sparse Graphs. CoRR abs/0904.2712 (2009) - 2008
- [b1]Mingyu Xiao:
Algorithms for graph multiway partition problems. Chinese University of Hong Kong, Hong Kong, 2008 - [c3]Mingyu Xiao:
Algorithms for Multiterminal Cuts. CSR 2008: 314-325 - [c2]Mingyu Xiao:
An Improved Divide-and-Conquer Algorithm for Finding All Minimum k-Way Cuts. ISAAC 2008: 208-219 - [c1]Mingyu Xiao:
Finding Minimum 3-Way Cuts in Hypergraphs. TAMC 2008: 270-281 - [i1]Mingyu Xiao, Leizhen Cai, Andrew C. Yao:
Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem. CoRR abs/0811.3723 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-07 23:52 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
