冯启龙｜中南大学｜学者主页

2026

极小–极大(k,z)-聚类问题的参数化近似

张震，袁依格，武迪，田志平，冯启龙

《中国科学:信息科学》

2026

Parameterized Approximation Schemes for Fair Clustering in Doubling Metrics

Xiaoliang Wu, Ting Liang, Zhize Li, Qilong Feng

International Joint Conference on Artificial Intelligence

DOI

2026

Efficient coreset construction algorithm for fair k-median of lines

Ting Liang, Xiaoliang Wu, Junyu Huang, Qilong Feng

Theoretical Computer Science

DOI

2026

Better guarantees for individual fairness k-median

Di Wu, Qilong Feng, Jianxin Wang

Theoretical Computer Science

DOI

2026

Linear Time Algorithms for Individually Fair k-means via Multi-Swap Local Search

Beirong Cui, Qilong Feng, Junyu Huang

Proceedings of the AAAI Conference on Artificial Intelligence

DOI

2026

A More Efficient Reduction from Outlier-Aware to Outlier-Free k-Median

Zhen Zhang, Han Peng, Limei Liu, Junyu Huang, Xiaolong Li, Qilong Feng

Proceedings of the AAAI Conference on Artificial Intelligence

DOI

2026

Learning-augmented approximation algorithms for group fair k-center clustering

Xiaoliang Wu, Ting Liang, Junyu Huang, Qilong Feng

Frontiers of Computer Science

DOI

2026

Parameterized approximation schemes for fair-range clustering

Zhen Zhang, Xiaohong Chen, Limei Liu, Jie Chen, Junyu Huang, Qilong FENG

Information and Computation

DOI

2025

“人工智能+X”拔尖创新人才培养模式在“图灵班”的探索与实践

冯启龙，石峰，黄俊予，夏佳志

《工业和信息化教育》

2025

Parameterized Approximation Algorithm for Doubly Constrained Fair Clustering

Xiaoliang Wu, Qilong Feng, Junyu Huang, Jianxin Wang

International Joint Conference on Artificial Intelligence

DOI

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

Information and Computation

DOI

2025

Coresets for k-Median of Lines with Group Fairness Constraints

Ting Liang, Xiaoliang Wu, Junyu Huang, Qilong Feng

Lecture notes in computer science

DOI

2025

Clustering under a knapsack constraint: Parameterized approximation for the knapsack median problem

Zhen Zhang, Zhuohang Gao, Limei Liu, Yao Liu, Jie Chen, Qilong Feng

Theoretical Computer Science

DOI

2025

Approximation algorithms for facility location and k-median with differential privacy

Lu Wang, Qilong Feng, Jianxin Wang

Theoretical Computer Science

DOI

2025

Fully-Scalable Massively Parallel Algorithm for k-center with Outliers

Di Wu, Qilong Feng, Junyu Huang, Jinhui Xu, Ziyun Huang, Jianxin Wang

Proceedings of the AAAI Conference on Artificial Intelligence

DOI

2025

Improved Approximation Algorithm for Individual Fairness k-Median

Di Wu, Qilong Feng, Jinhui Xu, Jianxin Wang

Lecture notes in computer science

DOI

2025

Exact Algorithms for the Maximum k-Balanced Weighted Biclique Problem

Jingyi Liu, Jianxin Wang, Qilong Feng, Feng Shi

Lecture notes in computer science

DOI

2025

Fast Local Search Algorithms for Clustering with Adaptive Sampling and Bandit Strategies

Junyu Huang, Zhen Zhang, Beirong Cui, Jianxin Wang, Qilong Feng

neural information processing systems

DOI

2025

A Single-Swap Local Search Algorithm for k-Means of Lines

Ting Liang, Xiaoliang Wu, Junyu Huang, Jianxin Wang, Qilong Feng

neural information processing systems

DOI

2024

最小负载受限k-中位问题的近似方案

张震，冯启龙，徐雪松，刘利枚，杨俊丰，石峰

《计算机学报》

2024

多样性公平k-中位问题的(1+ε)-近似算法

Zhen Zhang, Xiao-Hong Chen, L. Liu, Jian Ren, Lin Jiang, Qilong Feng

Scientia Sinica Informationis

DOI

2024

优先k-设施选址问题的近似算法

Zhen Zhang, Qilong Feng, Xuesong Xu, Han Peng, L. Liu, Feng Shi

Scientia Sinica Informationis

DOI

2024

