1 citations · 3 across the 5 of their papers we have counts for
5 papers
A Polynomial-Time Algorithm for MCS Partial Search Order on Chordal Graphs
Guozhen Rong, Yongjie Yang, Wenjun Li
We study the partial search order problem (PSOP) proposed recently by Scheffler [WG 2022]. Given a graph together with a partial order over the set of vertices of , this pro…
Cycle Extendability of Hamiltonian Strongly Chordal Graphs
Guozhen Rong, Wenjun Li, Jianxin Wang +1
In 1990, Hendry conjectured that all Hamiltonian chordal graphs are cycle extendable. After a series of papers confirming the conjecture for a number of graph classes, the conjectu…
Improved Kernels and Algorithms for Claw and Diamond Free Edge Deletion Based on Refined Observations
Wenjun Li, Huan Peng, Yongjie Yang
In the {claw, diamond}-free edge deletion problem, we are given a graph and an integer , the question is whether there are at most edges whose deletion results in a gr…
Further Kernelization of Proper Interval Vertex Deletion: New Observations and Refined Analysis
Wenjun Li, Yongjie Yang, Jianer Chen +1
In the Proper Interval Vertex Deletion problem (PIVD for short), we are given a graph and an integer parameter , and the question is whether there are at most vertices…
A -Vertex Kernel for Maximum Internal Spanning Tree
Wenjun Li, Jianxin Wang, Jianer Chen +1
We consider the parameterized version of the maximum internal spanning tree problem, which, given an -vertex graph and a parameter , asks for a spanning tree with at least $k…