An o(log2 k)-approximation algorithm for the k-vertex connected spanning subgraph problem. - Jittat Fakcharoenphol; Bundit Laekhanukit (STOC, 2008)

Stackelberg Pricing is Hard to Approximate within 2-ε - Parinya Chalermsook; Bundit Laekhanukit; Danupon Nanongkai (CoRR, 2009)

Faster Algorithms for Semi-matching Problems (Extended Abstract). - Jittat Fakcharoenphol; Bundit Laekhanukit; Danupon Nanongkai (ICALP (1), 2010)

Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing. - Patrick Briest; Parinya Chalermsook; Sanjeev Khanna; Bundit Laekhanukit; Danupon Nanongkai (WINE, 2010)

An Improved Approximation Algorithm for Minimum-Cost Subset k-Connectivity - (Extended Abstract). - Bundit Laekhanukit (ICALP (1), 2011)

Routing Regardless of Network Stability. - Bundit Laekhanukit; Adrian Vetta; Gordon T. Wilfong (ESA, 2012)

A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem. - Bundit Laekhanukit; Shayan Oveis Gharan; Mohit Singh (ICALP (1), 2012)

Approximating rooted Steiner networks. - Joseph Cheriyan; Bundit Laekhanukit; Guyslain Naves; Adrian Vetta (SODA, 2012)

Non-redistributive Second Welfare Theorems. - Bundit Laekhanukit; Guyslain Naves; Adrian Vetta (WINE, 2012)

An O(log2k)-Approximation Algorithm for the k-Vertex Connected Spanning Subgraph Problem. - Jittat Fakcharoenphol; Bundit Laekhanukit (SIAM J. Comput., 2012)

Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses. - Parinya Chalermsook; Bundit Laekhanukit; Danupon Nanongkai (FOCS, 2013)

Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More. - Parinya Chalermsook; Bundit Laekhanukit; Danupon Nanongkai (SODA, 2013)

A bad example for the iterative rounding method for mincost k-connected spanning subgraphs. - Ashkan Aazami; Joseph Cheriyan; Bundit Laekhanukit (Discret. Optim., 2013)

Approximation Algorithms for Minimum-Cost $k hbox{-}(S, T)$ Connected Digraphs. - Joseph Cheriyan; Bundit Laekhanukit (SIAM J. Discret. Math., 2013)

Pre-reduction Graph Products: Hardnesses of Properly Learning DFAs and Approximating EDP on DAGs. - Parinya Chalermsook; Bundit Laekhanukit; Danupon Nanongkai (FOCS, 2014)

Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation. - Parinya Chalermsook; Bundit Laekhanukit; Danupon Nanongkai (LATIN, 2014)

Parameters of Two-Prover-One-Round Game and The Hardness of Connectivity Problems. - Bundit Laekhanukit (SODA, 2014)

Faster Algorithms for Semi-Matching Problems. - Jittat Fakcharoenphol; Bundit Laekhanukit; Danupon Nanongkai (ACM Trans. Algorithms, 2014)

On Survivable Set Connectivity. - Parinya Chalermsook; Fabrizio Grandoni 001; Bundit Laekhanukit (SODA, 2015)

An Improved Approximation Algorithm for the Minimum Cost Subset k-Connected Subgraph Problem. - Bundit Laekhanukit (Algorithmica, 2015)

Tree Embedding and Directed Steiner Problems. - Bundit Laekhanukit (CoRR, 2015)

Approximating Directed Steiner Problems via Tree Embedding. - Bundit Laekhanukit (ICALP, 2016)

The Curse of Medium Dimension for Geometric Problems in Almost Every Norm. - Roee David; Karthik C. S. 001; Bundit Laekhanukit (CoRR, 2016)

Surviving in Directed Graphs: A Polylogarithmic Approximation for Two-Connected Directed Steiner Tree. - Fabrizio Grandoni 001; Bundit Laekhanukit (CoRR, 2016)

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 001 (FOCS, 2017)

Beyond Metric Embedding: Approximating Group Steiner Trees on Bounded Treewidth Graphs. - Parinya Chalermsook; Syamantak Das; Bundit Laekhanukit; Daniel Vaz 001 (SODA, 2017)

Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds. - Eden Chlamtác; Michael Dinitz; Guy Kortsarz; Bundit Laekhanukit (SODA, 2017)

Surviving in directed graphs: a quasi-polynomial-time polylogarithmic approximation for two-connected directed Steiner tree. - Fabrizio Grandoni 001; Bundit Laekhanukit (STOC, 2017)