Clustering with a Knapsack Constraint: Parameterized Approximation Algorithms for the Knapsack Median Problem

Zhen Zhang, Limei Liu, Yao Liu, Jie Chen, Qilong Feng

Lecture notes in computer science

DOI

2024

The distributed algorithms for the lower-bounded k-center clustering in metric space

Ting Liang, Xiaoliang Wu, Jinhui Xu, Qilong Feng

Theoretical Computer Science

DOI

2024

PTAS for Minimum Cost MultiCovering with Disks

Ziyun Huang, Qilong Feng, Jianxin Wang, Jinhui Xu

SIAM Journal on Computing

DOI

2024

New Algorithms for Distributed Fair k-Center Clustering: Almost Accurate as Sequential Algorithms

Xiaoliang Wu, Qilong Feng, Ziyun Huang, Jinhui Xu, Jianxin Wang

Adaptive Agents and Multi-Agents Systems

DOI

2024

New algorithms for fair k-center problem with outliers and capacity constraints

Xiaoliang Wu, Qilong Feng, Jinhui Xu, Jianxin Wang

Theoretical Computer Science

DOI

2024

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

Proceedings of the AAAI Conference on Artificial Intelligence

DOI

2024

On the Budgeted Priority p-Median Problem in High-Dimensional Euclidean Spaces

Zhen Zhang, Zi-Yun Huang, Zhi-Ping Tian, Li-Mei Liu, Xuesong Xu, Qilong Feng

Journal of the Operations Research Society of China

DOI

2024

Improved Approximation Algorithm for the Distributed Lower-Bounded k-Center Problem

Ting Liang, Qilong Feng, Xiaoliang Wu, Jinhui Xu, Jianxin Wang

Lecture notes in computer science

DOI

2024

Speeding Up Constrained k-Means Through 2-Means

Qilong Feng, Bin Fu

Lecture notes in computer science

DOI

2023

优先级k-中心问题的FPT近似算法

冯启龙，龙睿，吴小良，仲文明

《中南大学学报(自然科学版)》

2023

Approximation algorithms for fair k-median problem without fairness violation

Di Wu, Qilong Feng, Jianxin Wang

Theoretical Computer Science

DOI

2023

Improved kernels for triangle packing in tournaments

Hanchun Yuan, Qilong Feng, Jianxin Wang

Science China Information Sciences

DOI

2023

On parameterized approximation algorithms for balanced clustering

Xiangyan Kong, Zhen Zhang, Qilong Feng

Journal of Combinatorial Optimization

DOI

2023

The Fair k-Center with Outliers Problem: FPT and Polynomial Approximations

Xiaoliang Wu, Qilong Feng, Jinhui Xu, Jianxin Wang

Lecture notes in computer science

DOI

2022

Improved approximation algorithms for solving the squared metric k-facility location problem

Zhen Zhang, Qilong Feng, Junyu Huang, Jianxin Wang

Theoretical Computer Science

DOI

2022

Small Candidate Set for Translational Pattern Search

Ziyun Huang, Qilong Feng, Jianxin Wang, Jinhui Xu

Algorithmica

DOI

2022

FLS: A New Local Search Algorithm for K-means with Smaller Search Space

Junyu Huang, Qilong Feng, Ziyun Huang, Jinhui Xu, Jianxin Wang

International Joint Conference on Artificial Intelligence

DOI

2021

A local search algorithm for k-means with outliers

Zhen Zhang, Qilong Feng, Junyu Huang, Yutian Guo, Jinhui Xu, Jianxin Wang

Neurocomputing

DOI

2021

An approximation algorithm for k-median with priorities

Zhen Zhang, Qilong Feng, Jinhui Xu, Jianxin Wang

Science China Information Sciences

DOI

2021

An improved FPT algorithm for the flip distance problem

Qilong Feng, Shaohua Li, Xiangzhong Meng, Jianxin Wang

Information and Computation

DOI

2021

PTAS for Minimum Cost Multi-covering with Disks

Ziyun Huang, Qilong Feng, Jianxin Wang, Jinhui Xu

Society for Industrial and Applied Mathematics eBooks

DOI

2021

An Improved Approximation Algorithm for Squared Metric k-Facility Location

Zhen Zhang, Qilong Feng

Lecture notes in computer science

DOI

2021

Improved Parameterized Approximation for Balanced k-Median

Zhen Zhang, Qilong Feng

Lecture notes in computer science

DOI

2020

