Mohammad R. Salavatipour

	2009
37		Nikhil Bansal, Zachary Friggstad, Rohit Khandekar, Mohammad R. Salavatipour: A logarithmic approximation for unsplittable flow on line graphs. SODA 2009: 702-709
36		Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour: Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees. Algorithmica 53(1): 89-103 (2009)
35		Imran A. Pirwani, Mohammad R. Salavatipour: A PTAS for Minimum Clique Partition in Unit Disk Graphs CoRR abs/0904.2203: (2009)
34		Zachary Friggstad, Mohammad R. Salavatipour, Zoya Svitkina: Asymmetric Traveling Salesman Path and Directed Latency Problems CoRR abs/0907.0726: (2009)
	2008
33		MohammadAli Safari, Mohammad R. Salavatipour: A Constant Factor Approximation for Minimum lambda-Edge-Connected k-Subgraph with Metric Costs. APPROX-RANDOM 2008: 233-246
32		Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, Mohammad R. Salavatipour: Two-Stage Robust Network Design with Exponential Scenarios. ESA 2008: 589-600
31		Zachary Friggstad, Mohammad R. Salavatipour: Minimizing Movement in Mobile Facility Location Problems. FOCS 2008: 357-366
30		Erik D. Demaine, Uriel Feige, MohammadTaghi Hajiaghayi, Mohammad R. Salavatipour: Combination Can Be Hard: Approximability of the Unique Coverage Problem. SIAM J. Comput. 38(4): 1464-1483 (2008)
	2007
29		Zhipeng Cai, Randy Goebel, Mohammad R. Salavatipour, Yi Shi, Lizhe Xu, Guohui Lin: Selecting Genes with Dissimilar Discrimination Strength for Sample Class Prediction. APBC 2007: 81-90
28		Zachary Friggstad, Mohammad R. Salavatipour: Approximability of Packing Disjoint Cycles. ISAAC 2007: 304-315
27		Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour: Approximation algorithms for node-weighted buy-at-bulk network design. SODA 2007: 1265-1274
26		Lap Chi Lau, Joseph Naor, Mohammad R. Salavatipour, Mohit Singh: Survivable network design with degree or order constraints. STOC 2007: 651-660
25		Michael Krivelevich, Zeev Nutov, Mohammad R. Salavatipour, Jacques Yuster, Raphael Yuster: Approximation algorithms and hardness results for cycle packing problems. ACM Transactions on Algorithms 3(4): (2007)
24		Joseph Cheriyan, Mohammad R. Salavatipour: Packing element-disjoint steiner trees. ACM Transactions on Algorithms 3(4): (2007)
23		Zhipeng Cai, Randy Goebel, Mohammad R. Salavatipour, Guohui Lin: Selecting dissimilar genes for multi-class classification, an application in cancer subtyping. BMC Bioinformatics 8: (2007)
22		Michael Molloy, Mohammad R. Salavatipour: The Resolution Complexity of Random Constraint Satisfaction Problems. SIAM J. Comput. 37(3): 895-922 (2007)
	2006
21		Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour: Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees. APPROX-RANDOM 2006: 152-163
20		Zhipeng Cai, Lizhe Xu, Yi Shi, Mohammad R. Salavatipour, Randy Goebel, Guohui Lin: Using Gene Clustering to Identify Discriminatory Genes with Higher Classification Accuracy. BIBE 2006: 235-242
19		Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour: Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design. FOCS 2006: 677-686
18		Erik D. Demaine, Mohammad Taghi Hajiaghayi, Uriel Feige, Mohammad R. Salavatipour: Combination can be hard: approximability of the unique coverage problem. SODA 2006: 162-171
17		Joseph Cheriyan, Mohammad R. Salavatipour: Hardness and Approximation Results for Packing Steiner Trees. Algorithmica 45(1): 21-43 (2006)
16		Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour: Approximating Buy-at-Bulk k-Steiner trees Electronic Colloquium on Computational Complexity (ECCC)(007): (2006)
15		Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour: Polylogarithmic Approximation Algorithm for Non-Uniform Multicommodity Buy-at-Bulk Electronic Colloquium on Computational Complexity (ECCC)(008): (2006)
14		Mohammad R. Salavatipour: Large Induced Forests in Triangle-Free Planar Graphs. Graphs and Combinatorics 22(1): 113-126 (2006)
	2005
