Qilong Feng

According to our database1, Qilong Feng authored at least 93 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Approximation algorithms for fair <i>k</i>-median problem without fairness violation.
Theor. Comput. Sci., February, 2024

Machine learning techniques for CT imaging diagnosis of novel coronavirus pneumonia: a review.
Neural Comput. Appl., January, 2024

SEC: More Accurate Clustering Algorithm via Structural Entropy.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

Towards a Theoretical Understanding of Why Local Search Works for Clustering with Fair-Center Representation.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Improved kernels for triangle packing in tournaments.
Sci. China Inf. Sci., May, 2023

Improved approximation algorithms for solving the squared metric <i>k</i>-facility location problem.
Theor. Comput. Sci., 2023

On parameterized approximation algorithms for balanced clustering.
J. Comb. Optim., 2023

Linear Time Algorithms for k-means with Multi-Swap Local Search.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Fast Algorithms for Distributed k-Clustering with Outliers.
Proceedings of the International Conference on Machine Learning, 2023

The Fair k-Center with Outliers Problem: FPT and Polynomial Approximations.
Proceedings of the Frontiers of Algorithmics - 17th International Joint Conference, 2023

2022
Preface.
Math. Struct. Comput. Sci., 2022

New Approximation Algorithms for Fair k-median Problem.
CoRR, 2022

Small Candidate Set for Translational Pattern Search.
Algorithmica, 2022

FLS: A New Local Search Algorithm for K-means with Smaller Search Space.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

2021
A new approximation algorithm for contig-based genomic scaffold filling.
Theor. Comput. Sci., 2021

A local search algorithm for <i>k</i>-means with outliers.
Neurocomputing, 2021

An improved FPT algorithm for the flip distance problem.
Inf. Comput., 2021

An approximation algorithm for k-median with priorities.
Sci. China Inf. Sci., 2021

PTAS for Minimum Cost Multi-covering with Disks.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Crowdturfing Detection in Online Review System: A Graph-Based Modeling.
Proceedings of the Collaborative Computing: Networking, Applications and Worksharing, 2021

Improved Parameterized Approximation for Balanced k-Median.
Proceedings of the Combinatorial Optimization and Applications, 2021

An Improved Approximation Algorithm for Squared Metric k-Facility Location.
Proceedings of the Combinatorial Optimization and Applications, 2021

2020
Fixed-parameter tractability for minimum tree cut/paste distance and minimum common integer partition.
Theor. Comput. Sci., 2020

New kernels for several problems on planar graphs.
Theor. Comput. Sci., 2020

An approximation algorithm for the <i>l</i>-pseudoforest deletion problem.
Theor. Comput. Sci., 2020

An improved kernel for Max-Bisection above tight lower bound.
Theor. Comput. Sci., 2020

The Complexity of Tree Partitioning.
Algorithmica, 2020

A Unified Framework of FPT Approximation Algorithms for Clustering Problems.
Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

2019
Improved PTAS for the constrained k-means problem.
J. Comb. Optim., 2019

Randomized Parameterized Algorithms for the Kidney Exchange Problem.
Algorithms, 2019

Improved Algorithms for Clustering with Outliers.
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

An Improved Approximation Algorithm for the k-Means Problem with Penalties.
Proceedings of the Frontiers in Algorithmics - 13th International Workshop, 2019

A Classification of Care Apparel Characteristics for Disabled User Requirement.
Proceedings of the Advances in Design for Inclusion, 2019

A 2.57-Approximation Algorithm for Contig-Based Genomic Scaffold Filling.
Proceedings of the Algorithmic Aspects in Information and Management, 2019

Exponential Time Approximation Scheme for TSP.
Proceedings of the Algorithmic Aspects in Information and Management, 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. Biol. 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 Gener. Comput. Syst., 2018

Speeding Up Constrained k-Means Through 2-Means.
CoRR, 2018

Encounter Prediction-based Data Forwarding for High Reliability in Bus Networks.
Ad Hoc Sens. Wirel. 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

最大圈分解问题的研究进展 (Survey of Cycle Packing Problem).
计算机科学, 2017

Nonuniform Neighborhood Sampling Based Simulated Annealing for the Directed Feedback Vertex Set Problem.
IEEE Access, 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

Parameterized Algorithms for the Maximum Agreement Forest Problem on Multiple Rooted Multifurcating Trees.
CoRR, 2016

A fixed-parameter algorithm for the maximum agreement forest problem on multifurcating trees.
Sci. China Inf. Sci., 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<sub>2</sub>-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<sub>2</sub>-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

Algorithms for Maximum Agreement Forest of Multiple General Trees.
CoRR, 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
An O<sup>*</sup>(3.53<sup>3k</sup>)-time parameterized algorithm for the 3-set packing problem.
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. Softw. 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<sub>2</sub>-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


  Loading...