Concepedia
Statistics
Publications
18
Citations
428
H-Index
14
Active since
2008
Affiliations
McGill University(Current)
Shanghai University of Finance and Economics
University of Waterloo
University of Vienna
Kasetsart University
Bundit Laekhanukit is an author at McGill University specializing in algorithms, computing, and computer science.
Publications per year
2008–2020
An o(log <sup>2</sup> k)-approximation algorithm for the k-vertex connected spanning subgraph problem
Jittat Fakcharoenphol, Bundit Laekhanukit · 2008 · 47 citations
Computing, Computer Science, Algorithms +11
Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses
Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai · 2013 · 45 citations
Computing, Computer Science, Mathematics +17
On the parameterized complexity of approximating dominating set
C. S. Karthik, Bundit Laekhanukit, Pasin Manurangsi · 2018 · 38 citations
Graph products revisited: Tight approximation hardness of induced matching, poset dimension and more
Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai · 2016 · 36 citations
Computing, Computer Science, Mathematics +16
On the Parameterized Complexity of Approximating Dominating Set
C. S. Karthik, Bundit Laekhanukit, Pasin Manurangsi · Journal of the ACM · 2019 · 32 citations · Full text
1–5 of 18