Improved Parameterized Algorithms for Weighted 3-Set Packing. - Jianxin Wang 001; Qilong Feng (COCOON, 2008)

An O*(3.523k) Parameterized Algorithm for 3-Set Packing. - Jianxin Wang 001; Qilong Feng (TAMC, 2008)

An Improved Parameterized Algorithm for a Generalized Matching Problem. - Jianxin Wang 001; Dan Ning; Qilong Feng; Jianer Chen (TAMC, 2008)

An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set. - Jianxin Wang 001; Beiwei Chen; Qilong Feng; Jianer Chen (FAW, 2009)

Improved Deterministic Algorithms for Weighted Matching and Packing Problems. - Qilong Feng; Yang Liu 002; Songjian Lu; Jianxin Wang 001 (TAMC, 2009)

An improved kernelization for P2-packing. - Jianxin Wang 001; Dan Ning; Qilong Feng; Jianer Chen (Inf. Process. Lett., 2010)

The Min-Power Multicast Problems in Wireless Ad Hoc Networks: A Parameterized View. - Weizhong Luo; Jianxin Wang 001; Qilong Feng; Jiong Guo (FAW-AAIM, 2011)

Matching and P 2-Packing: Weighted Versions. - Qilong Feng; Jianxin Wang 001; Jianer Chen (COCOON, 2011)

An Improved Kernel for Planar Connected Dominating Set. - Weizhong Luo; Jianxin Wang 001; Qilong Feng; Jiong Guo; Jianer Chen (TAMC, 2011)

Color-Coding and its Applications: A Survey. - Jianxin Wang 001; Qilong Feng; Jianer Chen (Int. J. Softw. Informatics, 2011)

Improved deterministic algorithms for weighted matching and packing problems. - Jianer Chen; Qilong Feng; Yang Liu 002; Songjian Lu; Jianxin Wang 001 (Theor. Comput. Sci., 2011)

An O*(3.533k)-time parameterized algorithm for the 3-set packing problem. - Jianxin Wang 001; Qilong Feng; Jianer Chen (Theor. Comput. Sci., 2011)

Improved FPT Algorithms for Rectilinear k-Links Spanning Path. - Jianxin Wang 001; Jinyi Yao; Qilong Feng; Jianer Chen (TAMC, 2012)

FPT Results for Signed Domination. - Ying Zheng; Jianxin Wang 001; Qilong Feng; Jianer Chen (TAMC, 2012)

Kernelization and Lower Bounds of the Signed Domination Problem. - Ying Zheng; Jianxin Wang 001; Qilong Feng (FAW-AAIM, 2013)

Parameterized Complexity of Control and Bribery for d-Approval Elections. - Jianxin Wang 001; Min Yang; Jiong Guo; Qilong Feng; Jianer Chen (COCOA, 2013)

Random Methods for Parameterized Problems. - Qilong Feng; Jianxin Wang 001; Shaohua Li 006; Jianer Chen (COCOON, 2013)

Parameterized Algorithms for Maximum Agreement Forest on Multiple Trees. - Feng Shi 003; Jianer Chen; Qilong Feng; Jianxin Wang 001 (COCOON, 2013)

Improved linear problem kernel for planar connected dominating set. - Weizhong Luo; Jianxin Wang 001; Qilong Feng; Jiong Guo; Jianer Chen (Theor. Comput. Sci., 2013)

Parameterized complexity of Min-power multicast problems in wireless ad hoc networks. - Jianxin Wang 001; Weizhong Luo; Qilong Feng; Jiong Guo (Theor. Comput. Sci., 2013)

Approximation Algorithms for Maximum Agreement Forest on Multiple Trees. - Feng Shi 003; Jianer Chen; Qilong Feng; Jianxin Wang 001 (COCOON, 2014)

Randomized Parameterized Algorithms for Co-path Set Problem. - Qilong Feng; Qian Zhou; Shaohua Li (FAW, 2014)

Improved Approximation Algorithm for Maximum Agreement Forest of Two Trees. - Feng Shi 003; Jie You; Qilong Feng (FAW, 2014)

On Star-Cover and Path-Cover of a Tree. - Jie You; Qilong Feng; Jiong Guo; Feng Shi 003 (FAW, 2014)

Algorithms for Maximum Agreement Forest of Multiple General Trees. - Feng Shi 003; Jianer Chen; Qilong Feng; Xiaojun Ding; Jianxin Wang 001 (CoRR, 2014)