The Complexity of Tree Partitioning

Zhao An, Qilong Feng, Iyad A. Kanj, Ge Xia

Algorithmica

DOI

2020

A Unified Framework of FPT Approximation Algorithms for Clustering Problems

Qilong Feng, Zhang, Zhen, Ziyun Huang, Jinhui Xu, Jianxin Wang

DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

DOI

2019

An approximation algorithm for the l-pseudoforest deletion problem

Mugang Lin, Qilong Feng, Bin Fu, Jianxin Wang

Theoretical Computer Science

DOI

2019

Fixed-parameter tractability for minimum tree cut/paste distance and minimum common integer partition

Jie You, Feng Shi, Jianxin Wang, Qilong Feng

Theoretical Computer Science

DOI

2019

Randomized Parameterized Algorithms for the Kidney Exchange Problem

Mugang Lin, Jianxin Wang, Qilong Feng, Bin Fu

Algorithms

DOI

2019

An Improved Approximation Algorithm for the k-Means Problem with Penalties

Qilong Feng, Zhen Zhang, Feng Shi, Jianxin Wang

Lecture notes in computer science

DOI

2019

Exponential Time Approximation Scheme for TSP

Zhixiang Chen, Qilong Feng, Bin Fu, Mugang Lin, Jianxin Wang

Lecture notes in computer science

DOI

2019

Improved Algorithms for Clustering with Outliers

Feng Qilong, Zhen Zhang, Ziyun Huang, Jinhui Xu, Jianxin Wang

DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

DOI

2018

2-Club簇图顶点删除问题改进参数算法

谭冠兰，孙龙志，冯启龙，郑莹，谭培强

《中南大学学报(自然科学版)》

2018

Improved PTAS for the constrained k-means problem

Qilong Feng, Jiaxin Hu, Neng Huang, Jianxin Wang

Journal of Combinatorial Optimization

DOI

2018

An improved kernel for Max-Bisection above tight lower bound

Qilong Feng, Senmin Zhu, Jianxin Wang

Theoretical Computer Science

DOI

2018

A parameterized algorithm for the Maximum Agreement Forest problem on multiple rooted multifurcating trees

Feng Shi, Jianer Chen, Qilong Feng, Jianxin Wang

Journal of Computer and System Sciences

DOI

2018

An improved FPT algorithm for Almost Forest Deletion problem

Mugang Lin, Qilong Feng, Jianxin Wang, Jianer Chen, Bin Fu, Wenjun Li

Information Processing Letters

DOI

2018

Constant Factor Approximation Algorithm for l-Pseudoforest Deletion Problem

Mugang Lin, Bin Fu, Qilong Feng

Lecture notes in computer science

DOI

2018

Parameterized Algorithms for Minimum Tree Cut/Paste Distance and Minimum Common Integer Partition

Jie You, Jianxin Wang, Qilong Feng

Lecture notes in computer science

DOI

2018

Improved Kernels for Several Problems on Planar Graphs

Qilong Feng, Beilin Zhuo, Guanlan Tan, Neng Huang, Jianxin Wang

Lecture notes in computer science

DOI

2017

Dealing with several parameterized problems by random methods

Qilong Feng, Neng Huang, Xiong Jiang, Jianxin Wang

Theoretical Computer Science

DOI

2017

The Complexity of Tree Partitioning

Zhao An, Qilong Feng, Iyad A. Kanj, Ge Xia

Lecture notes in computer science

DOI

2017

A New Kernel for Parameterized Max-Bisection Above Tight Lower Bound

Qilong Feng, Senmin Zhu, Jianxin Wang

Lecture notes in computer science

DOI

2017

Planar Vertex-Disjoint Cycle Packing: New Structures and Improved Kernel

Qilong Feng, Xiaolu Liao, Jianxin Wang

Lecture notes in computer science

DOI

2016

Partition on trees with supply and demand: Kernelization and algorithms

Mugang Lin, Qilong Feng, Jianer Chen, Wenjun Li

Theoretical Computer Science

DOI

2016

Improved kernel results for some FPT problems based on simple observations

Wenjun Li, Qilong Feng, Jianer Chen, Shuai Hu

Theoretical Computer Science

DOI

2016

Parameterized Algorithms for Maximum Edge Biclique and Related Problems

Qilong Feng, Zeyang Zhou, Jianxin Wang

Lecture notes in computer science

DOI

2016

Improved Algorithms for Several Parameterized Problems Based on Random Methods

