31 citations · 74 across the 13 of their papers we have counts for
15 papers
Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time
Jianer Chen, Qin Huang, Iyad Kanj +2
We present streaming algorithms for the graph -matching problem in both the insert-only and dynamic models. Our algorithms, with space complexity matching the best upper bounds,…
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…
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…
Linear-Time Parameterized Algorithms with Limited Local Resources
Jianer Chen, Ying Guo, Qin Huang
We propose a new (theoretical) computational model for the study of massive data processing with limited computational resources. Our model measures the complexity of reading the v…
On Scheduling Two-Stage Jobs on Multiple Two-Stage Flowshops
Guangwei Wu, Jianer Chen, Jianxin Wang
Motivated by the current research in data centers and cloud computing, we study the problem of scheduling a set of two-stage jobs on multiple two-stage flowshops. A new formulation…
An Parameterized Algorithm for the Multiterminal Cut Problem
Yixin Cao, Jianer Chen, Jia-Hao Fan
We study the \emph{multiterminal cut} problem, which, given an -vertex graph whose edges are integer-weighted and a set of terminals, asks for a partition of the vertex set such…