Search the dblp DataBase
Mohammad R. Salavatipour :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Zhipeng Cai , Randy Goebel , Mohammad R. Salavatipour , Yi Shi , Lizhe Xu , Guohui Lin Selecting Genes with Dissimilar Discrimination Strength for Sample Class Prediction. [Citation Graph (0, 0)][DBLP ] APBC, 2007, pp:81-90 [Conf ] Joseph Cheriyan , Mohammad R. Salavatipour Packing Element-Disjoint Steiner Trees. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2005, pp:52-61 [Conf ] Mohammad Taghi Hajiaghayi , Guy Kortsarz , Mohammad R. Salavatipour Approximating Buy-at-Bulk and Shallow-Light k -Steiner Trees. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2006, pp:152-163 [Conf ] Zhipeng Cai , Lizhe Xu , Yi Shi , Mohammad R. Salavatipour , Randy Goebel , Guohui Lin Using Gene Clustering to Identify Discriminatory Genes with Higher Classification Accuracy. [Citation Graph (0, 0)][DBLP ] BIBE, 2006, pp:235-242 [Conf ] Joseph Cheriyan , Mohammad R. Salavatipour Hardness and Approximation Results for Packing Steiner Trees. [Citation Graph (0, 0)][DBLP ] ESA, 2004, pp:180-191 [Conf ] Michael Molloy , Mohammad R. Salavatipour Frequency Channel Assignment on Planar Networks. [Citation Graph (0, 0)][DBLP ] ESA, 2002, pp:736-747 [Conf ] Michael Molloy , Mohammad R. Salavatipour The Resolution Complexity of Random Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP ] FOCS, 2003, pp:330-339 [Conf ] Chandra Chekuri , Mohammad Taghi Hajiaghayi , Guy Kortsarz , Mohammad R. Salavatipour Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design. [Citation Graph (0, 0)][DBLP ] FOCS, 2006, pp:677-686 [Conf ] Mohammad R. Salavatipour , Jacques Verstraëte Disjoint Cycles: Integrality Gap, Hardness, and Approximation. [Citation Graph (0, 0)][DBLP ] IPCO, 2005, pp:51-65 [Conf ] Erik D. Demaine , Mohammad Taghi Hajiaghayi , Uriel Feige , Mohammad R. Salavatipour Combination can be hard: approximability of the unique coverage problem. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:162-171 [Conf ] Kamal Jain , Mohammad Mahdian , Mohammad R. Salavatipour Packing Steiner trees. [Citation Graph (0, 0)][DBLP ] SODA, 2003, pp:266-274 [Conf ] Mohammad R. Salavatipour A (1+epsilon)-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lovász Local Lemma. [Citation Graph (0, 0)][DBLP ] SODA, 2003, pp:347-356 [Conf ] Joseph Cheriyan , Mohammad R. Salavatipour Hardness and Approximation Results for Packing Steiner Trees. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2006, v:45, n:1, pp:21-43 [Journal ] Mohammad R. Salavatipour On Sum Coloring of Graphs. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2003, v:127, n:3, pp:477-488 [Journal ] Mohammad R. Salavatipour A polynomial time algorithm for strong edge coloring of partial k -trees. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:285-291 [Journal ] Mohammad Mahdian , Ebadollah S. Mahmoodian , Amin Saberi , Mohammad R. Salavatipour , Ruzbeh Tusserkani On a conjecture of Keedwell and the cycle double cover conjecture. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2000, v:216, n:1-3, pp:287-292 [Journal ] Mohammad Taghi Hajiaghayi , Guy Kortsarz , Mohammad R. Salavatipour Approximating Buy-at-Bulk k-Steiner trees [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 2006, v:, n:007, pp:- [Journal ] Mohammad Taghi Hajiaghayi , Guy Kortsarz , Mohammad R. Salavatipour Polylogarithmic Approximation Algorithm for Non-Uniform Multicommodity Buy-at-Bulk [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 2006, v:, n:008, pp:- [Journal ] Mohammad R. Salavatipour Large Induced Forests in Triangle-Free Planar Graphs. [Citation Graph (0, 0)][DBLP ] Graphs and Combinatorics, 2006, v:22, n:1, pp:113-126 [Journal ] Oleg V. Borodin , Alexei N. Glebov , André Raspaud , Mohammad R. Salavatipour Planar graphs without cycles of length from 4 to 7 are 3-colorable. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 2005, v:93, n:2, pp:303-311 [Journal ] Michael Molloy , Mohammad R. Salavatipour A bound on the chromatic number of the square of a planar graph. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 2005, v:94, n:2, pp:189-213 [Journal ] Mohammad R. Salavatipour A (1 + varepsilon )-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lova'sz Local Lemma. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2004, v:25, n:1, pp:68-90 [Journal ] Chandra Chekuri , Mohammad Taghi Hajiaghayi , Guy Kortsarz , Mohammad R. Salavatipour Approximation algorithms for node-weighted buy-at-bulk network design. [Citation Graph (0, 0)][DBLP ] SODA, 2007, pp:1265-1274 [Conf ] Lap Chi Lau , Joseph Naor , Mohammad R. Salavatipour , Mohit Singh Survivable network design with degree or order constraints. [Citation Graph (0, 0)][DBLP ] STOC, 2007, pp:651-660 [Conf ] Michael Molloy , Mohammad R. Salavatipour The Resolution Complexity of Random Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2007, v:37, n:3, pp:895-922 [Journal ] A Constant Factor Approximation for Minimum lambda-Edge-Connected k-Subgraph with Metric Costs. [Citation Graph (, )][DBLP ] Two-Stage Robust Network Design with Exponential Scenarios. [Citation Graph (, )][DBLP ] Minimizing Movement in Mobile Facility Location Problems. [Citation Graph (, )][DBLP ] Approximability of Packing Disjoint Cycles. [Citation Graph (, )][DBLP ] A logarithmic approximation for unsplittable flow on line graphs. [Citation Graph (, )][DBLP ] Asymmetric Traveling Salesman Path and Directed Latency Problems. [Citation Graph (, )][DBLP ] A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs. [Citation Graph (, )][DBLP ] Approximating Buy-at-Bulk and Shallow-Light k -Steiner Trees. [Citation Graph (, )][DBLP ] Selecting dissimilar genes for multi-class classification, an application in cancer subtyping. [Citation Graph (, )][DBLP ] A PTAS for Minimum Clique Partition in Unit Disk Graphs [Citation Graph (, )][DBLP ] Asymmetric Traveling Salesman Path and Directed Latency Problems [Citation Graph (, )][DBLP ] Search in 0.002secs, Finished in 0.304secs