Follow
Bundit Laekhanukit
Bundit Laekhanukit
Shanghai University of Finance and Economics
Verified email at sufe.edu.cn - Homepage
Title
Cited by
Cited by
Year
From gap-eth to fpt-inapproximability: Clique, dominating set, and more
P Chalermsook, M Cygan, G Kortsarz, B Laekhanukit, P Manurangsi, ...
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
1002017
On the parameterized complexity of approximating dominating set
CS Karthik, B Laekhanukit, P Manurangsi
50th Annual ACM Symposium on Theory of Computing, 1283-1296, 2018
952018
Independent set, induced matching, and pricing: Connections and tight (subexponential time) approximation hardnesses
P Chalermsook, B Laekhanukit, D Nanongkai
2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 370-379, 2013
702013
Graph products revisited: Tight approximation hardness of induced matching, poset dimension and more
P Chalermsook, B Laekhanukit, D Nanongkai
Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013
642013
An O(\log^2 k)-Approximation Algorithm for the k-Vertex Connected Spanning Subgraph Problem
J Fakcharoenphol, B Laekhanukit
SIAM Journal on Computing 41 (5), 1095-1109, 2012
55*2012
O(log2 k / log log k)-approximation algorithm for directed Steiner tree: a tight quasi-polynomial-time algorithm
F Grandoni, B Laekhanukit, S Li
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
412019
Faster algorithms for semi-matching problems
J Fakcharoenphol, B Laekhanukit, D Nanongkai
ACM Transactions on Algorithms (TALG) 10 (3), 1-23, 2014
402014
Parameters of two-prover-one-round game and the hardness of connectivity problems
B Laekhanukit
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014
362014
Approximating spanners and directed steiner forest: Upper and lower bounds
E Chlamtáč, M Dinitz, G Kortsarz, B Laekhanukit
ACM Transactions on Algorithms (TALG) 16 (3), 1-31, 2020
312020
From gap-exponential time hypothesis to fixed parameter tractable inapproximability: Clique, dominating set, and more
P Chalermsook, M Cygan, G Kortsarz, B Laekhanukit, P Manurangsi, ...
SIAM Journal on Computing 49 (4), 772-810, 2020
282020
Approximating rooted steiner networks
J Cheriyan, B Laekhanukit, G Naves, A Vetta
ACM Transactions on Algorithms (TALG) 11 (2), 1-22, 2014
282014
Improved hardness of approximation for Stackelberg shortest-path pricing
P Briest, P Chalermsook, S Khanna, B Laekhanukit, D Nanongkai
Internet and Network Economics: 6th International Workshop, WINE 2010 …, 2010
272010
New tools and connections for exponential-time approximation
N Bansal, P Chalermsook, B Laekhanukit, D Nanongkai, J Nederlof
Algorithmica 81, 3993-4009, 2019
222019
Vertex sparsification for edge connectivity
P Chalermsook, S Das, Y Kook, B Laekhanukit, YP Liu, R Peng, M Sellke, ...
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
212021
An improved approximation algorithm for minimum-cost subset k-connectivity
B Laekhanukit
Automata, Languages and Programming, 13-24, 2011
21*2011
A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem
B Laekhanukit, S Oveis Gharan, M Singh
Automata, Languages, and Programming: 39th International Colloquium, ICALP …, 2012
162012
On the complexity of closest pair via polar-pair of point-sets
R David, B Laekhanukit
SIAM Journal on Discrete Mathematics 33 (1), 509-527, 2019
142019
On survivable set connectivity
P Chalermsook, F Grandoni, B Laekhanukit
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete …, 2014
132014
Approximation Algorithms for Minimum-Cost Connected Digraphs
J Cheriyan, B Laekhanukit
SIAM Journal on Discrete Mathematics 27 (3), 1450-1481, 2013
122013
Surviving in directed graphs: a quasi-polynomial-time polylogarithmic approximation for two-connected directed steiner tree
F Grandoni, B Laekhanukit
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
102017
The system can't perform the operation now. Try again later.
Articles 1–20