default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBundit Laekhanukit
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j15]Shi Li, Bundit Laekhanukit:
Polynomial Integrality Gap of Flow LP for Directed Steiner Tree. ACM Trans. Algorithms 21(1): 2:1-2:9 (2025)- 2024
- [i32]Bundit Laekhanukit:
Breaking the Barrier: A Polynomial-Time Polylogarithmic Approximation for Directed Steiner Tree. CoRR abs/2412.10744 (2024) - 2023
- [j14]Logan Grout, Joseph Cheriyan
, Bundit Laekhanukit:
On a partition LP relaxation for min-cost 2-node connected spanning subgraphs. Oper. Res. Lett. 51(3): 289-295 (2023) - [i31]Yijia Chen, Yi Feng, Bundit Laekhanukit, Yanlin Liu:
Simple Combinatorial Construction of the ko(1)-Lower Bound for Approximating the Parameterized k-Clique. CoRR abs/2304.07516 (2023) - 2022
- [j13]Xiangyu Guo, Guy Kortsarz, Bundit Laekhanukit, Shi Li, Daniel Vaz, Jiayi Xian:
On Approximating Degree-Bounded Network Design Problems. Algorithmica 84(5): 1252-1278 (2022) - [c31]Qingyun Chen, Bundit Laekhanukit, Chao Liao, Yuhao Zhang:
Survivable Network Design Revisited: Group-Connectivity. FOCS 2022: 278-289 - [c30]Chao Liao, Qingyun Chen, Bundit Laekhanukit, Yuhao Zhang:
Almost Tight Approximation Hardness for Single-Source Directed k-Edge-Connectivity. ICALP 2022: 89:1-89:17 - [c29]Shi Li, Bundit Laekhanukit:
Polynomial Integrality Gap of Flow LP for Directed Steiner Tree. SODA 2022: 3230-3236 - [c28]Antonios Antoniadis, Sándor Kisfaludi-Bak, Bundit Laekhanukit, Daniel Vaz:
On the Approximability of the Traveling Salesman Problem with Line Neighborhoods. SWAT 2022: 10:1-10:21 - [e1]Parinya Chalermsook, Bundit Laekhanukit:
Approximation and Online Algorithms - 20th International Workshop, WAOA 2022, Potsdam, Germany, September 8-9, 2022, Proceedings. Lecture Notes in Computer Science 13538, Springer 2022, ISBN 978-3-031-18366-9 [contents] - [i30]Chao Liao, Qingyun Chen, Bundit Laekhanukit, Yuhao Zhang:
Almost Tight Approximation Hardness for Single-Source Directed k-Edge-Connectivity. CoRR abs/2202.13088 (2022) - [i29]Qingyun Chen, Bundit Laekhanukit, Chao Liao, Yuhao Zhang:
Survivable Network Design Revisited: Group-Connectivity. CoRR abs/2204.13648 (2022) - 2021
- [c27]Parinya Chalermsook, Syamantak Das, Yunbum Kook, Bundit Laekhanukit, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz:
Vertex Sparsification for Edge Connectivity. SODA 2021: 1206-1225 - [i28]Shi Li, Bundit Laekhanukit:
Polynomial Integrality Gap of Flow LP for Directed Steiner Tree. CoRR abs/2110.13350 (2021) - [i27]Logan Grout, Joseph Cheriyan, Bundit Laekhanukit:
On a Partition LP Relaxation for Min-Cost 2-Node Connected Spanning Subgraphs. CoRR abs/2111.07481 (2021) - 2020
- [j12]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): 772-810 (2020) - [j11]Eden Chlamtác, Michael Dinitz, Guy Kortsarz, Bundit Laekhanukit:
Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds. ACM Trans. Algorithms 16(3): 33:1-33:31 (2020) - [c26]Xiangyu Guo, Guy Kortsarz, Bundit Laekhanukit, Shi Li, Daniel Vaz, Jiayi Xian:
On Approximating Degree-Bounded Network Design Problems. APPROX-RANDOM 2020: 39:1-39:21 - [c25]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: 63:1-63:20 - [c24]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: 185-186 - [i26]Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit, Yunbum Kook, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz:
Vertex Sparsification for Edge Connectivity. CoRR abs/2007.07862 (2020) - [i25]Antonios Antoniadis, Sándor Kisfaludi-Bak, Bundit Laekhanukit, Daniel Vaz:
On the Approximability of the Traveling Salesman Problem with Line Neighborhoods. CoRR abs/2008.12075 (2020)
2010 – 2019
- 2019
- [j10]Nikhil Bansal, Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai, Jesper Nederlof:
New Tools and Connections for Exponential-Time Approximation. Algorithmica 81(10): 3993-4009 (2019) - [j9]Karthik C. S., Bundit Laekhanukit, Pasin Manurangsi:
On the Parameterized Complexity of Approximating Dominating Set. J. ACM 66(5): 33:1-33:38 (2019) - [j8]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): 509-527 (2019) - [c23]Fabrizio Grandoni, Bundit Laekhanukit, Shi Li:
O(log2 k / log log k)-approximation algorithm for directed Steiner tree: a tight quasi-polynomial-time algorithm. STOC 2019: 253-264 - [i24]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 abs/1907.11404 (2019) - [i23]Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit, Daniel Vaz:
Mimicking Networks Parameterized by Connectivity. CoRR abs/1910.10665 (2019) - [i22]Chun-Hsiang Chan, Bundit Laekhanukit, Hao-Ting Wei, Yuhao Zhang:
Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs. CoRR abs/1911.09150 (2019) - 2018
- [c22]Parinya Chalermsook, Syamantak Das, Guy Even, Bundit Laekhanukit, Daniel Vaz:
Survivable Network Design for Group Connectivity in Low-Treewidth Graphs. APPROX-RANDOM 2018: 8:1-8:19 - [c21]Roee David, Karthik C. S., Bundit Laekhanukit:
On the Complexity of Closest Pair via Polar-Pair of Point-Sets. SoCG 2018: 28:1-28:15 - [c20]Karthik C. S., Bundit Laekhanukit, Pasin Manurangsi:
On the parameterized complexity of approximating dominating set. STOC 2018: 1283-1296 - [i21]Parinya Chalermsook, Syamantak Das, Guy Even, Bundit Laekhanukit, Daniel Vaz:
Survivable Network Design for Group Connectivity in Low-Treewidth Graphs. CoRR abs/1802.10403 (2018) - [i20]Marek Cygan, Guy Kortsarz, Bundit Laekhanukit:
On subexponential running times for approximating directed Steiner tree and related problems. CoRR abs/1811.00710 (2018) - [i19]Fabrizio Grandoni, Bundit Laekhanukit, Shi Li:
O(log2k/log log k)-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial-Time Algorithm. CoRR abs/1811.03020 (2018) - 2017
- [c19]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: 743-754 - [c18]Eden Chlamtác, Michael Dinitz, Guy Kortsarz, Bundit Laekhanukit:
Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds. SODA 2017: 534-553 - [c17]Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit, Daniel Vaz:
Beyond Metric Embedding: Approximating Group Steiner Trees on Bounded Treewidth Graphs. SODA 2017: 737-751 - [c16]Fabrizio Grandoni, Bundit Laekhanukit:
Surviving in directed graphs: a quasi-polynomial-time polylogarithmic approximation for two-connected directed Steiner tree. STOC 2017: 420-428 - [i18]Jittat Fakcharoenphol, Bundit Laekhanukit, Pattara Sukprasert:
Finding All Useless Arcs in Directed Planar Graphs. CoRR abs/1702.04786 (2017) - [i17]Nikhil Bansal, Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai, Jesper Nederlof:
New Tools and Connections for Exponential-time Approximation. CoRR abs/1708.03515 (2017) - [i16]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 abs/1708.04218 (2017) - [i15]Karthik C. S., Bundit Laekhanukit, Pasin Manurangsi:
On the Parameterized Complexity of Approximating Dominating Set. CoRR abs/1711.11029 (2017) - [i14]Karthik C. S., Bundit Laekhanukit, Pasin Manurangsi:
On the Parameterized Complexity of Approximating Dominating Set. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [c15]Bundit Laekhanukit:
Approximating Directed Steiner Problems via Tree Embedding. ICALP 2016: 74:1-74:13 - [i13]Eden Chlamtác, Michael Dinitz, Guy Kortsarz, Bundit Laekhanukit:
Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds. CoRR abs/1607.06068 (2016) - [i12]Roee David, Karthik C. S., Bundit Laekhanukit:
The Curse of Medium Dimension for Geometric Problems in Almost Every Norm. CoRR abs/1608.03245 (2016) - [i11]Fabrizio Grandoni, Bundit Laekhanukit:
Surviving in Directed Graphs: A Polylogarithmic Approximation for Two-Connected Directed Steiner Tree. CoRR abs/1611.01644 (2016) - 2015
- [j7]Bundit Laekhanukit:
An Improved Approximation Algorithm for the Minimum Cost Subset k-Connected Subgraph Problem. Algorithmica 72(3): 714-733 (2015) - [c14]Parinya Chalermsook, Fabrizio Grandoni, Bundit Laekhanukit:
On Survivable Set Connectivity. SODA 2015: 25-36 - [i10]Bundit Laekhanukit:
Tree Embedding and Directed Steiner Problems. CoRR abs/1511.06559 (2015) - 2014
- [j6]Bundit Laekhanukit, Adrian Vetta, Gordon T. Wilfong:
Routing Regardless of Network Stability. Algorithmica 70(3): 561-593 (2014) - [j5]Jittat Fakcharoenphol, Bundit Laekhanukit, Danupon Nanongkai:
Faster Algorithms for Semi-Matching Problems. ACM Trans. Algorithms 10(3): 14:1-14:23 (2014) - [j4]Joseph Cheriyan, Bundit Laekhanukit, Guyslain Naves, Adrian Vetta:
Approximating Rooted Steiner Networks. ACM Trans. Algorithms 11(2): 8:1-8:22 (2014) - [c13]Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai:
Pre-reduction Graph Products: Hardnesses of Properly Learning DFAs and Approximating EDP on DAGs. FOCS 2014: 444-453 - [c12]Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai:
Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation. LATIN 2014: 409-420 - [c11]Bundit Laekhanukit:
Parameters of Two-Prover-One-Round Game and The Hardness of Connectivity Problems. SODA 2014: 1626-1643 - [i9]Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai:
Pre-Reduction Graph Products: Hardnesses of Properly Learning DFAs and Approximating EDP on DAGs. CoRR abs/1408.0828 (2014) - 2013
- [j3]Ashkan Aazami, Joseph Cheriyan, Bundit Laekhanukit:
A bad example for the iterative rounding method for mincost k-connected spanning subgraphs. Discret. Optim. 10(1): 25-41 (2013) - [j2]Joseph Cheriyan, Bundit Laekhanukit:
Approximation Algorithms for Minimum-Cost $k\hbox{-}(S, T)$ Connected Digraphs. SIAM J. Discret. Math. 27(3): 1450-1481 (2013) - [c10]Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai:
Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses. FOCS 2013: 370-379 - [c9]Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai:
Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More. SODA 2013: 1557-1576 - [i8]Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai:
Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses. CoRR abs/1308.2617 (2013) - 2012
- [j1]Jittat Fakcharoenphol, Bundit Laekhanukit:
An O(log2k)-Approximation Algorithm for the k-Vertex Connected Spanning Subgraph Problem. SIAM J. Comput. 41(5): 1095-1109 (2012) - [c8]Bundit Laekhanukit, Adrian Vetta, Gordon T. Wilfong:
Routing Regardless of Network Stability. ESA 2012: 719-730 - [c7]Bundit Laekhanukit, Shayan Oveis Gharan, Mohit Singh:
A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem. ICALP (1) 2012: 606-616 - [c6]Joseph Cheriyan, Bundit Laekhanukit, Guyslain Naves, Adrian Vetta:
Approximating rooted Steiner networks. SODA 2012: 1499-1511 - [c5]Bundit Laekhanukit, Guyslain Naves, Adrian Vetta:
Non-redistributive Second Welfare Theorems. WINE 2012: 227-243 - [i7]Bundit Laekhanukit, Shayan Oveis Gharan, Mohit Singh:
A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem. CoRR abs/1205.1262 (2012) - [i6]Bundit Laekhanukit, Adrian Vetta, Gordon T. Wilfong:
Routing Regardless of Network Stability. CoRR abs/1207.0043 (2012) - [i5]Bundit Laekhanukit:
Parameters of Two-Prover-One-Round Game and The Hardness of Connectivity Problems. CoRR abs/1212.0752 (2012) - [i4]Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai:
Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More. CoRR abs/1212.4129 (2012) - 2011
- [c4]Bundit Laekhanukit:
An Improved Approximation Algorithm for Minimum-Cost Subset k-Connectivity - (Extended Abstract). ICALP (1) 2011: 13-24 - [i3]Bundit Laekhanukit:
An improved approximation algorithm for the minimum-cost subset k-connected subgraph problem. CoRR abs/1104.3923 (2011) - 2010
- [c3]Jittat Fakcharoenphol, Bundit Laekhanukit, Danupon Nanongkai:
Faster Algorithms for Semi-matching Problems (Extended Abstract). ICALP (1) 2010: 176-187 - [c2]Patrick Briest, Parinya Chalermsook, Sanjeev Khanna, Bundit Laekhanukit, Danupon Nanongkai:
Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing. WINE 2010: 444-454 - [i2]Jittat Fakcharoenphol, Bundit Laekhanukit, Danupon Nanongkai:
Faster Algorithms for Semi-Matching Problems. CoRR abs/1004.3363 (2010)
2000 – 2009
- 2009
- [i1]Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai:
Stackelberg Pricing is Hard to Approximate within 2-ε. CoRR abs/0910.0443 (2009) - 2008
- [c1]Jittat Fakcharoenphol, Bundit Laekhanukit:
An o(log2 k)-approximation algorithm for the k-vertex connected spanning subgraph problem. STOC 2008: 153-158
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-22 20:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
