2 citations · 2 across the 4 of their papers we have counts for
4 papers
Clique in 3-track interval graphs is APX-hard
Minghui Jiang
Butman, Hermelin, Lewenstein, and Rawitz proved that Clique in t-interval graphs is NP-hard for t >= 3. We strengthen this result to show that Clique in 3-track interval graphs is…
Disjoint empty disks supported by a point set
Adrian Dumitrescu, Minghui Jiang
For a planar point-set , let D(P) be the minimum number of pairwise-disjoint empty disks such that each point in lies on the boundary of some disk. Further define D(n) as th…
Coloring translates and homothets of a convex body
Adrian Dumitrescu, Minghui Jiang
We obtain improved upper bounds and new lower bounds on the chromatic number as a linear function of the clique number, for the intersection graphs (and their complements) of finit…
New bounds on the average distance from the Fermat-Weber center of a planar convex body
Adrian Dumitrescu, Minghui Jiang, Csaba D. Tóth
The Fermat-Weber center of a planar body is a point in the plane from which the average distance to the points in is minimal. We first show that for any convex body in…