Parinya Chalermsook

Cited by

	All	Since 2016
Citations	652	442
h-index	13	11
i10-index	16	15

120

200820092010201120122013201420152016201720182019202020215 10 12 14 29 25 54 53 52 59 80 100 119 32

Public access

View all

21 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Danupon NanongkaiAssociate Professor, KTH Royal Institute of Technology, Stockholm, SwedenVerified email at kth.se
Bundit LaekhanukitShanghai University of Finance and EconomicsVerified email at sufe.edu.cn
Julia ChuzhoyToyota Technological Institute at ChicagoVerified email at ttic.edu
Kurt MehlhornProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics CampusVerified email at mpi-inf.mpg.de
Thatchaphol SaranurakUniversity of MichiganVerified email at umich.edu
Mayank GoswamiAssociate Professor, Queens College, City University of New YorkVerified email at qc.cuny.edu
László KozmaFreie Universität Berlin, Department of Mathematics and Computer ScienceVerified email at cs.uni-saarland.de
Andreas WieseAdjoint ProfessorVerified email at dii.uchile.cl
Marek CyganUniversity of WarsawVerified email at mimuw.edu.pl
Guy KortsarzProfessor computer scienceVerified email at camden.rutgers.edu
Luca TrevisanBocconi UniversityVerified email at unibocconi.it
Sanjeev KhannaHenry Salvatori Professor of Computer Science, University of PennsylvaniaVerified email at cis.upenn.edu
Jittat FakcharoenpholKasetsart UniversityVerified email at ku.ac.th
Anna AdamaszekPostdoc, University of CopenhagenVerified email at di.ku.dk
Alina EneBoston UniversityVerified email at bu.edu
Andreas KarrenbauerSenior Researcher, Max Planck Institute for Informatics, Saarland Informatics Campus, SaarbruckenVerified email at mpi-inf.mpg.de
Sampath KannanVerified email at cis.upenn.edu
Atish Das SarmaStaff Research Scientist, eBay Research LabsVerified email at ebay.com
Ashwin LallDenison UniversityVerified email at denison.edu
Syamantak DasIIIT DelhiVerified email at iiitd.ac.in

Parinya Chalermsook

Aalto University

Verified email at aalto.fi - Homepage

Theoretical Computer Science


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Maximum independent set of rectangles P Chalermsook, J Chuzhoy Proceedings of the twentieth annual ACM-SIAM symposium on discrete …, 2009	99	2009
From gap-eth to fpt-inapproximability: Clique, dominating set, and more P Chalermsook, M Cygan, G Kortsarz, B Laekhanukit, P Manurangsi, ... 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017	71	2017
Independent set, induced matching, and pricing: Connections and tight (subexponential time) approximation hardnesses P Chalermsook, B Laekhanukit, D Nanongkai 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 370-379, 2013	58	2013
Graph products revisited: Tight approximation hardness of induced matching, poset dimension and more P Chalermsook, B Laekhanukit, D Nanongkai Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013	55	2013
Improved hardness results for profit maximization pricing problems with unlimited supply P Chalermsook, J Chuzhoy, S Kannan, S Khanna Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2012	47	2012
A deterministic near-linear time algorithm for finding minimum cuts in planar graphs. P Chalermsook, J Fakcharoenphol, D Nanongkai SODA 4, 828-829, 2004	33	2004
Simple distributed algorithms for approximating minimum steiner trees P Chalermsook, J Fakcharoenphol International Computing and Combinatorics Conference, 380-389, 2005	27	2005
Resource minimization for fire containment P Chalermsook, J Chuzhoy Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010	23	2010
Pattern-avoiding access in binary search trees P Chalermsook, M Goswami, L Kozma, K Mehlhorn, T Saranurak 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 410-423, 2015	22	2015
Improved hardness of approximation for Stackelberg shortest-path pricing P Briest, P Chalermsook, S Khanna, B Laekhanukit, D Nanongkai International Workshop on Internet and Network Economics, 444-454, 2010	22	2010
Coloring and maximum independent set of rectangles P Chalermsook Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2011	21	2011
Social network monetization via sponsored viral marketing P Chalermsook, A Das Sarma, A Lall, D Nanongkai ACM SIGMETRICS Performance Evaluation Review 43 (1), 259-270, 2015	19	2015
Nearly tight approximability results for minimum biclique cover and partition P Chalermsook, S Heydrich, E Holm, A Karrenbauer European Symposium on Algorithms, 235-246, 2014	19	2014
Self-adjusting binary search trees: What makes them tick? P Chalermsook, M Goswami, L Kozma, K Mehlhorn, T Saranurak Algorithms-ESA 2015, 300-312, 2015	12*	2015
Submodular unsplittable flow on trees A Adamaszek, P Chalermsook, A Ene, A Wiese Mathematical Programming 172 (1), 565-589, 2018	11	2018
The landscape of bounds for binary search trees P Chalermsook, M Goswami, L Kozma, K Mehlhorn, T Saranurak arXiv preprint arXiv:1603.04892, 2016	10	2016
On survivable set connectivity P Chalermsook, F Grandoni, B Laekhanukit Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete …, 2014	8	2014
New tools and connections for exponential-time approximation N Bansal, P Chalermsook, B Laekhanukit, D Nanongkai, J Nederlof Algorithmica 81 (10), 3993-4009, 2019	7	2019
New integrality gap results for the firefighters problem on trees P Chalermsook, D Vaz International Workshop on Approximation and Online Algorithms, 65-77, 2016	7	2016
How to tame rectangles: solving independent set and coloring of rectangles via shrinking A Adamaszek, P Chalermsook, A Wiese Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2015	7	2015

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Upload PDF

Follow this author

Cited by

Co-authors