| 2022 | FOCS | Survivable Network Design Revisited: Group-Connectivity. | Qingyun Chen, Bundit Laekhanukit, Chao Liao, Yuhao Zhang |
| 2022 | ICALP | Almost Tight Approximation Hardness for Single-Source Directed k-Edge-Connectivity. | Chao Liao, Qingyun Chen, Bundit Laekhanukit, Yuhao Zhang |
| 2022 | SODA | Polynomial Integrality Gap of Flow LP for Directed Steiner Tree. | Shi Li, Bundit Laekhanukit |
| 2021 | SODA | Vertex Sparsification for Edge Connectivity. | Parinya Chalermsook, Syamantak Das, Yunbum Kook, Bundit Laekhanukit, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz |
| 2020 | GECCO | Worst-case conditional hardness and fast algorithms with random inputs for non-dominated sorting. | Sorrachai Yingchareonthawornchai, Proteek Chandan Roy, Bundit Laekhanukit, Eric Torng, Kalyanmoy Deb |
| 2019 | STOC | Untitled record | Fabrizio Grandoni, Bundit Laekhanukit, Shi Li |
| 2018 | STOC | On the parameterized complexity of approximating dominating set. | Karthik C. S., Bundit Laekhanukit, Pasin Manurangsi |
| 2017 | FOCS | From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More. | Parinya Chalermsook, Marek Cygan, Guy Kortsarz, Bundit Laekhanukit, Pasin Manurangsi, Danupon Nanongkai, Luca Trevisan |
| 2017 | SODA | Beyond Metric Embedding: Approximating Group Steiner Trees on Bounded Treewidth Graphs. | Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit, Daniel Vaz |
| 2017 | SODA | Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds. | Eden Chlamtc, Michael Dinitz, Guy Kortsarz, Bundit Laekhanukit |
| 2017 | STOC | Surviving in directed graphs: a quasi-polynomial-time polylogarithmic approximation for two-connected directed Steiner tree. | Fabrizio Grandoni, Bundit Laekhanukit |
| 2016 | ICALP | Approximating Directed Steiner Problems via Tree Embedding. | Bundit Laekhanukit |
| 2015 | SODA | On Survivable Set Connectivity. | Parinya Chalermsook, Fabrizio Grandoni, Bundit Laekhanukit |
| 2014 | FOCS | Pre-reduction Graph Products: Hardnesses of Properly Learning DFAs and Approximating EDP on DAGs. | Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai |
| 2014 | LATIN | Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation. | Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai |
| 2014 | SODA | Parameters of Two-Prover-One-Round Game and The Hardness of Connectivity Problems. | Bundit Laekhanukit |
| 2013 | FOCS | Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses. | Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai |
| 2013 | SODA | Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More. | Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai |
| 2012 | ESA | Routing Regardless of Network Stability. | Bundit Laekhanukit, Adrian Vetta, Gordon T. Wilfong |
| 2012 | ICALP | A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem. | Bundit Laekhanukit, Shayan Oveis Gharan, Mohit Singh |
| 2012 | SODA | Approximating rooted Steiner networks. | Joseph Cheriyan, Bundit Laekhanukit, Guyslain Naves, Adrian Vetta |
| 2011 | ICALP | An Improved Approximation Algorithm for Minimum-Cost Subset | Bundit Laekhanukit |
| 2010 | ICALP | Faster Algorithms for Semi-matching Problems (Extended Abstract). | Jittat Fakcharoenphol, Bundit Laekhanukit, Danupon Nanongkai |
| 2008 | STOC | An o(log | Jittat Fakcharoenphol, Bundit Laekhanukit |