Parinya Chalermsook

Citada per

	Totes	Des de 2020
Citacions	1124	595
Índex h	18	13
Índex i10	32	21

160

120

2008200920102011201220132014201520162017201820192020202120222023202420256 10 10 17 31 29 56 56 53 56 94 105 97 99 112 115 144 27

Accés públic

Mostra-ho tot

22 articles

0 articles

disponibles

no disponibles

Es basa en els requisits de les agències que proporcionen el finançament

Coautors

Danupon NanongkaiDirector, Max Planck Institute for InformaticsCorreu electrònic verificat a mpi-inf.mpg.de
Bundit LaekhanukitIndepent ReseacherCorreu electrònic verificat a mail.mcgill.ca
Julia ChuzhoyToyota Technological Institute at ChicagoCorreu electrònic verificat a ttic.edu
Thatchaphol SaranurakUniversity of MichiganCorreu electrònic verificat a umich.edu
Kurt MehlhornProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics CampusCorreu electrònic verificat a mpi-inf.mpg.de
Daniel VazLIGM-ADA and ESIEE ParisCorreu electrònic verificat a esiee.fr
Mayank GoswamiAssociate Professor, Queens College, City University of New YorkCorreu electrònic verificat a qc.cuny.edu
László KozmaFreie Universität Berlin, Department of Mathematics and Computer ScienceCorreu electrònic verificat a cs.uni-saarland.de
Marek CyganUniversity of WarsawCorreu electrònic verificat a mimuw.edu.pl
Guy KortsarzProfessor computer scienceCorreu electrònic verificat a camden.rutgers.edu
Luca TrevisanBocconi UniversityCorreu electrònic verificat a unibocconi.it
Pasin ManurangsiGoogle ResearchCorreu electrònic verificat a google.com
Joachim SpoerhaseDepartment of Computer Science, University of Liverpool, UKCorreu electrònic verificat a liverpool.ac.uk
Andreas WieseAdjoint ProfessorCorreu electrònic verificat a dii.uchile.cl
Syamantak DasIIIT DelhiCorreu electrònic verificat a iiitd.ac.in
Sanjeev KhannaHenry Salvatori Professor of Computer Science, University of PennsylvaniaCorreu electrònic verificat a cis.upenn.edu
Wanchote Po JiamjitrakPostdoctoral Researcher, University of HelsinkiCorreu electrònic verificat a helsinki.fi
Jittat FakcharoenpholKasetsart UniversityCorreu electrònic verificat a ku.ac.th
Andreas KarrenbauerSenior Researcher, Max Planck Institute for Informatics, Saarland Informatics Campus, SaarbruckenCorreu electrònic verificat a mpi-inf.mpg.de
Sampath KannanProfessor, Computer and Information Science, University of PennsylvaniaCorreu electrònic verificat a seas.upenn.edu

Segueix

Parinya Chalermsook

The University of Sheffield

Correu electrònic verificat a sheffield.ac.uk - Pàgina d'inici

Theoretical Computer Science


Títol Ordena per cites Ordena per any Ordena per títol	Citada per Citada per	Any
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	138*	2020
Maximum independent set of rectangles P Chalermsook, J Chuzhoy Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009	125	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	56	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	44	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	40	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	37	2004
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	31*	2021
Simple distributed algorithms for approximating minimum steiner trees P Chalermsook, J Fakcharoenphol Computing and Combinatorics: 11th Annual International Conference, COCOON …, 2005	30	2005
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
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	25	2015
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
Submodular unsplittable flow on trees A Adamaszek, P Chalermsook, A Ene, A Wiese Mathematical Programming 172 (1), 565-589, 2018	22	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	19	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	17	2016
On guillotine cutting sequences F Abed, P Chalermsook, J Correa, A Karrenbauer, P Pérez-Lantero, ...	17	2015

En aquests moments el sistema no pot dur a terme l'operació. Torneu-ho a provar més tard.

Articles 1–20

Cites per any

Cites duplicades

Cites combinades

Addició de coautorsCoautors

Segueix

Citada per

Coautors