| 2009 | ||
|---|---|---|
| 2 | Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai: Stackelberg Pricing is Hard to Approximate within $2-\epsilon$ CoRR abs/0910.0443: (2009) | |
| 2008 | ||
| 1 | Jittat Fakcharoenphol, Bundit Laekhanukit: An o(log2 k)-approximation algorithm for the k-vertex connected spanning subgraph problem. STOC 2008: 153-158 | |
| 1 | Parinya Chalermsook | [2] |
| 2 | Jittat Fakcharoenphol | [1] |
| 3 | Danupon Nanongkai | [2] |