|
| Education |
|---|
- B.Eng (Computer Engineering)
Kasetsart University, Bangkok, Thailand
- M.Eng (Computer Engineering)
Kasetsart University, Bangkok, Thailand
(under supervision of J. Fakcharoenphol)
M.Eng Thesis:
Faster algorithms for optimal semi-matching problems.
(originally written in Thai, conference version
in ICALP 2010).
- M.Math (Combinatorics and Optimization)
University of Waterloo, Waterloo ON, Canada
(under supervision of J. Cheriyan)
M.Math Thesis:
Approximation algorithms for (S,T)-connectivity problems.
|
|
| Publications |
|---|
-
Coloring Graph Powers:
Graph Product Bounds and Hardness of Approximation
P. Chalermsook, B. Laekhanukit and D. Nanongkai
Manuscript (last update Feb 24, 2013)
-
Parameters of
Two-Prover-One-Round Game and The Hardness of Connectivity
Problems
Manuscript (last update Dec 10, 2012)
-
Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension, and More,
P. Chalermsook, B. Laekhanukit and D. Nanongkai
SODA 2013 (To appear)
-
Non-Redistributive Second Welfare Theorems,
B. Laekhanukit, G. Naves and A. Vetta
WINE 2012 (To appear)
-
Routing Regardless of Network Stability,
B. Laekhanukit, A. Vetta and G. Wilfong
ESA 2012. (Invited to the Algorithmica Special Issue for ESA 2012)
(full version)
-
A rounding by sampling approach to the minimum size k-arc
connected subgraph problem,
B. Laekhanukit, S. Oveis Gharan and M. Singh
ICALP 2012.
-
Approximating rooted Steiner networks,
J. Cheriyan, B. Laekhanukit, G. Naves and A. Vetta
SODA 2012.
-
An improved approximation algorithm for minimum-cost subset
k-connectivity,
B. Laekhanukit,
ICALP 2011.
-
Approximation algorithms for minimum cost k-(S,T) connected
digraphs,
J. Cheriyan and B. Laekhanukit,
submitted.
(preliminary version in
M.Math Thesis)
-
A bad example for the iterative rounding method for mincost
k-connected spanning subgraphs,
A. Aazami, J. Cheriyan and B. Laekhanukit,
Discrete Optimization 10-1 (2013), pp. 25-41
-
Improved hardness of approximation for Stackelberg shortest-path
pricing,
P. Briest, P. Chalermsook, S.Khanna, B. Laekhanukit
and D. Nanongkai,
WINE 2010 (short paper).
(Preliminary versions in
[arXiv]
and
[arXiv])
-
Faster algorithms for semi-matching problems,
J. Fakcharoenphol, B. Laekhanukit and D. Nanongkai,
ICALP 2010 / To appear in ACM Trans. Algorithms
(Preliminary versions in
[arXiv])
-
An O(log2 k)-approximation algorithm for the k-vertex
connected spanning subgraph problem,
J. Fakcharoenphol and B. Laekhanukit,
STOC 2008 / SIAM J. Comput. 41-5 (2012), pp. 1095-1109
| Publications in National Conference in Thailand |
|---|
|
|
|
|
|