On Unknown Small Subsets and Implicit Measures: New Techniques for Parameterized Algorithms. - Jianer Chen; Qilong Feng (J. Comput. Sci. Technol., 2014)

On the Minimum Link-Length Rectilinear Spanning Path Problem: Complexity and Algorithms. - Jianxin Wang 001; Peiqiang Tan; Jinyi Yao; Qilong Feng; Jianer Chen (IEEE Trans. Computers, 2014)

Matching and Weighted P2-Packing: Algorithms and Kernels. - Qilong Feng; Jianxin Wang 001; Jianer Chen (Theor. Comput. Sci., 2014)

Improved parameterized algorithms for minimum link-length rectilinear spanning path problem. - Qilong Feng; Jianxin Wang 001; Chao Xu 010; Jinyi Yao; Jianer Chen (Theor. Comput. Sci., 2014)

Algorithms for parameterized maximum agreement forest problem on multiple trees. - Feng Shi 003; Jianxin Wang 001; Jianer Chen; Qilong Feng; Jiong Guo (Theor. Comput. Sci., 2014)

Parameterized Minimum Cost Partition of a Tree with Supply and Demand. - Mugang Lin; Wenjun Li 001; Qilong Feng (FAW, 2015)

Randomized parameterized algorithms for P2-Packing and Co-Path Packing problems. - Qilong Feng; Jianxin Wang 001; Shaohua Li 006; Jianer Chen (J. Comb. Optim., 2015)

Parameterized complexity of control and bribery for d-approval elections. - Jianxin Wang 001; Weimin Su; Min Yang; Jiong Guo; Qilong Feng; Feng Shi 003; Jianer Chen (Theor. Comput. Sci., 2015)

Kernelization and parameterized algorithms for covering a tree by a set of stars or paths. - Jie You; Jianxin Wang 001; Qilong Feng; Feng Shi 003 (Theor. Comput. Sci., 2015)

Improved Algorithms for Several Parameterized Problems Based on Random Methods. - Qilong Feng; Xiong Jiang; Jianxin Wang 001 (FAW, 2016)

Parameterized Algorithms for Maximum Edge Biclique and Related Problems. - Qilong Feng; Zeyang Zhou; Jianxin Wang 001 (FAW, 2016)

A fixed-parameter algorithm for the maximum agreement forest problem on multifurcating trees. - Feng Shi 003; Jianxin Wang 001; Yufei Yang; Qilong Feng; Weilong Li; Jianer Chen (Sci. China Inf. Sci., 2016)

Parameterized Algorithms for the Maximum Agreement Forest Problem on Multiple Rooted Multifurcating Trees. - Feng Shi 003; Jianer Chen; Qilong Feng; Jianxin Wang 001 (CoRR, 2016)

Kernelization and randomized Parameterized algorithms for Co-path Set problem. - Qilong Feng; Qian Zhou; Jianxin Wang 001 (J. Comb. Optim., 2016)

Improved approximation algorithm for maximum agreement forest of two rooted binary phylogenetic trees. - Feng Shi 003; Qilong Feng; Jie You; Jianxin Wang 001 (J. Comb. Optim., 2016)

Planar Vertex-Disjoint Cycle Packing: New Structures and Improved Kernel. - Qilong Feng; Xiaolu Liao; Jianxin Wang 001 (COCOA (2), 2017)

A New Kernel for Parameterized Max-Bisection Above Tight Lower Bound. - Qilong Feng; Senmin Zhu; Jianxin Wang 001 (COCOON, 2017)

Nonuniform Neighborhood Sampling Based Simulated Annealing for the Directed Feedback Vertex Set Problem. - Zhipeng Tang; Qilong Feng; Ping Zhong 002 (IEEE Access, 2017)

最大圈分解问题的研究进展 (Survey of Cycle Packing Problem). - Weidong Luo; Jianxin Wang 001; Qilong Feng (计算机科学, 2017)

Improved kernel results for some FPT problems based on simple observations. - Wenjun Li 001; Qilong Feng; Jianer Chen; Shuai Hu (Theor. Comput. Sci., 2017)

Partition on trees with supply and demand: Kernelization and algorithms. - Mugang Lin; Qilong Feng; Jianer Chen; Wenjun Li 001 (Theor. Comput. Sci., 2017)

Constant Factor Approximation Algorithm for l-Pseudoforest Deletion Problem. - Mugang Lin; Bin Fu; Qilong Feng (COCOON, 2018)

Improved Kernels for Several Problems on Planar Graphs. - Qilong Feng; Beilin Zhuo; Guanlan Tan; Neng Huang; Jianxin Wang 001 (FAW, 2018)

