Mohammad Salavatipour

Citata da

	Tutte	Dal 2019
Citazioni	2739	833
Indice H	27	16
i10-index	48	28

200

100

150

200320042005200620072008200920102011201220132014201520162017201820192020202120222023202415 37 51 69 126 142 162 131 190 137 125 113 123 123 135 141 131 147 137 148 137 132

Accesso pubblico

Visualizza tutto

14 articoli

1 articolo

Disponibili

Non disponibili

In base ai mandati di finanziamento

Coautori

MohammadTaghi HajiaghayiACM Fellow, Jack and Rita Minker Professor of Computer Science, University of Maryland, College ParkEmail verificata su cs.umd.edu
Guy KortsarzProfessor computer scienceEmail verificata su camden.rutgers.edu
Michael MolloyUniversity of TorontoEmail verificata su cs.toronto.edu
Mohammad MahdianResearch Scientist, GoogleEmail verificata su alum.mit.edu
Chandra ChekuriProfessor of Computer Science, University of Illinois, Urbana-ChampaignEmail verificata su illinois.edu
Zhipeng CaiProfessor, IEEE Fellow, Department of Computer Science, Georgia State UniversityEmail verificata su cs.gsu.edu
Randy GoebelProfessor of Computing Science, University of AlbertaEmail verificata su ualberta.ca
Guohui LinComputing Science, University of AlbertaEmail verificata su ualberta.ca
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyEmail verificata su mit.edu
Mohammad Reza KhaniUniversity of MarylandEmail verificata su mail.umd.edu
Nikhil BansalUniversity of MichiganEmail verificata su umich.edu
André RaspaudProfessor emeritus, LaBRI, Bordeaux University, FranceEmail verificata su labri.fr
oleg borodinEmail verificata su math.nsc.ru
Mohit SinghProfessor, Georgia Institute of TechnologyEmail verificata su gatech.edu
Joseph Seffi NaorTechnionEmail verificata su cs.technion.ac.il
Lap Chi LauUniversity of WaterlooEmail verificata su cs.uwaterloo.ca
Raphael YusterUniversity of HaifaEmail verificata su math.haifa.ac.il
Michael KrivelevichProfessor of Mathematics, Tel Aviv UniversityEmail verificata su post.tau.ac.il
Vahab MirrokniGoogle Fellow, VP, Google ResearchEmail verificata su google.com
Mohammad Ali SafariSharif University of TechnologyEmail verificata su sharif.edu

Segui

Mohammad Salavatipour

Professor of Computer Science, University of Alberta

Email verificata su cs.ualberta.ca - Home page

Theoretical Computer Science Approximation Algorithms


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
Packing steiner trees K Jain, M Mahdian, MR Salavatipour SODA 3, 266-274, 2003	275	2003
A bound on the chromatic number of the square of a planar graph M Molloy, MR Salavatipour Journal of Combinatorial Theory, Series B 94 (2), 189-213, 2005	256	2005
Planar graphs without cycles of length from 4 to 7 are 3-colorable OV Borodin, AN Glebov, A Raspaud, MR Salavatipour Journal of Combinatorial Theory, Series B 93 (2), 303-311, 2005	181	2005
Combination can be hard: Approximability of the unique coverage problem ED Demaine, U Feige, MT Hajiaghayi, MR Salavatipour SIAM Journal on Computing 38 (4), 1464-1483, 2008	173	2008
Survivable network design with degree or order constraints LC Lau, J Naor, MR Salavatipour, M Singh Proceedings of the thirty-ninth annual ACM symposium on theory of computing …, 2007	159	2007
Local Search Yields a PTAS for -Means in Doubling Metrics Z Friggstad, M Rezapour, MR Salavatipour SIAM Journal on Computing 48 (2), 452-480, 2019	149	2019
Approximation algorithms for nonuniform buy-at-bulk network design C Chekuri, MT Hajiaghayi, G Kortsarz, MR Salavatipour SIAM Journal on Computing 39 (5), 1772-1798, 2010	105	2010
Approximation algorithms and hardness results for cycle packing problems M Krivelevich, Z Nutov, MR Salavatipour, J Verstraete, R Yuster ACM Transactions on Algorithms (TALG) 3 (4), 48-es, 2007	90	2007
Frequency channel assignment on planar networks M Molloy, MR Salavatipour Algorithms—ESA 2002: 10th Annual European Symposium Rome, Italy, September …, 2002	83	2002
Minimizing movement in mobile facility location problems Z Friggstad, MR Salavatipour ACM Transactions on Algorithms (TALG) 7 (3), 1-22, 2011	80	2011
A logarithmic approximation for unsplittable flow on line graphs N Bansal, Z Friggstad, R Khandekar, MR Salavatipour Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete …, 2009	68	2009
Improved approximation algorithms for the min-max tree cover and bounded tree cover problems MR Khani, MR Salavatipour Algorithmica 69 (2), 443-460, 2014	64	2014
Hardness and approximation results for packing Steiner trees J Cheriyan, MR Salavatipour Algorithmica 45, 21-43, 2006	61	2006
On sum coloring of graphs MR Salavatipour Discrete Applied Mathematics 127 (3), 477-488, 2003	59	2003
Approximation schemes for clustering with outliers Z Friggstad, K Khodamoradi, M Rezapour, MR Salavatipour ACM Transactions on Algorithms (TALG) 15 (2), 1-26, 2019	57	2019
Selecting dissimilar genes for multi-class classification, an application in cancer subtyping Z Cai, R Goebel, MR Salavatipour, G Lin BMC bioinformatics 8, 1-15, 2007	55	2007
The resolution complexity of random constraint satisfaction problems M Molloy, MR Salavatipour SIAM Journal on Computing 37 (3), 895-922, 2007	43	2007
Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees MT Hajiaghayi, G Kortsarz, MR Salavatipour Algorithmica 53, 89-103, 2009	42	2009
Approximation algorithms for node-weighted buy-at-bulk network design C Chekuri, MT Hajiaghayi, G Kortsarz, MR Salavatipour SODA 7, 1265-1274, 2007	40	2007
About computing science research methodology JN Amaral, M Buro, R Elio, J Hoover, I Nikolaidis, M Salavatipour, ... webdocs. cs. ualberta. ca/~ c603/readings/research-methods. pdf, 2011	39	2011

Il sistema al momento non può eseguire l'operazione. Riprova più tardi.

Articoli 1–20

Citazioni per anno

Citazioni duplicate

Citazioni unite

Aggiungi coautoriCoautori

Segui

Citata da

Coautori