Qilong Feng, Xiong Jiang, Jianxin Wang

Lecture notes in computer science

DOI

2015

A fixed-parameter algorithm for the maximum agreement forest problem on multifurcating trees

Feng Shi, Jianxin Wang, Yufei Yang, Qilong Feng, Weilong Li, Jianer Chen

Science China Information Sciences

DOI

2015

Kernelization and parameterized algorithms for covering a tree by a set of stars or paths

Jie You, Jianxin Wang, Qilong Feng, Feng Shi

Theoretical Computer Science

DOI

2015

Parameterized complexity of control and bribery for d-approval elections

Jianxin Wang, Weimin Su, Min Yang, Jiong Guo, Qilong Feng, Feng Shi, Jianer Chen

Theoretical Computer Science

DOI

2015

Improved approximation algorithm for maximum agreement forest of two rooted binary phylogenetic trees

Feng Shi, Qilong Feng, Jie You, Jianxin Wang

Journal of Combinatorial Optimization

DOI

2015

Kernelization and randomized Parameterized algorithms for Co-path Set problem

Qilong Feng, Qian Zhou, Jianxin Wang

Journal of Combinatorial Optimization

DOI

2015

Parameterized Minimum Cost Partition of a Tree with Supply and Demand

Mugang Lin, Wenjun Li, Qilong Feng

Lecture notes in computer science

DOI

2014

On Unknown Small Subsets and Implicit Measures: New Techniques for Parameterized Algorithms

Jianer Chen, Qilong Feng

Journal of Computer Science and Technology

DOI

2014

Kernelization in parameterized computation: A survey

Qilong Feng, Qian Zhou, Wenjun Li, Jianxin Wang

Tsinghua Science & Technology

DOI

2014

Improved parameterized algorithms for minimum link-length rectilinear spanning path problem

Qilong Feng, Jianxin Wang, Chao Xu, Jinyi Yao, Jianer Chen

Theoretical Computer Science

DOI

2014

Algorithms for parameterized maximum agreement forest problem on multiple trees

Feng Shi, Jianxin Wang, Jianer Chen, Qilong Feng, Jiong Guo

Theoretical Computer Science

DOI

2014

Randomized Parameterized Algorithms for Co-path Set Problem

Qilong Feng, Qian Zhou, Shaohua Li

Lecture notes in computer science

DOI

2014

Approximation Algorithms for Maximum Agreement Forest on Multiple Trees

Feng Shi, Jianer Chen, Qilong Feng, Jianxin Wang

Lecture notes in computer science

DOI

2014

Improved Approximation Algorithm for Maximum Agreement Forest of Two Trees

Feng Shi, Jie You, Qilong Feng

Lecture notes in computer science

DOI

2014

On Star-Cover and Path-Cover of a Tree

Jie You, Qilong Feng, Jiong Guo, Feng Shi

Lecture notes in computer science

DOI

2013

完全p-支配集的参数算法

骆伟忠，冯启龙，王建新，陈建二

《计算机学报》

2013

Matching and Weighted P2 -Packing: Algorithms and Kernels

Qilong Feng, Jianxin Wang, Jianer Chen

Theoretical Computer Science

DOI

2013

Randomized parameterized algorithms for $$P_2$$ P 2 -Packing and Co-Path Packing problems

Qilong Feng, Jianxin Wang, Shaohua Li, Jianer Chen

Journal of Combinatorial Optimization

DOI

2013

On the Minimum Link-Length Rectilinear Spanning Path Problem: Complexity and Algorithms

Jianxin Wang, Peiqiang Tan, Jinyi Yao, Qilong Feng, Jianer Chen

IEEE Transactions on Computers

DOI

2013

Improved linear problem kernel for planar connected dominating set

Weizhong Luo, Jianxin Wang, Qilong Feng, Jiong Guo, Jianer Chen

Theoretical Computer Science

DOI

2013

Kernelization and Lower Bounds of the Signed Domination Problem

Ying Zheng, Jianxin Wang, Qilong Feng

Lecture notes in computer science

DOI

2013

Random Methods for Parameterized Problems

Qilong Feng, Jianxin Wang, Shaohua Li, Jianer Chen

Lecture notes in computer science

DOI

2013

Parameterized Algorithms for Maximum Agreement Forest on Multiple Trees

Feng Shi, Jianer Chen, Qilong Feng, Jianxin Wang

Lecture notes in computer science

DOI

2013