Parameterized Algorithms for Minimum Tree Cut/Paste Distance and Minimum Common Integer Partition. - Jie You; Jianxin Wang 001; Qilong Feng (FAW, 2018)

New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds Decomposition. - Qilong Feng; Guanlan Tan; Senmin Zhu; Bin Fu; Jianxin Wang 001 (ISAAC, 2018)

Encounter Prediction-based Data Forwarding for High Reliability in Bus Networks. - Lianhai Liu; Jianxin Wang 001; Jiawei Huang 001; Qilong Feng (Ad Hoc Sens. Wirel. Networks, 2018)

Leveraging content similarity among VMI files to allocate virtual machines in cloud. - Huixi Li; Wenjun Li 001; Qilong Feng; Shigeng Zhang; Haodong Wang; Jianxin Wang 001 (Future Gener. Comput. Syst., 2018)

An improved FPT algorithm for Almost Forest Deletion problem. - Mugang Lin; Qilong Feng; Jianxin Wang 001; Jianer Chen; Bin Fu; Wenjun Li 001 (Inf. Process. Lett., 2018)

A parameterized algorithm for the Maximum Agreement Forest problem on multiple rooted multifurcating trees. - Feng Shi 003; Jianer Chen; Qilong Feng; Jianxin Wang 001 (J. Comput. Syst. Sci., 2018)

Algorithms for Pedigree Comparison. - Zhi-Zhong Chen; Qilong Feng; Chao Shen; Jianxin Wang 001; Lusheng Wang 001 (IEEE ACM Trans. Comput. Biol. Bioinform., 2018)

Dealing with several parameterized problems by random methods. - Qilong Feng; Neng Huang; Xiong Jiang; Jianxin Wang 001 (Theor. Comput. Sci., 2018)

Parameterized algorithms for Edge Biclique and related problems. - Qilong Feng; Shaohua Li 005; Zeyang Zhou; Jianxin Wang 001 (Theor. Comput. Sci., 2018)

Exponential Time Approximation Scheme for TSP. - Zhixiang Chen 001; Qilong Feng; Bin Fu; Mugang Lin; Jianxin Wang 001 (AAIM, 2019)

A 2.57-Approximation Algorithm for Contig-Based Genomic Scaffold Filling. - Qilong Feng; Xiangzhong Meng; Guanlan Tan; Jianxin Wang 001 (AAIM, 2019)

A Classification of Care Apparel Characteristics for Disabled User Requirement. - Qilong Feng (AHFE (3), 2019)

An Improved Approximation Algorithm for the k-Means Problem with Penalties. - Qilong Feng; Zhen Zhang 025; Feng Shi 003; Jianxin Wang 001 (FAW, 2019)

Improved Algorithms for Clustering with Outliers. - Qilong Feng; Zhen Zhang 025; Ziyun Huang; Jinhui Xu 001; Jianxin Wang 001 (ISAAC, 2019)

Randomized Parameterized Algorithms for the Kidney Exchange Problem. - Mugang Lin; Jianxin Wang 001; Qilong Feng; Bin Fu (Algorithms, 2019)

Improved PTAS for the constrained k-means problem. - Qilong Feng; Jiaxin Hu; Neng Huang; Jianxin Wang 001 (J. Comb. Optim., 2019)

A Unified Framework of FPT Approximation Algorithms for Clustering Problems. - Qilong Feng; Zhen Zhang 025; Ziyun Huang; Jinhui Xu 001; Jianxin Wang 001 (ISAAC, 2020)

The Complexity of Tree Partitioning. - Zhao An; Qilong Feng; Iyad Kanj; Ge Xia (Algorithmica, 2020)

An improved kernel for Max-Bisection above tight lower bound. - Qilong Feng; Senmin Zhu; Jianxin Wang 001 (Theor. Comput. Sci., 2020)

An approximation algorithm for the l-pseudoforest deletion problem. - Mugang Lin; Qilong Feng; Bin Fu; Jianxin Wang 001 (Theor. Comput. Sci., 2020)

New kernels for several problems on planar graphs. - Guanlan Tan; Qilong Feng; Beilin Zhuo; Neng Huang; Jianxin Wang 001 (Theor. Comput. Sci., 2020)

Fixed-parameter tractability for minimum tree cut/paste distance and minimum common integer partition. - Jie You; Feng Shi 003; Jianxin Wang 001; Qilong Feng (Theor. Comput. Sci., 2020)

