# Qilong Feng

According to our database

Collaborative distances:

^{1}, Qilong Feng authored at least 58 papers between 2008 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2019

Randomized Parameterized Algorithms for the Kidney Exchange Problem.

Algorithms, 2019

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

Proceedings of the Frontiers in Algorithmics - 13th International Workshop, 2019

2018

Parameterized algorithms for Edge Biclique and related problems.

Theor. Comput. Sci., 2018

Dealing with several parameterized problems by random methods.

Theor. Comput. Sci., 2018

Algorithms for Pedigree Comparison.

IEEE/ACM Trans. Comput. Biology Bioinform., 2018

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

J. Comput. Syst. Sci., 2018

An improved FPT algorithm for Almost Forest Deletion problem.

Inf. Process. Lett., 2018

Leveraging content similarity among VMI files to allocate virtual machines in cloud.

Future Generation Comp. Syst., 2018

Encounter Prediction-based Data Forwarding for High Reliability in Bus Networks.

Ad Hoc & Sensor Wireless Networks, 2018

New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds Decomposition.

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

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

Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018

Improved Kernels for Several Problems on Planar Graphs.

Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018

Constant Factor Approximation Algorithm for l-Pseudoforest Deletion Problem.

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017

Partition on trees with supply and demand: Kernelization and algorithms.

Theor. Comput. Sci., 2017

Improved kernel results for some FPT problems based on simple observations.

Theor. Comput. Sci., 2017

Nonuniform Neighborhood Sampling Based Simulated Annealing for the Directed Feedback Vertex Set Problem.

IEEE Access, 2017

The Complexity of Tree Partitioning.

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

An Improved FPT Algorithm for the Flip Distance Problem.

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

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

Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

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

Proceedings of the Combinatorial Optimization and Applications, 2017

2016

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

J. Comb. Optim., 2016

Kernelization and randomized Parameterized algorithms for Co-path Set problem.

J. Comb. Optim., 2016

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

SCIENCE CHINA Information Sciences, 2016

Parameterized Algorithms for Maximum Edge Biclique and Related Problems.

Proceedings of the Frontiers in Algorithmics, 10th International Workshop, 2016

Improved Algorithms for Several Parameterized Problems Based on Random Methods.

Proceedings of the Frontiers in Algorithmics, 10th International Workshop, 2016

2015

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

Theor. Comput. Sci., 2015

Parameterized complexity of control and bribery for d-approval elections.

Theor. Comput. Sci., 2015

Randomized parameterized algorithms for P

_{2}-Packing and Co-Path Packing problems.
J. Comb. Optim., 2015

Parameterized Minimum Cost Partition of a Tree with Supply and Demand.

Proceedings of the Frontiers in Algorithmics - 9th International Workshop, 2015

2014

Algorithms for parameterized maximum agreement forest problem on multiple trees.

Theor. Comput. Sci., 2014

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

Theor. Comput. Sci., 2014

Matching and Weighted P

_{2}-Packing: Algorithms and Kernels.
Theor. Comput. Sci., 2014

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

IEEE Trans. Computers, 2014

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

J. Comput. Sci. Technol., 2014

On Star-Cover and Path-Cover of a Tree.

Proceedings of the Frontiers in Algorithmics - 8th International Workshop, 2014

Improved Approximation Algorithm for Maximum Agreement Forest of Two Trees.

Proceedings of the Frontiers in Algorithmics - 8th International Workshop, 2014

Randomized Parameterized Algorithms for Co-path Set Problem.

Proceedings of the Frontiers in Algorithmics - 8th International Workshop, 2014

Approximation Algorithms for Maximum Agreement Forest on Multiple Trees.

Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

2013

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

Theor. Comput. Sci., 2013

Improved linear problem kernel for planar connected dominating set.

Theor. Comput. Sci., 2013

Parameterized Algorithms for Maximum Agreement Forest on Multiple Trees.

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

Random Methods for Parameterized Problems.

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

Parameterized Complexity of Control and Bribery for d-Approval Elections.

Proceedings of the Combinatorial Optimization and Applications, 2013

Kernelization and Lower Bounds of the Signed Domination Problem.

Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013

2012

FPT Results for Signed Domination.

Proceedings of the Theory and Applications of Models of Computation, 2012

Improved FPT Algorithms for Rectilinear k-Links Spanning Path.

Proceedings of the Theory and Applications of Models of Computation, 2012

2011

Theor. Comput. Sci., 2011

Improved deterministic algorithms for weighted matching and packing problems.

Theor. Comput. Sci., 2011

Color-Coding and its Applications: A Survey.

Int. J. Software and Informatics, 2011

An Improved Kernel for Planar Connected Dominating Set.

Proceedings of the Theory and Applications of Models of Computation, 2011

Matching and P 2-Packing: Weighted Versions.

Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

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

Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2011

2010

An improved kernelization for P

_{2}-packing.
Inf. Process. Lett., 2010

2009

Improved Deterministic Algorithms for Weighted Matching and Packing Problems.

Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

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

Proceedings of the Frontiers in Algorithmics, Third International Workshop, 2009

2008

An Improved Parameterized Algorithm for a Generalized Matching Problem.

Proceedings of the Theory and Applications of Models of Computation, 2008

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

Proceedings of the Theory and Applications of Models of Computation, 2008

Improved Parameterized Algorithms for Weighted 3-Set Packing.

Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008