Parameterized Complexity of Control and Bribery for d-Approval Elections

Jianxin Wang, Min Yang, Jiong Guo, Qilong Feng, Jianer Chen

Lecture notes in computer science

DOI

2012

加权3-Set Packing问题的核心化

李绍华，冯启龙，王建新，陈建二

《计算机研究与发展》

2012

Parameterized complexity of Min-power multicast problems in wireless ad hoc networks

Jianxin Wang, Weizhong Luo, Qilong Feng, Jiong Guo

Theoretical Computer Science

DOI

2012

FPT Results for Signed Domination

Ying Zheng, Jianxin Wang, Qilong Feng, Jianer Chen

Lecture notes in computer science

DOI

2012

Improved FPT Algorithms for Rectilinear k-Links Spanning Path

Jianxin Wang, Jinyi Yao, Qilong Feng, Jianer Chen

Lecture notes in computer science

DOI

2011

An Improved Kernel for Planar Connected Dominating Set

Weizhong Luo, Jianxin Wang, Qilong Feng, Jiong Guo, Jianer Chen

Lecture notes in computer science

DOI

2011

Matching and P 2-Packing: Weighted Versions

Qilong Feng, Jianxin Wang, Jianer Chen

Lecture notes in computer science

DOI

2011

The Min-Power Multicast Problems in Wireless Ad Hoc Networks: A Parameterized View

Weizhong Luo, Jianxin Wang, Qilong Feng, Jiong Guo

Lecture notes in computer science

DOI

2010

Packing和Matching问题的参数化算法研究

冯启龙

《中南大学》

2010

An O∗(3.533k) -time parameterized algorithm for the 3-set packing problem

Jianxin Wang, Qilong Feng, Jianer Chen

Theoretical Computer Science

DOI

2010

Improved Algorithms for Weighted 3-Set Packing

Qilong Feng, Jianxin Wang, Jianer Chen

Journal of Software

DOI

2009

Set Cover和Hitting Set问题的研究进展

李绍华，王建新，冯启龙，陈建二

《计算机科学》

2009

加权3D-Matching的改进算法

冯启龙，王建新，陈建二

《计算机研究与发展》

2009

Improved Deterministic Algorithms for Weighted Matching and Packing Problems

Qilong Feng, Yang Liu, Songjian Lu, Jianxin Wang

Lecture notes in computer science

DOI

2009

An improved kernelization for -packing

Jianxin Wang, Dan Ning, Qilong Feng, Jianer Chen

Information Processing Letters

DOI

2009

Improved Parameterized Algorithm for P2-Packing Problem

Jianxin Wang, Dan Ning, Qilong Feng, Jianer Chen

Journal of Software

DOI

2009

An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set

Jianxin Wang, Beiwei Chen, Qilong Feng, Jianer Chen

Lecture notes in computer science

DOI

2008

P2-Packing问题参数算法的改进

王建新，宁丹，冯启龙，陈建二

《软件学报》

2008

一种基于链暗示技术的Min-CVCB问题的精确算法

王建新，许小双，冯启龙，李敏

《计算机研究与发展》

2008

Improved Parameterized Algorithms for Weighted 3-Set Packing

Jianxin Wang, Qilong Feng

Lecture notes in computer science

DOI

2008

An O *(3.523k ) Parameterized Algorithm for 3-Set Packing

Jianxin Wang, Qilong Feng

Springer eBooks

DOI

2008

An Improved Parameterized Algorithm for a Generalized Matching Problem

Jianxin Wang, Dan Ning, Qilong Feng, Jianer Chen

Springer eBooks

DOI

2007

Set Packing问题的研究进展

马振宇，王建新，冯启龙，陈建二

《计算机科学》

精选作品

期刊论文

极小–极大(k,z)-聚类问题的参数化近似

Parameterized Approximation Schemes for Fair Clustering in Doubling Metrics

Efficient coreset construction algorithm for fair k-median of lines

Better guarantees for individual fairness k-median

Linear Time Algorithms for Individually Fair k-means via Multi-Swap Local Search

A More Efficient Reduction from Outlier-Aware to Outlier-Free k-Median

Learning-augmented approximation algorithms for group fair k-center clustering

Parameterized approximation schemes for fair-range clustering

“人工智能+X”拔尖创新人才培养模式在“图灵班”的探索与实践

Parameterized Approximation Algorithm for Doubly Constrained Fair Clustering

Towards a theoretical understanding of why local search works for clustering with fair-center representation