13		Joseph Cheriyan, Mohammad R. Salavatipour: Packing Element-Disjoint Steiner Trees. APPROX-RANDOM 2005: 52-61
12		Mohammad R. Salavatipour, Jacques Verstraëte: Disjoint Cycles: Integrality Gap, Hardness, and Approximation. IPCO 2005: 51-65
11		Oleg V. Borodin, Alexei N. Glebov, André Raspaud, Mohammad R. Salavatipour: Planar graphs without cycles of length from 4 to 7 are 3-colorable. J. Comb. Theory, Ser. B 93(2): 303-311 (2005)
10		Michael Molloy, Mohammad R. Salavatipour: A bound on the chromatic number of the square of a planar graph. J. Comb. Theory, Ser. B 94(2): 189-213 (2005)
	2004
9		Joseph Cheriyan, Mohammad R. Salavatipour: Hardness and Approximation Results for Packing Steiner Trees. ESA 2004: 180-191
8		Mohammad R. Salavatipour: A polynomial time algorithm for strong edge coloring of partial k-trees. Discrete Applied Mathematics 143(1-3): 285-291 (2004)
7		Mohammad R. Salavatipour: A (1 + varepsilon )-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lova'sz Local Lemma. Random Struct. Algorithms 25(1): 68-90 (2004)
	2003
6		Michael Molloy, Mohammad R. Salavatipour: The Resolution Complexity of Random Constraint Satisfaction Problems. FOCS 2003: 330-339
5		Kamal Jain, Mohammad Mahdian, Mohammad R. Salavatipour: Packing Steiner trees. SODA 2003: 266-274
4		Mohammad R. Salavatipour: A (1+epsilon)-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lovász Local Lemma. SODA 2003: 347-356
3		Mohammad R. Salavatipour: On Sum Coloring of Graphs. Discrete Applied Mathematics 127(3): 477-488 (2003)
	2002
2		Michael Molloy, Mohammad R. Salavatipour: Frequency Channel Assignment on Planar Networks. ESA 2002: 736-747
	2000
1		Mohammad Mahdian, Ebadollah S. Mahmoodian, Amin Saberi, Mohammad R. Salavatipour, Ruzbeh Tusserkani: On a conjecture of Keedwell and the cycle double cover conjecture. Discrete Mathematics 216(1-3): 287-292 (2000)

Coauthor Index

1	Nikhil Bansal	[37]
2	Oleg V. Borodin	[11]
3	Zhipeng Cai	[20] [23] [29]
4	Chandra Chekuri	[19] [27]
5	Joseph Cheriyan	[9] [13] [17] [24]
6	Erik D. Demaine	[18] [30]
7	Uriel Feige	[18] [30]
8	Zachary Friggstad	[28] [31] [34] [37]
9	Alexei N. Glebov	[11]
10	Randy Goebel	[20] [23] [29]
11	Mohammad Taghi Hajiaghayi (MohammadTaghi Hajiaghayi)	[15] [16] [18] [19] [21] [27] [30] [36]
12	Kamal Jain	[5]
13	Rohit Khandekar	[32] [37]
14	Guy Kortsarz	[15] [16] [19] [21] [27] [32] [36]
15	Michael Krivelevich	[25]
16	Lap Chi Lau	[26]
17	Guohui Lin (Guo-Hui Lin)	[20] [23] [29]
18	Mohammad Mahdian	[1] [5]
19	Ebadollah S. Mahmoodian	[1]
20	Vahab S. Mirrokni (Seyed Vahab Mirrokni)	[32]
21	Michael Molloy (Michael S. O. Molloy)	[2] [6] [10] [22]
22	Joseph Naor (Seffi Naor)	[26]
23	Zeev Nutov	[25]
24	Imran A. Pirwani	[35]
25	André Raspaud	[11]
26	Amin Saberi	[1]
27	MohammadAli Safari	[33]
28	Yi Shi	[20] [29]
29	Mohit Singh	[26]
30	Zoya Svitkina	[34]
31	Ruzbeh Tusserkani	[1]
32	Jacques Verstraëte	[12]
33	Lizhe Xu	[20] [29]
34	Jacques Yuster	[25]
35	Raphael Yuster	[25]

Colors in the list of coauthors