Finding All Useless Arcs in Directed Planar Graphs. - Jittat Fakcharoenphol; Bundit Laekhanukit; Pattara Sukprasert (CoRR, 2017)

Survivable Network Design for Group Connectivity in Low-Treewidth Graphs. - Parinya Chalermsook; Syamantak Das; Guy Even; Bundit Laekhanukit; Daniel Vaz 001 (APPROX-RANDOM, 2018)

On the Complexity of Closest Pair via Polar-Pair of Point-Sets. - Roee David; Karthik C. S. 001; Bundit Laekhanukit (SoCG, 2018)

On the parameterized complexity of approximating dominating set. - Karthik C. S. 001; Bundit Laekhanukit; Pasin Manurangsi (STOC, 2018)

On subexponential running times for approximating directed Steiner tree and related problems. - Marek Cygan; Guy Kortsarz; Bundit Laekhanukit (CoRR, 2018)

O(log2k/log log k)-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial-Time Algorithm. - Fabrizio Grandoni 001; Bundit Laekhanukit; Shi Li 001 (CoRR, 2018)

O(log2 k / log log k)-approximation algorithm for directed Steiner tree: a tight quasi-polynomial-time algorithm. - Fabrizio Grandoni 001; Bundit Laekhanukit; Shi Li 001 (STOC, 2019)

New Tools and Connections for Exponential-Time Approximation. - Nikhil Bansal 001; Parinya Chalermsook; Bundit Laekhanukit; Danupon Nanongkai; Jesper Nederlof (Algorithmica, 2019)

Tight Approximation for Variants of Directed Steiner Tree via State-Tree Decomposition and Linear Programming Rounding. - Xiangyu Guo; Bundit Laekhanukit; Shi Li 001; Jiayi Xian (CoRR, 2019)

Mimicking Networks Parameterized by Connectivity. - Parinya Chalermsook; Syamantak Das; Bundit Laekhanukit; Daniel Vaz 001 (CoRR, 2019)

$O( log^2{k}/ log log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm. - Fabrizio Grandoni 001; Bundit Laekhanukit; Shi Li 001 (SIAM J. Comput., 2019)

Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs. - Chun-Hsiang Chan; Bundit Laekhanukit; Hao-Ting Wei; Yuhao Zhang 001 (APPROX-RANDOM, 2020)

On Approximating Degree-Bounded Network Design Problems. - Xiangyu Guo; Guy Kortsarz; Bundit Laekhanukit; Shi Li 001; Daniel Vaz 001; Jiayi Xian (APPROX-RANDOM, 2020)

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 (GECCO Companion, 2020)

From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More. - Parinya Chalermsook; Marek Cygan; Guy Kortsarz; Bundit Laekhanukit; Pasin Manurangsi; Danupon Nanongkai; Luca Trevisan 001 (SIAM J. Comput., 2020)

Vertex Sparsification for Edge Connectivity. - Parinya Chalermsook; Syamantak Das; Yunbum Kook; Bundit Laekhanukit; Yang P. Liu; Richard Peng; Mark Sellke; Daniel Vaz 001 (SODA, 2021)

Survivable Network Design Revisited: Group-Connectivity. - Qingyun Chen; Bundit Laekhanukit; Chao Liao; Yuhao Zhang 001 (FOCS, 2022)

Almost Tight Approximation Hardness for Single-Source Directed k-Edge-Connectivity. - Chao Liao; Qingyun Chen; Bundit Laekhanukit; Yuhao Zhang 001 (ICALP, 2022)

Polynomial Integrality Gap of Flow LP for Directed Steiner Tree. - Shi Li 001; Bundit Laekhanukit (SODA, 2022)

On the Approximability of the Traveling Salesman Problem with Line Neighborhoods. - Antonios Antoniadis 001; Sándor Kisfaludi-Bak; Bundit Laekhanukit; Daniel Vaz 001 (SWAT, 2022)

Simple Combinatorial Construction of the ko(1)-Lower Bound for Approximating the Parameterized k-Clique. - Yijia Chen 001; Yi Feng; Bundit Laekhanukit; Yanlin Liu (CoRR, 2023)

On a partition LP relaxation for min-cost 2-node connected spanning subgraphs. - Logan Grout; Joseph Cheriyan; Bundit Laekhanukit (Oper. Res. Lett., 2023)

Simple Combinatorial Construction of the ko (1)-Lower Bound for Approximating the Parameterized k-Clique. - Yijia Chen 001; Yi Feng; Bundit Laekhanukit; Yanlin Liu (SOSA, 2025)