An Improved Approximation Algorithm for Squared Metric k-Facility Location. - Zhen Zhang 025; Qilong Feng (COCOA, 2021)

Improved Parameterized Approximation for Balanced k-Median. - Zhen Zhang 025; Qilong Feng (COCOA, 2021)

Crowdturfing Detection in Online Review System: A Graph-Based Modeling. - Qilong Feng; Yue Zhang; Li Kuang (CollaborateCom (2), 2021)

PTAS for Minimum Cost Multi-covering with Disks. - Ziyun Huang; Qilong Feng; Jianxin Wang 001; Jinhui Xu 001 (SODA, 2021)

An approximation algorithm for k-median with priorities. - Zhen Zhang 025; Qilong Feng; Jinhui Xu 001; Jianxin Wang 001 (Sci. China Inf. Sci., 2021)

An improved FPT algorithm for the flip distance problem. - Qilong Feng; Shaohua Li 005; Xiangzhong Meng; Jianxin Wang 001 (Inf. Comput., 2021)

A local search algorithm for k-means with outliers. - Zhen Zhang 025; Qilong Feng; Junyu Huang; Yutian Guo; Jinhui Xu 001; Jianxin Wang 001 (Neurocomputing, 2021)

A new approximation algorithm for contig-based genomic scaffold filling. - Guanlan Tan; Qilong Feng; Xiangzhong Meng; Jianxin Wang 001 (Theor. Comput. Sci., 2021)

FLS: A New Local Search Algorithm for K-means with Smaller Search Space. - Junyu Huang; Qilong Feng; Ziyun Huang; Jinhui Xu 001; Jianxin Wang 001 (IJCAI, 2022)

Small Candidate Set for Translational Pattern Search. - Ziyun Huang; Qilong Feng; Jianxin Wang 001; Jinhui Xu 001 (Algorithmica, 2022)

New Approximation Algorithms for Fair k-median Problem. - Di Wu 002; Qilong Feng; Jianxin Wang 001 (CoRR, 2022)

Preface. - Angsheng Li; Jianer Chen; Qilong Feng; Jinhui Xu 001 (Math. Struct. Comput. Sci., 2022)

The Fair k-Center with Outliers Problem: FPT and Polynomial Approximations. - Xiaoliang Wu; Qilong Feng; Jinhui Xu 001; Jianxin Wang 001 (IJTCS-FAW, 2023)

Fast Algorithms for Distributed k-Clustering with Outliers. - Junyu Huang; Qilong Feng; Ziyun Huang; Jinhui Xu 001; Jianxin Wang 001 (ICML, 2023)

Linear Time Algorithms for k-means with Multi-Swap Local Search. - Junyu Huang; Qilong Feng; Ziyun Huang; Jinhui Xu 001; Jianxin Wang 001 (NeurIPS, 2023)

On parameterized approximation algorithms for balanced clustering. - Xiangyan Kong; Zhen Zhang 025; Qilong Feng (J. Comb. Optim., 2023)

Improved approximation algorithms for solving the squared metric k-facility location problem. - Zhen Zhang 025; Qilong Feng; Junyu Huang; Jianxin Wang 001 (Theor. Comput. Sci., 2023)

Improved kernels for triangle packing in tournaments. - Hanchun Yuan; Qilong Feng; Jian-xin Wang 001 (Sci. China Inf. Sci., 2023)

Towards a Theoretical Understanding of Why Local Search Works for Clustering with Fair-Center Representation. - Zhen Zhang 025; Junfeng Yang; Limei Liu; Xuesong Xu; Guozhen Rong; Qilong Feng (AAAI, 2024)

SEC: More Accurate Clustering Algorithm via Structural Entropy. - Junyu Huang; Qilong Feng; Jiahui Wang; Ziyun Huang; Jinhui Xu 001; Jianxin Wang 001 (AAAI, 2024)

Speeding Up Constrained k-Means Through 2-Means. - Qilong Feng; Bin Fu (AAIM (2), 2024)

New Algorithms for Distributed Fair k-Center Clustering: Almost Accurate as Sequential Algorithms. - Xiaoliang Wu; Qilong Feng; Ziyun Huang; Jinhui Xu 001; Jianxin Wang 001 (AAMAS, 2024)

Improved Approximation Algorithm for Individual Fairness k-Median. - Di Wu 002; Qilong Feng; Jinhui Xu 001; Jian-Xin Wang 001 (COCOA (1), 2024)

