Shaohua Li

activity

20062023

most citedCluster Editing parameterized above modification-disjoint

P_{3}

-packings

3 citations · 5 across the 5 of their papers we have counts for

collaborators

Showing cs.CCShow all

2 papers · 1 filter

cs.CC2023

Problems in NP can Admit Double-Exponential Lower Bounds when Parameterized by Treewidth or Vertex Cover

Florent Foucaud, Esther Galby, Liana Khazaliya +4

Treewidth (tw) is an important parameter that, when bounded, yields tractability for many problems. For example, graph problems expressible in Monadic Second Order (MSO) logic and…

cs.CC2019★ 3 cited

Cluster Editing parameterized above modification-disjoint $P_{3}$ -packings

Shaohua Li, Marcin Pilipczuk, Manuel Sorge

Given a graph $G = (V, E)$ and an integer $k$ , the Cluster Editing problem asks whether we can transform $G$ into a union of vertex-disjoint cliques by at most $k$ modifications (edge…

Problems in NP can Admit Double-Exponential Lower Bounds when Parameterized by Treewidth or Vertex Cover

Cluster Editing parameterized above modification-disjoint P3​-packings

Cluster Editing parameterized above modification-disjoint $P_{3}$ -packings