Parinya Chalermsook

activity

20092026

most citedIndependent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses

8 citations · 30 across the 29 of their papers we have counts for

collaborators

Showing cs.CGShow all

2 papers · 1 filter

cs.CG2026★ 1 cited

Fine-Grained Complexity of Continuous Euclidean k-Center

Lotte Blank, Karl Bringmann, Parinya Chalermsook +4

In the (continuous) Euclidean $k$ -center problem, given $n$ points in $R^{d}$ and an integer $k$ , the goal is to find $k$ center points in $R^{d}$ that minimize the m…

cs.CG2020

Coloring and Maximum Weight Independent Set of Rectangles

Parinya Chalermsook, Bartosz Walczak

In 1960, Asplund and Grünbaum proved that every intersection graph of axis-parallel rectangles in the plane admits an $O (ω^{2})$ -coloring, where $ω$ is the maximum size of a clique.…