Bundit Laekhanukit

Publication Activity (10 Years)

Years Active: 2008-2023
Publications (10 Years): 45

Top Topics

Top Venues

Publications

Yijia Chen, Yi Feng, Bundit Laekhanukit, Yanlin Liu
-Lower Bound for Approximating the Parameterized k-Clique. CoRR (2023)
Logan Grout, Joseph Cheriyan, Bundit Laekhanukit
On a partition LP relaxation for min-cost 2-node connected spanning subgraphs. Oper. Res. Lett. 51 (3) (2023)
Xiangyu Guo, Guy Kortsarz, Bundit Laekhanukit, Shi Li, Daniel Vaz, Jiayi Xian
On Approximating Degree-Bounded Network Design Problems. Algorithmica 84 (5) (2022)
Shi Li, Bundit Laekhanukit
Polynomial Integrality Gap of Flow LP for Directed Steiner Tree. SODA (2022)
Antonios Antoniadis, Sándor Kisfaludi-Bak, Bundit Laekhanukit, Daniel Vaz
On the Approximability of the Traveling Salesman Problem with Line Neighborhoods. SWAT (2022)
Qingyun Chen, Bundit Laekhanukit, Chao Liao, Yuhao Zhang
Survivable Network Design Revisited: Group-Connectivity. CoRR (2022)
Qingyun Chen, Bundit Laekhanukit, Chao Liao, Yuhao Zhang
Survivable Network Design Revisited: Group-Connectivity. FOCS (2022)
Chao Liao, Qingyun Chen, Bundit Laekhanukit, Yuhao Zhang
Almost Tight Approximation Hardness for Single-Source Directed k-Edge-Connectivity. CoRR (2022)
Chao Liao, Qingyun Chen, Bundit Laekhanukit, Yuhao Zhang
Almost Tight Approximation Hardness for Single-Source Directed k-Edge-Connectivity. ICALP (2022)
Shi Li, Bundit Laekhanukit
Polynomial Integrality Gap of Flow LP for Directed Steiner Tree. CoRR (2021)
Logan Grout, Joseph Cheriyan, Bundit Laekhanukit
On a Partition LP Relaxation for Min-Cost 2-Node Connected Spanning Subgraphs. CoRR (2021)
Parinya Chalermsook, Syamantak Das, Yunbum Kook, Bundit Laekhanukit, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz
Vertex Sparsification for Edge Connectivity. SODA (2021)
Parinya Chalermsook, Marek Cygan, Guy Kortsarz, Bundit Laekhanukit, Pasin Manurangsi, Danupon Nanongkai, Luca Trevisan
From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More. SIAM J. Comput. 49 (4) (2020)
Eden Chlamtác, Michael Dinitz, Guy Kortsarz, Bundit Laekhanukit
Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds. ACM Trans. Algorithms 16 (3) (2020)
Sorrachai Yingchareonthawornchai, Proteek Chandan Roy, Bundit Laekhanukit, Eric Torng, Kalyanmoy Deb
Worst-case conditional hardness and fast algorithms with random inputs for non-dominated sorting. GECCO Companion (2020)
Chun-Hsiang Chan, Bundit Laekhanukit, Hao-Ting Wei, Yuhao Zhang
Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs. APPROX-RANDOM (2020)
Xiangyu Guo, Guy Kortsarz, Bundit Laekhanukit, Shi Li, Daniel Vaz, Jiayi Xian
On Approximating Degree-Bounded Network Design Problems. APPROX-RANDOM (2020)
Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit, Yunbum Kook, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz
Vertex Sparsification for Edge Connectivity. CoRR (2020)
Antonios Antoniadis, Sándor Kisfaludi-Bak, Bundit Laekhanukit, Daniel Vaz
On the Approximability of the Traveling Salesman Problem with Line Neighborhoods. CoRR (2020)
Fabrizio Grandoni, Bundit Laekhanukit, Shi Li
)-approximation algorithm for directed Steiner tree: a tight quasi-polynomial-time algorithm. STOC (2019)
Roee David, Karthik C. S., Bundit Laekhanukit
On the Complexity of Closest Pair via Polar-Pair of Point-Sets. SIAM J. Discret. Math. 33 (1) (2019)
Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit, Daniel Vaz
Mimicking Networks Parameterized by Connectivity. CoRR (2019)
Chun-Hsiang Chan, Bundit Laekhanukit, Hao-Ting Wei, Yuhao Zhang
Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs. CoRR (2019)
Xiangyu Guo, Bundit Laekhanukit, Shi Li, Jiayi Xian
Tight Approximation for Variants of Directed Steiner Tree via State-Tree Decomposition and Linear Programming Rounding. CoRR (2019)
Karthik C. S., Bundit Laekhanukit, Pasin Manurangsi
On the Parameterized Complexity of Approximating Dominating Set. J. ACM 66 (5) (2019)
Nikhil Bansal, Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai, Jesper Nederlof
New Tools and Connections for Exponential-Time Approximation. Algorithmica 81 (10) (2019)
Roee David, Karthik C. S., Bundit Laekhanukit
On the Complexity of Closest Pair via Polar-Pair of Point-Sets. SoCG (2018)
Parinya Chalermsook, Syamantak Das, Guy Even, Bundit Laekhanukit, Daniel Vaz
Survivable Network Design for Group Connectivity in Low-Treewidth Graphs. CoRR (2018)
Parinya Chalermsook, Syamantak Das, Guy Even, Bundit Laekhanukit, Daniel Vaz
Survivable Network Design for Group Connectivity in Low-Treewidth Graphs. APPROX-RANDOM (2018)
Karthik C. S., Bundit Laekhanukit, Pasin Manurangsi
On the parameterized complexity of approximating dominating set. STOC (2018)
Fabrizio Grandoni, Bundit Laekhanukit, Shi Li
k/log log k)-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial-Time Algorithm. CoRR (2018)
Marek Cygan, Guy Kortsarz, Bundit Laekhanukit
On subexponential running times for approximating directed Steiner tree and related problems. CoRR (2018)
Parinya Chalermsook, Marek Cygan, Guy Kortsarz, Bundit Laekhanukit, Pasin Manurangsi, Danupon Nanongkai, Luca Trevisan
From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More. FOCS (2017)
Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit, Daniel Vaz
Beyond Metric Embedding: Approximating Group Steiner Trees on Bounded Treewidth Graphs. SODA (2017)
Karthik C. S., Bundit Laekhanukit, Pasin Manurangsi
On the Parameterized Complexity of Approximating Dominating Set. Electron. Colloquium Comput. Complex. 24 (2017)
Eden Chlamtác, Michael Dinitz, Guy Kortsarz, Bundit Laekhanukit
Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds. SODA (2017)
Fabrizio Grandoni, Bundit Laekhanukit
Surviving in directed graphs: a quasi-polynomial-time polylogarithmic approximation for two-connected directed Steiner tree. STOC (2017)
Parinya Chalermsook, Marek Cygan, Guy Kortsarz, Bundit Laekhanukit, Pasin Manurangsi, Danupon Nanongkai, Luca Trevisan
From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More. CoRR (2017)
Nikhil Bansal, Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai, Jesper Nederlof
New Tools and Connections for Exponential-time Approximation. CoRR (2017)
Karthik C. S., Bundit Laekhanukit, Pasin Manurangsi
On the Parameterized Complexity of Approximating Dominating Set. CoRR (2017)
Jittat Fakcharoenphol, Bundit Laekhanukit, Pattara Sukprasert
Finding All Useless Arcs in Directed Planar Graphs. CoRR (2017)
Eden Chlamtác, Michael Dinitz, Guy Kortsarz, Bundit Laekhanukit
Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds. CoRR (2016)
Fabrizio Grandoni, Bundit Laekhanukit
Surviving in Directed Graphs: A Polylogarithmic Approximation for Two-Connected Directed Steiner Tree. CoRR (2016)
Bundit Laekhanukit
Approximating Directed Steiner Problems via Tree Embedding. ICALP (2016)
Roee David, Karthik C. S., Bundit Laekhanukit
The Curse of Medium Dimension for Geometric Problems in Almost Every Norm. CoRR (2016)
Bundit Laekhanukit
An Improved Approximation Algorithm for the Minimum Cost Subset k-Connected Subgraph Problem. Algorithmica 72 (3) (2015)
Parinya Chalermsook, Fabrizio Grandoni, Bundit Laekhanukit
On Survivable Set Connectivity. SODA (2015)
Bundit Laekhanukit
Tree Embedding and Directed Steiner Problems. CoRR (2015)
Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai
Pre-reduction Graph Products: Hardnesses of Properly Learning DFAs and Approximating EDP on DAGs. FOCS (2014)
Bundit Laekhanukit, Adrian Vetta, Gordon T. Wilfong
Routing Regardless of Network Stability. Algorithmica 70 (3) (2014)
Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai
Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation. LATIN (2014)
Jittat Fakcharoenphol, Bundit Laekhanukit, Danupon Nanongkai
Faster Algorithms for Semi-Matching Problems. ACM Trans. Algorithms 10 (3) (2014)
Bundit Laekhanukit
Parameters of Two-Prover-One-Round Game and The Hardness of Connectivity Problems. SODA (2014)
Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai
Pre-Reduction Graph Products: Hardnesses of Properly Learning DFAs and Approximating EDP on DAGs. CoRR (2014)
Joseph Cheriyan, Bundit Laekhanukit, Guyslain Naves, Adrian Vetta
Approximating Rooted Steiner Networks. ACM Trans. Algorithms 11 (2) (2014)
Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai
Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses. CoRR (2013)
Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai
Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More. SODA (2013)
Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai
Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses. FOCS (2013)
Joseph Cheriyan, Bundit Laekhanukit
Approximation Algorithms for Minimum-Cost $k\hbox{-}(S, T)$ Connected Digraphs. SIAM J. Discret. Math. 27 (3) (2013)
Ashkan Aazami, Joseph Cheriyan, Bundit Laekhanukit
A bad example for the iterative rounding method for mincost k-connected spanning subgraphs. Discret. Optim. 10 (1) (2013)
Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai
Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More CoRR (2012)
Bundit Laekhanukit, Guyslain Naves, Adrian Vetta
Non-redistributive Second Welfare Theorems. WINE (2012)
Joseph Cheriyan, Bundit Laekhanukit, Guyslain Naves, Adrian Vetta
Approximating rooted Steiner networks. SODA (2012)
Bundit Laekhanukit, Shayan Oveis Gharan, Mohit Singh
A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem CoRR (2012)
Bundit Laekhanukit, Adrian Vetta, Gordon T. Wilfong
Routing Regardless of Network Stability. ESA (2012)
Bundit Laekhanukit, Adrian Vetta, Gordon T. Wilfong
Routing Regardless of Network Stability CoRR (2012)
Jittat Fakcharoenphol, Bundit Laekhanukit
-Approximation Algorithm for the k-Vertex Connected Spanning Subgraph Problem. SIAM J. Comput. 41 (5) (2012)
Bundit Laekhanukit
Parameters of Two-Prover-One-Round Game and The Hardness of Connectivity Problems CoRR (2012)
Bundit Laekhanukit, Shayan Oveis Gharan, Mohit Singh
A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem. ICALP (1) (2012)
Bundit Laekhanukit
An improved approximation algorithm for the minimum-cost subset k-connected subgraph problem CoRR (2011)
Bundit Laekhanukit
-Connectivity - (Extended Abstract). ICALP (1) (2011)
Patrick Briest, Parinya Chalermsook, Sanjeev Khanna, Bundit Laekhanukit, Danupon Nanongkai
Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing. WINE (2010)
Jittat Fakcharoenphol, Bundit Laekhanukit, Danupon Nanongkai
Faster Algorithms for Semi-matching Problems (Extended Abstract). ICALP (1) (2010)
Jittat Fakcharoenphol, Bundit Laekhanukit, Danupon Nanongkai
Faster Algorithms for Semi-Matching Problems CoRR (2010)
Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai
Stackelberg Pricing is Hard to Approximate within 2-ε CoRR (2009)
Jittat Fakcharoenphol, Bundit Laekhanukit
k)-approximation algorithm for the k-vertex connected spanning subgraph problem. STOC (2008)