☰

Parinya Chalermsook, Ph.D. - Publications

Affiliations: 
2012 Computer Science University of Chicago, Chicago, IL 
Area:
Computer Science
Tree Info Similar researchers PubMed Report error

20 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2020 Chalermsook P, Cygan M, Kortsarz G, Laekhanukit B, Manurangsi P, Nanongkai D, Trevisan L. From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More Siam Journal On Computing. 49: 772-810. DOI: 10.1137/18M1166869  0.378
2019 Bansal N, Chalermsook P, Laekhanukit B, Nanongkai D, Nederlof J. New Tools and Connections for Exponential-Time Approximation. Algorithmica. 81: 3993-4009. PMID 31496549 DOI: 10.1007/S00453-018-0512-8  0.455
2016 Chalermsook P, Vaz D. A Note on Fractional Coloring and the Integrality gap of LP for Maximum Weight Independent Set Electronic Notes in Discrete Mathematics. 55: 113-116. DOI: 10.1016/J.Endm.2016.10.029  0.329
2016 Adamaszek A, Chalermsook P, Ene A, Wiese A. 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. DOI: 10.1007/S10107-017-1218-4  0.359
2015 Adamaszek A, Chalermsook P, Wiese A. How to tame rectangles: Solving independent set and coloring of rectangles via shrinking Leibniz International Proceedings in Informatics, Lipics. 40: 43-60. DOI: 10.4230/LIPIcs.APPROX-RANDOM.2015.43  0.424
2015 Abed F, Chalermsook P, Correa J, Karrenbauer A, Pérez-Lantero P, Soto JA, Wiese A. On guillotine cutting sequences Leibniz International Proceedings in Informatics, Lipics. 40: 1-19. DOI: 10.4230/LIPIcs.APPROX-RANDOM.2015.1  0.369
2015 Chalermsook P, Imai H, Suppakitpaisarn V. Two lower bounds for shortest double-base number system Ieice Transactions On Fundamentals of Electronics, Communications and Computer Sciences. 1310-1312. DOI: 10.1587/Transfun.E98.A.1310  0.323
2015 Chalermsook P, Goswami M, Kozma L, Mehlhorn K, Saranurak T. 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. DOI: 10.1007/978-3-662-48350-3_26  0.415
2015 Chalermsook P, Goswami M, Kozma L, Mehlhorn K, Saranurak T. 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. DOI: 10.1007/978-3-319-21840-3_13  0.416
2014 Chalermsook P, Laekhanukit B, Nanongkai D. 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. DOI: 10.1109/FOCS.2014.54  0.433
2014 Chalermsook P, Heydrich S, Holm E, Karrenbauer A. Nearly tight approximability results for minimum biclique cover and partition Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8737: 235-246. DOI: 10.1007/978-3-662-44777-2_20  0.479
2014 Bhattacharya S, Chalermsook P, Mehlhorn K, Neumann A. New approximability results for the robust k-median problem Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8503: 50-61. DOI: 10.1007/978-3-319-08404-6_5  0.361
2013 Chalermsook P, Laekhanukit B, Nanongkai D. Independent set, induced matching, and pricing: Connections and tight (subexponential time) approximation hardnesses Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 370-379. DOI: 10.1109/FOCS.2013.47  0.502
2012 Chalermsook P, Chuzhoy J, Ene A, Li S. Approximation algorithms and hardness of integral concurrent flow Proceedings of the Annual Acm Symposium On Theory of Computing. 689-708. DOI: 10.1145/2213977.2214040  0.376
2012 Chalermsook P, Chuzhoy J, Kannan S, Khanna S. Improved hardness results for profit maximization pricing problems with unlimited supply Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7408: 73-84. DOI: 10.1007/978-3-642-32512-0_7  0.311
2011 Chalermsook P. Coloring and maximum independent set of rectangles Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6845: 123-134. DOI: 10.1007/978-3-642-22935-0_11  0.441
2010 Chalermsook P, Chuzhoy J. Resource minimization for fire containment Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 1334-1349.  0.446
2009 Chalermsook P, Chuzhoy J. Maximum independent set of rectangles Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 892-901.  0.479
2005 Chalermsook P, Fakcharoenphol J. Simple distributed algorithms for approximating minimum steiner trees Lecture Notes in Computer Science. 3595: 380-389.  0.39
2004 Chalermsook P, Fakcharoenphol J, Nanongkai D. A deterministic near-linear time algorithm for finding minimum cuts in planar graphs Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 15: 821-822.  0.462
Show low-probability matches.