Parinya Chalermsook, Ph.D.
Affiliations: | 2012 | Computer Science | University of Chicago, Chicago, IL |
Area:
Computer ScienceGoogle:
"Parinya Chalermsook"Parents
Sign in to add mentor| Janos Simon | grad student | 2012 | Chicago | |
| (Approximation algorithms for integral concurrent flow, independent set of rectangles, and fire containment problems.) | ||||
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Chalermsook P, Cygan M, Kortsarz G, et al. (2020) From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More Siam Journal On Computing. 49: 772-810 |
| Bansal N, Chalermsook P, Laekhanukit B, et al. (2019) New Tools and Connections for Exponential-Time Approximation. Algorithmica. 81: 3993-4009 |
| Chalermsook P, Vaz D. (2016) A Note on Fractional Coloring and the Integrality gap of LP for Maximum Weight Independent Set Electronic Notes in Discrete Mathematics. 55: 113-116 |
| Adamaszek A, Chalermsook P, Ene A, et al. (2016) Submodular unsplittable flow on trees Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9682: 337-349 |
| Adamaszek A, Chalermsook P, Wiese A. (2015) How to tame rectangles: Solving independent set and coloring of rectangles via shrinking Leibniz International Proceedings in Informatics, Lipics. 40: 43-60 |
| Abed F, Chalermsook P, Correa J, et al. (2015) On guillotine cutting sequences Leibniz International Proceedings in Informatics, Lipics. 40: 1-19 |
| Chalermsook P, Imai H, Suppakitpaisarn V. (2015) Two lower bounds for shortest double-base number system Ieice Transactions On Fundamentals of Electronics, Communications and Computer Sciences. 1310-1312 |
| Chalermsook P, Goswami M, Kozma L, et al. (2015) Self-adjusting binary search trees: What makes them tick? Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9294: 300-312 |
| Chalermsook P, Goswami M, Kozma L, et al. (2015) Greedy is an almost optimal deque Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9214: 152-165 |
| Chalermsook P, Laekhanukit B, Nanongkai D. (2014) Pre-reduction graph products: Hardnesses of properly learning DFAs and approximating EDP on DAGs Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 444-453 |