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
942017
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
682013
On the parameterized complexity of approximating dominating set
CS Karthik, B Laekhanukit, P Manurangsi
STOC 2018-Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of …, 2018
662018
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
622013
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
52*2012
Faster algorithms for semi-matching problems
J Fakcharoenphol, B Laekhanukit, D Nanongkai
ACM Transactions on Algorithms (TALG) 10 (3), 1-23, 2014
352014
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
322014
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
262020
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
262019
Approximating rooted steiner networks
J Cheriyan, B Laekhanukit, G Naves, A Vetta
ACM Transactions on Algorithms (TALG) 11 (2), 1-22, 2014
232014
Improved hardness of approximation for Stackelberg shortest-path pricing
P Briest, P Chalermsook, S Khanna, B Laekhanukit, D Nanongkai
International Workshop on Internet and Network Economics, 444-454, 2010
232010
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
192019
An improved approximation algorithm for minimum-cost subset k-connectivity
B Laekhanukit
Automata, Languages and Programming, 13-24, 2011
19*2011
New tools and connections for exponential-time approximation
N Bansal, P Chalermsook, B Laekhanukit, D Nanongkai, J Nederlof
Algorithmica 81 (10), 3993-4009, 2019
182019
A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem
B Laekhanukit, S Oveis Gharan, M Singh
International Colloquium on Automata, Languages, and Programming, 606-616, 2012
122012
Approximation Algorithms for Minimum-Cost Connected Digraphs
J Cheriyan, B Laekhanukit
SIAM Journal on Discrete Mathematics 27 (3), 1450-1481, 2013
112013
A bad example for the iterative rounding method for mincost k-connected spanning subgraphs
A Aazami, J Cheriyan, B Laekhanukit
Discrete Optimization, 2009
10*2009
On survivable set connectivity
P Chalermsook, F Grandoni, B Laekhanukit
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete …, 2014
92014
Detecting and cleaning intruders in sensor networks
P Yospanya, B Laekhanukit, D Nanongkai, J Fakcharoenphol
Proceedings of the 8th National Computer Science and Engineering Conference, 2004
92004
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
82017
The system can't perform the operation now. Try again later.
Articles 1–20