Parinya Chalermsook

Citirano

	Sve	Od 2018.
Citati	855	532
H-indeks	16	13
i10-indeks	23	19

120

20082009201020112012201320142015201620172018201920202021202220236 10 10 16 30 28 56 54 51 56 82 98 107 107 115 22

Javni pristup

Prikaži sve

18 članaka

0 članaka

dostupno

nije dostupno

Na temelju uvjeta financiranja

Suautori

Danupon NanongkaiDirector, Max Planck Institute for InformaticsPotvrđena adresa e-pošte na mpi-inf.mpg.de
Bundit LaekhanukitShanghai University of Finance and EconomicsPotvrđena adresa e-pošte na sufe.edu.cn
Thatchaphol SaranurakUniversity of MichiganPotvrđena adresa e-pošte na umich.edu
Julia ChuzhoyToyota Technological Institute at ChicagoPotvrđena adresa e-pošte na ttic.edu
Kurt MehlhornProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics CampusPotvrđena adresa e-pošte na mpi-inf.mpg.de
Mayank GoswamiAssociate Professor, Queens College, City University of New YorkPotvrđena adresa e-pošte na qc.cuny.edu
László KozmaFreie Universität Berlin, Department of Mathematics and Computer SciencePotvrđena adresa e-pošte na cs.uni-saarland.de
Marek CyganUniversity of WarsawPotvrđena adresa e-pošte na mimuw.edu.pl
Guy KortsarzProfessor computer sciencePotvrđena adresa e-pošte na camden.rutgers.edu
Luca TrevisanBocconi UniversityPotvrđena adresa e-pošte na unibocconi.it
Andreas WieseAdjoint ProfessorPotvrđena adresa e-pošte na dii.uchile.cl
Syamantak DasIIIT DelhiPotvrđena adresa e-pošte na iiitd.ac.in
Sanjeev KhannaHenry Salvatori Professor of Computer Science, University of PennsylvaniaPotvrđena adresa e-pošte na cis.upenn.edu
Jittat FakcharoenpholKasetsart UniversityPotvrđena adresa e-pošte na ku.ac.th
Anna AdamaszekPostdoc, University of CopenhagenPotvrđena adresa e-pošte na di.ku.dk
Alina EneBoston UniversityPotvrđena adresa e-pošte na bu.edu
Andreas KarrenbauerSenior Researcher, Max Planck Institute for Informatics, Saarland Informatics Campus, SaarbruckenPotvrđena adresa e-pošte na mpi-inf.mpg.de
Atish Das SarmaStaff Research Scientist, eBay Research LabsPotvrđena adresa e-pošte na ebay.com
Ashwin LallDenison UniversityPotvrđena adresa e-pošte na denison.edu
Pablo Pérez-LanteroAssociate Professor, Universidad de Santiago de Chile (USACH)Potvrđena adresa e-pošte na usach.cl

Prati

Parinya Chalermsook

Aalto University

Potvrđena adresa e-pošte na aalto.fi - Početna stranica

Theoretical Computer Science


Naslov Poredaj po navodima Poredaj po godini Poredaj po naslovu	Citirano Citirano	Godina
Maximum independent set of rectangles P Chalermsook, J Chuzhoy Proceedings of the twentieth annual ACM-SIAM symposium on discrete …, 2009	106	2009
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	100*	2020
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	70	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	64	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	52	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	32	2004
Simple distributed algorithms for approximating minimum steiner trees P Chalermsook, J Fakcharoenphol Computing and Combinatorics: 11th Annual International Conference, COCOON …, 2005	30	2005
Nearly tight approximability results for minimum biclique cover and partition P Chalermsook, S Heydrich, E Holm, A Karrenbauer Algorithms-ESA 2014: 22th Annual European Symposium, Wroclaw, Poland …, 2014	29	2014
Resource minimization for fire containment P Chalermsook, J Chuzhoy Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010	28	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	26	2015
Coloring and maximum independent set of rectangles P Chalermsook Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2011	25	2011
Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing. P Briest, P Chalermsook, S Khanna, B Laekhanukit, D Nanongkai WINE, 444-454, 2010	24	2010
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	22	2015
Coloring and maximum weight independent set of rectangles P Chalermsook, B Walczak Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021	21	2021
Submodular unsplittable flow on trees A Adamaszek, P Chalermsook, A Ene, A Wiese Mathematical Programming 172 (1-2), 565-589, 2018	21	2018
On guillotine cutting sequences F Abed, P Chalermsook, J Correa, A Karrenbauer, P Pérez-Lantero, ... 18th International Workshop on Approximation Algorithms for Combinatorial …, 2015	17	2015
New tools and connections for exponential-time approximation N Bansal, P Chalermsook, B Laekhanukit, D Nanongkai, J Nederlof Algorithmica 81, 3993-4009, 2019	16	2019
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	15*	2021
The landscape of bounds for binary search trees P Chalermsook, M Goswami, L Kozma, K Mehlhorn, T Saranurak arXiv preprint arXiv:1603.04892, 2016	12	2016
Self-adjusting binary search trees: What makes them tick? P Chalermsook, M Goswami, L Kozma, K Mehlhorn, T Saranurak Algorithms-ESA 2015: 23rd Annual European Symposium, Patras, Greece …, 2015	12*	2015

Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.

Članci 1–20

Godišnji broj citata

Dvostruki navodi

Spojeni navodi

Dodavanje suautoraSuautori

Prati

Citirano

Suautori