Clustering with a Knapsack Constraint: Parameterized Approximation Algorithms for the Knapsack Median Problem. - Zhen Zhang 025; Limei Liu; Yao Liu; Jie Chen; Qilong Feng (IJTCS-FAW, 2024)

Near-Linear Time Approximation Algorithms for k-means with Outliers. - Junyu Huang; Qilong Feng; Ziyun Huang; Jinhui Xu 001; Jianxin Wang 001 (ICML, 2024)

Faster Approximation Schemes for (Constrained) k-Means with Outliers. - Zhen Zhang 025; Junyu Huang; Qilong Feng (MFCS, 2024)

Parameterized Approximation Schemes for Fair-Range Clustering. - Zhen Zhang 025; Xiaohong Chen; Limei Liu; Jie Chen; Junyu Huang; Qilong Feng (NeurIPS, 2024)

Linear Time Approximation Algorithm for Column Subset Selection with Local Search. - Yuanbin Zou; Ziyun Huang; Jinhui Xu 001; Jianxin Wang 001; Qilong Feng (NeurIPS, 2024)

Improved Approximation Algorithm for the Distributed Lower-Bounded k-Center Problem. - Ting Liang; Qilong Feng; Xiaoliang Wu; Jinhui Xu 001; Jianxin Wang 001 (TAMC, 2024)

TopoLa: a novel embedding framework for understanding complex networks. - Kai Zheng 020; Qilong Feng; Yaohang Li; Qichang Zhao; Jinhui Xu 001; Jianxin Wang 001 (CoRR, 2024)

PTAS for Minimum Cost MultiCovering with Disks. - Ziyun Huang; Qilong Feng; Jianxin Wang 001; Jinhui Xu 001 (SIAM J. Comput., 2024)

New algorithms for fair k-center problem with outliers and capacity constraints. - Xiaoliang Wu; Qilong Feng; Jinhui Xu 001; Jian-xin Wang 001 (Theor. Comput. Sci., 2024)

Machine learning techniques for CT imaging diagnosis of novel coronavirus pneumonia: a review. - Jingjing Chen 002; Yixiao Li; Lingling Guo; Xiaokang Zhou; Yihan Zhu; Qingfeng He; Haijun Han; Qilong Feng (Neural Comput. Appl., 2024)

Approximation algorithms for fair k-median problem without fairness violation. - Di Wu 002; Qilong Feng; Jianxin Wang 001 (Theor. Comput. Sci., 2024)

Fully-Scalable Massively Parallel Algorithm for k-center with Outliers. - Di Wu 002; Qilong Feng; Junyu Huang; Jinhui Xu 001; Ziyun Huang; Jianxin Wang 001 (AAAI, 2025)

Coresets for k-Median of Lines with Group Fairness Constraints. - Ting Liang; Xiaoliang Wu; Junyu Huang; Qilong Feng (COCOON (2), 2025)

Exact Algorithms for the Maximum k-Balanced Weighted Biclique Problem. - Jingyi Liu; Jianxin Wang 001; Qilong Feng; Feng Shi 003 (IJTCS-FAW, 2025)

New Algorithms for the Learning-Augmented k-means Problem. - Junyu Huang; Qilong Feng; Ziyun Huang; Zhen Zhang 025; Jinhui Xu 001; Jianxin Wang 001 (ICLR, 2025)

Federated Cross-Domain Recommendation Framework With Graph Neural Network. - Deling Huang; Qilong Feng (Expert Syst. J. Knowl. Eng., 2025)

Towards a theoretical understanding of why local search works for clustering with fair-center representation. - Zhen Zhang; Junfeng Yang; Limei Liu; Xuesong Xu; Guozhen Rong; Qilong Feng (Inf. Comput., 2025)

The distributed algorithms for the lower-bounded k-center clustering in metric space. - Ting Liang; Xiaoliang Wu; Jinhui Xu 001; Qilong Feng (Theor. Comput. Sci., 2025)

Approximation algorithms for facility location and k-median with differential privacy. - Lu Wang; Qilong Feng; Jianxin Wang (Theor. Comput. Sci., 2025)

Clustering under a knapsack constraint: Parameterized approximation for the knapsack median problem. - Zhen Zhang 025; Zhuohang Gao; Limei Liu; Yao Liu; Jie Chen; Qilong Feng (Theor. Comput. Sci., 2025)

Long-Context Inference with Retrieval-Augmented Speculative Decoding. - Guanzheng Chen; Qilong Feng; Jinjie Ni; Xin Li 056; Michael Qizhe Shieh (CoRR, 2025)