Mohammad Salavatipour 个人学术档案

引用次数

	总计	2019 年至今
引用	2705	804
h 指数	26	16
i10 指数	47	27

200

100

150

200320042005200620072008200920102011201220132014201520162017201820192020202120222023202415 37 51 69 126 142 162 131 189 137 123 113 123 124 135 142 129 147 137 149 139 102

开放获取的出版物数量

查看全部

15 篇文章

1 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

MohammadTaghi HajiaghayiACM Fellow, Jack and Rita Minker Professor of Computer Science, University of Maryland, College Park在 cs.umd.edu 的电子邮件经过验证
Guy KortsarzProfessor computer science在 camden.rutgers.edu 的电子邮件经过验证
Michael MolloyUniversity of Toronto在 cs.toronto.edu 的电子邮件经过验证
Mohammad MahdianResearch Scientist, Google在 alum.mit.edu 的电子邮件经过验证
Chandra ChekuriProfessor of Computer Science, University of Illinois, Urbana-Champaign在 illinois.edu 的电子邮件经过验证
Zhipeng CaiProfessor, IEEE Fellow, Department of Computer Science, Georgia State University在 cs.gsu.edu 的电子邮件经过验证
Randy GoebelProfessor of Computing Science, University of Alberta在 ualberta.ca 的电子邮件经过验证
Guohui LinComputing Science, University of Alberta在 ualberta.ca 的电子邮件经过验证
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of Technology在 mit.edu 的电子邮件经过验证
Mohammad Reza KhaniUniversity of Maryland在 mail.umd.edu 的电子邮件经过验证
Nikhil BansalUniversity of Michigan在 umich.edu 的电子邮件经过验证
André RaspaudProfessor emeritus, LaBRI, Bordeaux University, France在 labri.fr 的电子邮件经过验证
oleg borodin在 math.nsc.ru 的电子邮件经过验证
Mohit SinghProfessor, Georgia Institute of Technology在 gatech.edu 的电子邮件经过验证
Joseph Seffi NaorTechnion在 cs.technion.ac.il 的电子邮件经过验证
Lap Chi LauUniversity of Waterloo在 cs.uwaterloo.ca 的电子邮件经过验证
Raphael YusterUniversity of Haifa在 math.haifa.ac.il 的电子邮件经过验证
Michael KrivelevichProfessor of Mathematics, Tel Aviv University在 post.tau.ac.il 的电子邮件经过验证
Vahab MirrokniGoogle Fellow, VP, Google Research在 google.com 的电子邮件经过验证
Mohammad Ali SafariSharif University of Technology在 sharif.edu 的电子邮件经过验证

关注

Mohammad Salavatipour

Professor of Computer Science, University of Alberta

在 cs.ualberta.ca 的电子邮件经过验证 - 首页

Theoretical Computer Science Approximation Algorithms


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
Packing steiner trees K Jain, M Mahdian, MR Salavatipour SODA 3, 266-274, 2003	274	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	253	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	180	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	171	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	158	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	145	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	103	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	62	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	40	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	38	2011

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用