Wenjun Li

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

2022

A divide-and-conquer approach for reconstruction of {C≥5}-free graphs via betweenness queries.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

A 5k-vertex kernel for P2-packing.

[BibT_eX]

[DOI]

Junjie Ye

Yixin Cao

Theor. Comput. Sci., 2022

Improved kernel and algorithm for claw and diamond free edge deletion based on refined observations.

[BibT_eX]

[DOI]

Huan Peng

Theor. Comput. Sci., 2022

An improved branching algorithm for the proper interval edge deletion problem.

[BibT_eX]

[DOI]

Xiaojing Tang

Frontiers Comput. Sci., 2022

Erratum to: Incremental algorithms for the maximum internal spanning tree problem.

[BibT_eX]

[DOI]

Sci. China Inf. Sci., 2022

A Refined Branching Algorithm for the Maximum Satisfiability Problem.

[BibT_eX]

[DOI]

Algorithmica, 2022

Optimizing pcsCPD with Alternating Rank-R and Rank-1 Least Squares: Application to Complex-Valued Multi-subject fMRI Data.

[BibT_eX]

[DOI]

Li-Dan Kuang

Yan Gui

Proceedings of the Neural Information Processing - 29th International Conference, 2022

2021

Reconstruction and verification of chordal graphs with a distance oracle.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

A (2 + ϵ)k-vertex kernel for the dual coloring problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Cycle Extendability of Hamiltonian Strongly Chordal Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

An improved algorithm for the (n, 3)-MaxSAT problem: asking branchings to satisfy the clauses.

[BibT_eX]

[DOI]

J. Comb. Optim., 2021

Incremental algorithms for the maximum internal spanning tree problem.

[BibT_eX]

[DOI]

Sci. China Inf. Sci., 2021

2020

Complexity and Algorithms for Superposed Data Uploading Problem in Networks With Smart Devices.

[BibT_eX]

[DOI]

IEEE Internet Things J., 2020

Parameterized algorithms of fundamental NP-hard problems: a survey.

[BibT_eX]

[DOI]

Hum. centric Comput. Inf. Sci., 2020

A learning based joint compressive sensing for wireless sensing networks.

[BibT_eX]

[DOI]

Ping Zhang

Comput. Networks, 2020

2019

An improved linear kernel for complementary maximal strip recovery: Simpler and smaller.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Multimodel Framework for Indoor Localization Under Mobile Edge Computing Environment.

[BibT_eX]

[DOI]

IEEE Internet Things J., 2019

Page-sharing-based virtual machine packing with multi-resource constraints to reduce network traffic in migration for clouds.

[BibT_eX]

[DOI]

Future Gener. Comput. Syst., 2019

Resolution and Domination: An Improved Exact MaxSAT Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

2018

On the kernelization of split graph problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Unit interval vertex deletion: Fewer vertices are relevant.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2018

An improved FPT algorithm for Almost Forest Deletion problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2018

An optimization of virtual machine selection and placement by using memory content similarity for server consolidation in cloud.

[BibT_eX]

[DOI]

Future Gener. Comput. Syst., 2018

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

[BibT_eX]

[DOI]

Future Gener. Comput. Syst., 2018

A 5k-vertex Kernel for P2-packing.

[BibT_eX]

[DOI]

Junjie Ye

Yixin Cao

CoRR, 2018

Kernelization for P2-Packing: A Gerrymandering Approach.

[BibT_eX]

[DOI]

Junjie Ye

Yixin Cao

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

2017

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree.

[BibT_eX]

[DOI]

Inf. Comput., 2017

Improved Kernels and Algorithms for Claw and Diamond Free Edge Deletion Based on Refined Observations.

[BibT_eX]

[DOI]

CoRR, 2017

A 42k Kernel for the Complementary Maximal Strip Recovery Problem.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics - 11th International Workshop, 2017

An Improved Branching Algorithm for (n, 3)-MaxSAT Based on Refined Observations.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2017

2016

Kernelization of Two Path Searching Problems on Split Graphs.

[BibT_eX]

[DOI]

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

2015

A 2k-vertex Kernel for Maximum Internal Spanning Tree.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Smaller Kernels for Several FPT Problems Based on Simple Observations.

[BibT_eX]

[DOI]

Shuai Hu

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

An Improved Kernel for the Complementary Maximal Strip Recovery Problem.

[BibT_eX]

[DOI]

Shuai Hu

Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

2014

On the parameterized vertex cover problem for graphs with perfect matching.

[BibT_eX]

[DOI]

Sci. China Inf. Sci., 2014

Deeper Local Search for Better Approximation on Maximum Internal Spanning Trees.

[BibT_eX]

[DOI]

Jianer Chen

Proceedings of the Algorithms - ESA 2014, 2014

2010

A parameterized algorithm for the hyperplane-cover problem.

[BibT_eX]

[DOI]