| No. |
Title |
Author |
Year |
| 1 |
Polynomial-Time Approximation of Independent Set Parameterized by Treewidth |
Chalermsook, Parinya et al. |
2023 |
| 2 |
Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver |
Chalermsook, Parinya et al. |
2022 |
| 3 |
New Binary Search Tree Bounds via Geometric Inversions |
Chalermsook, Parinya et al. |
2020 |
| 4 |
Pinning down the Strong Wilber 1 Bound for Binary Search Trees |
Chalermsook, Parinya et al. |
2020 |
| 5 |
A Tight Extremal Bound on the Lovász Cactus Number in Planar Graphs |
Chalermsook, Parinya et al. |
2019 |
| 6 |
Multi-Finger Binary Search Trees |
Chalermsook, Parinya et al. |
2018 |
| 7 |
Survivable Network Design for Group Connectivity in Low-Treewidth Graphs |
Chalermsook, Parinya et al. |
2018 |
| 8 |
How to Tame Rectangles: Solving Independent Set and Coloring of Rectangles via Shrinking |
Adamaszek, Anna et al. |
2015 |
| 9 |
On Guillotine Cutting Sequences |
Abed, Fidaa et al. |
2015 |
| 10 |
Clustering With Center Constraints |
Chalermsook, Parinya et al. |
2013 |
