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 2019Show all

2 papers · 1 filter

cs.DS2019

Pinning Down the Strong Wilber 1 Bound for Binary Search Trees

Parinya Chalermsook, Julia Chuzhoy, Thatchaphol Saranurak

The dynamic optimality conjecture, postulating the existence of an $O (1)$ -competitive online algorithm for binary search trees (BSTs), is among the most fundamental open problems i…

cs.DS2019★ 3 cited

Mimicking Networks Parameterized by Connectivity

Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit +1

Given a graph $G = (V, E)$ , capacities $w (e)$ on edges, and a subset of terminals $T \subseteq V : ∣ T ∣ = k$ , a mimicking network for $(G, T)$ is a graph $(…