3 citations · 5 across the 5 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DS2019★ 2 cited
An Improved FPT Algorithm for the Flip Distance Problem
Qilong Feng, Shaohua Li, Xiangzhong Meng +1
Given a set of points in the Euclidean plane and two triangulations of , the flip distance between these two triangulations is the minimum number of flips required…
cs.CC2019★ 3 cited
Cluster Editing parameterized above modification-disjoint -packings
Shaohua Li, Marcin Pilipczuk, Manuel Sorge
Given a graph and an integer , the Cluster Editing problem asks whether we can transform into a union of vertex-disjoint cliques by at most modifications (edge…