1 citations · 1 across the 3 of their papers we have counts for
5 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…
How to select the largest k elements from evolving data?
Qin Huang, Xingwu Liu, Xiaoming Sun +1
In this paper we investigate the top--selection problem, i.e. determine the largest, second largest, ..., and the -th largest elements, in the dynamic data model. In this mod…