Coresets for k-Median of Lines with Group Fairness Constraints

Clustering under a knapsack constraint: Parameterized approximation for the knapsack median problem

Approximation algorithms for facility location and k-median with differential privacy

Fully-Scalable Massively Parallel Algorithm for k-center with Outliers

Improved Approximation Algorithm for Individual Fairness k-Median

Exact Algorithms for the Maximum k-Balanced Weighted Biclique Problem

Fast Local Search Algorithms for Clustering with Adaptive Sampling and Bandit Strategies

A Single-Swap Local Search Algorithm for k-Means of Lines

最小负载受限k-中位问题的近似方案

多样性公平k-中位问题的(1+ε)-近似算法

优先k-设施选址问题的近似算法

Clustering with a Knapsack Constraint: Parameterized Approximation Algorithms for the Knapsack Median Problem

The distributed algorithms for the lower-bounded k-center clustering in metric space

PTAS for Minimum Cost MultiCovering with Disks

New Algorithms for Distributed Fair k-Center Clustering: Almost Accurate as Sequential Algorithms

New algorithms for fair k-center problem with outliers and capacity constraints

Towards a Theoretical Understanding of Why Local Search Works for Clustering with Fair-Center Representation

On the Budgeted Priority p-Median Problem in High-Dimensional Euclidean Spaces

Improved Approximation Algorithm for the Distributed Lower-Bounded k-Center Problem

Speeding Up Constrained k-Means Through 2-Means

优先级k-中心问题的FPT近似算法

Approximation algorithms for fair k-median problem without fairness violation

Improved kernels for triangle packing in tournaments

On parameterized approximation algorithms for balanced clustering

The Fair k-Center with Outliers Problem: FPT and Polynomial Approximations

Improved approximation algorithms for solving the squared metric k-facility location problem

Small Candidate Set for Translational Pattern Search

FLS: A New Local Search Algorithm for K-means with Smaller Search Space

A local search algorithm for k-means with outliers

An approximation algorithm for k-median with priorities

An improved FPT algorithm for the flip distance problem

PTAS for Minimum Cost Multi-covering with Disks

An Improved Approximation Algorithm for Squared Metric k-Facility Location

Improved Parameterized Approximation for Balanced k-Median

The Complexity of Tree Partitioning

A Unified Framework of FPT Approximation Algorithms for Clustering Problems

An approximation algorithm for the l-pseudoforest deletion problem

Fixed-parameter tractability for minimum tree cut/paste distance and minimum common integer partition

Randomized Parameterized Algorithms for the Kidney Exchange Problem

An Improved Approximation Algorithm for the k-Means Problem with Penalties

Exponential Time Approximation Scheme for TSP

Improved Algorithms for Clustering with Outliers

2-Club簇图顶点删除问题改进参数算法

Improved PTAS for the constrained k-means problem

An improved kernel for Max-Bisection above tight lower bound

A parameterized algorithm for the Maximum Agreement Forest problem on multiple rooted multifurcating trees

An improved FPT algorithm for Almost Forest Deletion problem

Constant Factor Approximation Algorithm for l-Pseudoforest Deletion Problem

Parameterized Algorithms for Minimum Tree Cut/Paste Distance and Minimum Common Integer Partition

Improved Kernels for Several Problems on Planar Graphs

Dealing with several parameterized problems by random methods

The Complexity of Tree Partitioning

A New Kernel for Parameterized Max-Bisection Above Tight Lower Bound

Planar Vertex-Disjoint Cycle Packing: New Structures and Improved Kernel

Partition on trees with supply and demand: Kernelization and algorithms

Improved kernel results for some FPT problems based on simple observations

Parameterized Algorithms for Maximum Edge Biclique and Related Problems

Improved Algorithms for Several Parameterized Problems Based on Random Methods

A fixed-parameter algorithm for the maximum agreement forest problem on multifurcating trees

Kernelization and parameterized algorithms for covering a tree by a set of stars or paths

Parameterized complexity of control and bribery for d-approval elections

Improved approximation algorithm for maximum agreement forest of two rooted binary phylogenetic trees

Kernelization and randomized Parameterized algorithms for Co-path Set problem

Parameterized Minimum Cost Partition of a Tree with Supply and Demand

On Unknown Small Subsets and Implicit Measures: New Techniques for Parameterized Algorithms

Kernelization in parameterized computation: A survey

Improved parameterized algorithms for minimum link-length rectilinear spanning path problem