Bundit Laekhanukit

ACM Trans. Algorithms, no. 3 (2020): 1-31

SIAM J. Comput., no. 4 (2020): 772-810

APPROX/RANDOM, (2020)

symposium on discrete algorithms, (2020)

STOC, (2019)

STOC '18: Symposium on Theory of Computing Los Angeles CA USA June, 20..., no. 5 (2019): 1-38

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, pp.253-264, (2019)

Algorithmica, no. 10 (2018): 3993-4009

international workshop and international workshop on approximation, randomization, and combinatorial..., (2018)

STOC'18: PROCEEDINGS OF THE 50TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, pp.1283-1296, (2018)

Symposium on Computational Geometry, pp.28:1-28:15, (2018)

arXiv: Data Structures and Algorithms, (2018)

arXiv: Data Structures and Algorithms, (2017)

SODA '17: Symposium on Discrete Algorithms Barcelona Spain January, 2017, pp.737-751, (2017)

SODA '17: Symposium on Discrete Algorithms Barcelona Spain January, 2017, (2017): 534-553

STOC, pp.420-428, (2017)

2017 IEEE 58TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), (2017): 743-754