1 citations · 1 across the 2 of their papers we have counts for
3 papers
cs.DS2021★ 1 cited
Optimal Streaming Algorithms for Graph Matching
Jianer Chen, Qin Huang, Iyad Kanj +1
We present parameterized streaming algorithms for the graph matching problem in both the dynamic and the insert-only models. For the dynamic streaming model, we present a one-pass…
cs.CG2020
Near-Optimal Algorithms for Point-Line Covering Problems
Jianer Chen, Qin Huang, Iyad Kanj +1
We study fundamental point-line covering problems in computational geometry, in which the input is a set of points in the plane. The first is the Rich Lines problem, which asks…
cs.DS2013
Algorithms for Cut Problems on Trees
Iyad Kanj, Guohui Lin, Tian Liu +7
We study the {\sc multicut on trees} and the {\sc generalized multiway Cut on trees} problems. For the {\sc multicut on trees} problem, we present a parameterized algorithm that ru…