Parinya Chalermsook

Cited by

	All	Since 2019
Citations	1075	653
h-index	18	13
i10-index	31	23

140

105

200820092010201120122013201420152016201720182019202020212022202320246 10 10 17 31 29 56 56 53 56 93 105 97 100 110 117 122

Public access

View all

22 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Danupon NanongkaiDirector, Max Planck Institute for InformaticsVerified email at mpi-inf.mpg.de
Bundit LaekhanukitIndepent ReseacherVerified email at mail.mcgill.ca
Thatchaphol SaranurakUniversity of MichiganVerified email at umich.edu
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
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
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
Andreas WieseAdjoint ProfessorVerified email at dii.uchile.cl
Syamantak DasIIIT DelhiVerified email at iiitd.ac.in
Sanjeev KhannaHenry Salvatori Professor of Computer Science, University of PennsylvaniaVerified email at cis.upenn.edu
Jittat FakcharoenpholKasetsart UniversityVerified email at ku.ac.th
Andreas KarrenbauerSenior Researcher, Max Planck Institute for Informatics, Saarland Informatics Campus, SaarbruckenVerified email at mpi-inf.mpg.de
Anna AdamaszekPostdoc, University of CopenhagenVerified email at di.ku.dk
Alina EneBoston UniversityVerified email at bu.edu
Jesper NederlofUtrecht UniversityVerified email at uu.nl
Atish Das SarmaStaff Research Scientist, eBay Research LabsVerified email at ebay.com
Ashwin LallDenison UniversityVerified email at denison.edu

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
From gap-exponential time hypothesis to fixed parameter tractable inapproximability: Clique, dominating set, and more P Chalermsook, M Cygan, G Kortsarz, B Laekhanukit, P Manurangsi, ... SIAM Journal on Computing 49 (4), 772-810, 2020	132*	2020
Maximum independent set of rectangles P Chalermsook, J Chuzhoy Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009	119	2009
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	74	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	67	2013
Improved hardness results for profit maximization pricing problems with unlimited supply P Chalermsook, J Chuzhoy, S Kannan, S Khanna International Workshop on Approximation Algorithms for Combinatorial …, 2012	54	2012
Coloring and maximum weight independent set of rectangles P Chalermsook, B Walczak Proceedings of the 2021 ACM-SIAM symposium on discrete algorithms (SODA …, 2021	39	2021
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	39	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	39	2014
A deterministic near-linear time algorithm for finding minimum cuts in planar graphs. P Chalermsook, J Fakcharoenphol, D Nanongkai SODA 4, 828-829, 2004	35	2004
Simple distributed algorithms for approximating minimum steiner trees P Chalermsook, J Fakcharoenphol Computing and Combinatorics: 11th Annual International Conference, COCOON …, 2005	30	2005
Vertex sparsification for edge connectivity P Chalermsook, S Das, Y Kook, B Laekhanukit, YP Liu, R Peng, M Sellke, ... Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021	29*	2021
Resource minimization for fire containment P Chalermsook, J Chuzhoy Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010	29	2010
Improved hardness of approximation for Stackelberg shortest-path pricing P Briest, P Chalermsook, S Khanna, B Laekhanukit, D Nanongkai Internet and Network Economics: 6th International Workshop, WINE 2010 …, 2010	28	2010
Coloring and maximum independent set of rectangles P Chalermsook International Workshop on Approximation Algorithms for Combinatorial …, 2011	27	2011
New tools and connections for exponential-time approximation N Bansal, P Chalermsook, B Laekhanukit, D Nanongkai, J Nederlof Algorithmica 81, 3993-4009, 2019	24	2019
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	24	2015
Submodular unsplittable flow on trees A Adamaszek, P Chalermsook, A Ene, A Wiese Mathematical Programming 172 (1), 565-589, 2018	20	2018
Greedy is an almost optimal deque P Chalermsook, M Goswami, L Kozma, K Mehlhorn, T Saranurak Algorithms and Data Structures: 14th International Symposium, WADS 2015 …, 2015	18	2015
On guillotine cutting sequences F Abed, P Chalermsook, J Correa, A Karrenbauer, P Pérez-Lantero, ...	17	2015
The landscape of bounds for binary search trees P Chalermsook, M Goswami, L Kozma, K Mehlhorn, T Saranurak arXiv preprint arXiv:1603.04892, 2016	16	2016

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

Follow

Cited by

Co-authors