Get started
Author

Mohammad R. Salavatipour

Observed names: M. R. Salavatipour, M. Salavatipour, M.R. Salavatipour, MOHAMMAD R. SALAVATIPOUR, Mohammad R Salavatipour, Mohammad Salavatipour, Mohammad R. Salavatipour, Salavatipour, Mohammad, Salavatipour, Mohammad R, Salavatipour, Mohammad R.
ORCID: 0000-0002-7650-2045
Observed ORCID: 0000-0002-7650-2045
OpenAlex ID: A5010339836
Packing Steiner trees
2003 · Kamal Jain, Mohammad Mahdian, et al. · 204
A bound on the chromatic number of the square of a planar graph
2005 · Michael Molloy, Mohammad R. Salavatipour · Journal of Combinatorial Theory Series B · 193
PDF
Planar graphs without cycles of length from 4 to 7 are 3-colorable
2004 · O.V. Borodin, A.N. Glebov, et al. · Journal of Combinatorial Theory Series B · 140
PDF
Local Search Yields a PTAS for $k$-Means in Doubling Metrics
2016 · Zachary Friggstad, Mohsen Rezapour, et al. · Annual Symposium on Foundations of Computer Science · 114
PDF
Combination can be hard: approximability of the unique coverage problem
2006 · Erik D. Demaine, Mohammad Taghi Hajiaghayi, et al. · Symposium on Discrete Algorithms · 88
Survivable Network Design with Degree or Order Constraints
2009 · Lap Chi Lau, Joseph (Seffi) Naor, et al. · SIAM Journal on Computing · 73
Combination Can Be Hard: Approximability of the Unique Coverage Problem
2008 · Erik D. Demaine, Uriel Feige, et al. · SIAM Journal on Computing · 66
Survivable network design with degree or order constraints
2007 · Lap Chi Lau, Joseph (Seffi) Naor, et al. · ACM Symposium on Theory of Computing (STOC) · 66
On sum coloring of graphs
2003 · Mohammad R Salavatipour · Discrete Applied Mathematics · 65
Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design
2006 · C. Chekuri, M. T. Hajiaghayi, et al. · Annual Symposium on Foundations of Computer Science · 64
Approximation algorithms and hardness results for cycle packing problems
2007 · Michael Krivelevich, Zeev Nutov, et al. · ACM Transactions on Algorithms · 61
Improved Approximation Algorithms for the Min-max Tree Cover and Bounded Tree Cover Problems
2013 · M. Reza Khani, Mohammad R. Salavatipour · Algorithmica · 55
Selecting dissimilar genes for multi-class classification, an application in cancer subtyping
2007 · Zhipeng Cai, Randy Goebel, et al. · BMC Bioinformatics · 52
PDF
Approximability of Packing Disjoint Cycles
2009 · Zachary Friggstad, Mohammad R. Salavatipour · Algorithmica · 47
Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design
2010 · C. Chekuri, M. T. Hajiaghayi, et al. · SIAM Journal on Computing · 46
Approximation Schemes for Clustering with Outliers
2019 · Zachary Friggstad, Kamyar Khodamoradi, et al. · ACM Transactions on Algorithms · 45
A logarithmic approximation for unsplittable flow on line graphs
2009 · Nikhil Bansal, Zachary Friggstad, et al. · 45
Hardness and approximation results for packing steiner trees
2006 · Joseph Cheriyan, Mohammad R. Salavatipour · Algorithmica · 44
Frequency Channel Assignment on Planar Networks
2002 · Michael Molloy, Mohammad R. Salavatipour · Lecture notes in computer science · 39
Minimizing movement in mobile facility location problems
2011 · Zachary Friggstad, Mohammad R. Salavatipour · ACM Transactions on Algorithms · 38
Combination can be hard
2006 · Erik D. Demaine, Mohammad Taghi Hajiaghayi, et al. · ACM-SIAM Symposium on Discrete Algorithms (SODA) · 38
Approximation algorithms for node-weighted buy-at-bulk network design
2007 · Chandra Chekuri, Mohammad Taghi Hajiaghayi, et al. · Symposium on Discrete Algorithms · 32
A logarithmic approximation for unsplittable flow on line graphs
2009 · Nikhil Bansal, Zachary Friggstad, et al. · ACM-SIAM Symposium on Discrete Algorithms (SODA) · 31
Packing element-disjoint steiner trees
2007 · Joseph Cheriyan, Mohammad R. Salavatipour · ACM Transactions on Algorithms · 29
Using Gene Clustering to Identify Discriminatory Genes with Higher Classification Accuracy
2006 · Zhipeng Cai, Lizhe Xu, et al. · IEEE Symposium on Bioinformatics and Bioengineering (BIBE) · 27
Works count: 134
Citation count: 2,201
H-index: 26
I10-index: 45
Year
Topic
Type