Mohammad Salavatipour
Mohammad Salavatipour
Professor of Computer Science, University of Alberta
Verified email at cs.ualberta.ca - Homepage
TitleCited byYear
Packing steiner trees
K Jain, M Mahdian, MR Salavatipour
Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete …, 2003
2392003
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
1802005
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
1422008
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
1422005
Survivable network design with degree or order constraints
LC Lau, J Naor, MR Salavatipour, M Singh
SIAM Journal on Computing 39 (3), 1062-1087, 2009
1392009
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
862010
Frequency channel assignment on planar networks
M Molloy, MR Salavatipour
European Symposium on Algorithms, 736-747, 2002
802002
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
582019
Minimizing movement in mobile facility location problems
Z Friggstad, MR Salavatipour
ACM Transactions on Algorithms (TALG) 7 (3), 28, 2011
532011
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
532009
Approximation algorithms and hardness results for cycle packing problems
M Krivelevich, Z Nutov, MR Salavatipour, JV Yuster, R Yuster
ACM Transactions on Algorithms (TALG) 3 (4), 48, 2007
522007
On sum coloring of graphs
MR Salavatipour
Discrete Applied Mathematics 127 (3), 477-488, 2003
512003
Primal Dual Gives Almost Optimal Energy-Efficient Online Algorithms
NR Devanur, Z Huang
ACM Transactions on Algorithms (TALG) 14 (1), 5, 2018
482018
Hardness and approximation results for packing Steiner trees
J Cheriyan, MR Salavatipour
Algorithmica 45 (1), 21-43, 2006
462006
The resolution complexity of random constraint satisfaction problems
M Molloy, M Salavatipour
44th Annual IEEE Symposium on Foundations of Computer Science, 2003 …, 2003
39*2003
Selecting dissimilar genes for multi-class classification, an application in cancer subtyping
Z Cai, R Goebel, MR Salavatipour, G Lin
BMC bioinformatics 8 (1), 206, 2007
372007
Approximation algorithms for node-weighted buy-at-bulk network design
C Chekuri, MT Hajiaghayi, G Kortsarz, MR Salavatipour
Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete …, 2007
372007
Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees
MT Hajiaghayi, G Kortsarz, MR Salavatipour
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2006
312006
A polynomial time algorithm for strong edge coloring of partial k-trees
MR Salavatipour
Discrete Applied Mathematics 143 (1-3), 285-291, 2004
312004
Large induced forests in triangle-free planar graphs
MR Salavatipour
Graphs and Combinatorics 22 (1), 113-126, 2006
272006
The system can't perform the operation now. Try again later.
Articles 1–20