31 citations · 74 across the 13 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
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.DS2020
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…