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