Follow
Mohammad Salavatipour
Mohammad Salavatipour
Professor of Computer Science, University of Alberta
Verified email at cs.ualberta.ca - Homepage
Title
Cited by
Cited by
Year
Packing steiner trees
K Jain, M Mahdian, MR Salavatipour
SODA 3, 266-274, 2003
2652003
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
2502005
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
1772005
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
1702008
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
1572007
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
1332019
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
992010
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
842007
Frequency channel assignment on planar networks
M Molloy, MR Salavatipour
Algorithms—ESA 2002: 10th Annual European Symposium Rome, Italy, September …, 2002
822002
Minimizing movement in mobile facility location problems
Z Friggstad, MR Salavatipour
ACM Transactions on Algorithms (TALG) 7 (3), 1-22, 2011
772011
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
672009
Hardness and approximation results for packing Steiner trees
J Cheriyan, MR Salavatipour
Algorithmica 45, 21-43, 2006
622006
On sum coloring of graphs
MR Salavatipour
Discrete Applied Mathematics 127 (3), 477-488, 2003
602003
Improved approximation algorithms for the min-max tree cover and bounded tree cover problems
MR Khani, MR Salavatipour
Algorithmica 69 (2), 443-460, 2014
572014
Selecting dissimilar genes for multi-class classification, an application in cancer subtyping
Z Cai, R Goebel, MR Salavatipour, G Lin
BMC bioinformatics 8 (1), 1-15, 2007
532007
Approximation schemes for clustering with outliers
Z Friggstad, K Khodamoradi, M Rezapour, MR Salavatipour
ACM Transactions on Algorithms (TALG) 15 (2), 1-26, 2019
452019
The resolution complexity of random constraint satisfaction problems
M Molloy, MR Salavatipour
SIAM Journal on Computing 37 (3), 895-922, 2007
432007
Approximation algorithms for node-weighted buy-at-bulk network design
C Chekuri, MT Hajiaghayi, G Kortsarz, MR Salavatipour
SODA 7, 1265-1274, 2007
382007
Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees
MT Hajiaghayi, G Kortsarz, MR Salavatipour
International Workshop on Approximation Algorithms for Combinatorial …, 2006
382006
Two-stage robust network design with exponential scenarios
R Khandekar, G Kortsarz, V Mirrokni, MR Salavatipour
Algorithmica 65, 391-408, 2013
362013
The system can't perform the operation now. Try again later.
Articles 1–20