| 2009 |
|---|
| 35 | EE | Nikhil Bansal,
Zachary Friggstad,
Rohit Khandekar,
Mohammad R. Salavatipour:
A logarithmic approximation for unsplittable flow on line graphs.
SODA 2009: 702-709 |
| 34 | EE | Mohammad Taghi Hajiaghayi,
Guy Kortsarz,
Mohammad R. Salavatipour:
Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees.
Algorithmica 53(1): 89-103 (2009) |
| 33 | EE | Imran A. Pirwani,
Mohammad R. Salavatipour:
A PTAS for Minimum Clique Partition in Unit Disk Graphs
CoRR abs/0904.2203: (2009) |
| 2008 |
|---|
| 32 | EE | MohammadAli Safari,
Mohammad R. Salavatipour:
A Constant Factor Approximation for Minimum lambda-Edge-Connected k-Subgraph with Metric Costs.
APPROX-RANDOM 2008: 233-246 |
| 31 | EE | Rohit Khandekar,
Guy Kortsarz,
Vahab S. Mirrokni,
Mohammad R. Salavatipour:
Two-Stage Robust Network Design with Exponential Scenarios.
ESA 2008: 589-600 |
| 30 | EE | Zachary Friggstad,
Mohammad R. Salavatipour:
Minimizing Movement in Mobile Facility Location Problems.
FOCS 2008: 357-366 |
| 29 | EE | 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 |
|---|
| 28 | EE | 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 |
| 27 | EE | Zachary Friggstad,
Mohammad R. Salavatipour:
Approximability of Packing Disjoint Cycles.
ISAAC 2007: 304-315 |
| 26 | EE | Chandra Chekuri,
Mohammad Taghi Hajiaghayi,
Guy Kortsarz,
Mohammad R. Salavatipour:
Approximation algorithms for node-weighted buy-at-bulk network design.
SODA 2007: 1265-1274 |
| 25 | EE | Lap Chi Lau,
Joseph Naor,
Mohammad R. Salavatipour,
Mohit Singh:
Survivable network design with degree or order constraints.
STOC 2007: 651-660 |
| 24 | EE | 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) |
| 23 | EE | Joseph Cheriyan,
Mohammad R. Salavatipour:
Packing element-disjoint steiner trees.
ACM Transactions on Algorithms 3(4): (2007) |
| 22 | EE | Michael Molloy,
Mohammad R. Salavatipour:
The Resolution Complexity of Random Constraint Satisfaction Problems.
SIAM J. Comput. 37(3): 895-922 (2007) |
| 2006 |
|---|
| 21 | EE | 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 | EE | 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 | EE | 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 | EE | Joseph Cheriyan,
Mohammad R. Salavatipour:
Hardness and Approximation Results for Packing Steiner Trees.
Algorithmica 45(1): 21-43 (2006) |
| 16 | EE | Mohammad Taghi Hajiaghayi,
Guy Kortsarz,
Mohammad R. Salavatipour:
Approximating Buy-at-Bulk k-Steiner trees
Electronic Colloquium on Computational Complexity (ECCC)(007): (2006) |
| 15 | EE | 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 | EE | Mohammad R. Salavatipour:
Large Induced Forests in Triangle-Free Planar Graphs.
Graphs and Combinatorics 22(1): 113-126 (2006) |
| 2005 |
|---|
| 13 | EE | Joseph Cheriyan,
Mohammad R. Salavatipour:
Packing Element-Disjoint Steiner Trees.
APPROX-RANDOM 2005: 52-61 |
| 12 | EE | Mohammad R. Salavatipour,
Jacques Verstraëte:
Disjoint Cycles: Integrality Gap, Hardness, and Approximation.
IPCO 2005: 51-65 |
| 11 | EE | 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 | EE | 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 | EE | Joseph Cheriyan,
Mohammad R. Salavatipour:
Hardness and Approximation Results for Packing Steiner Trees.
ESA 2004: 180-191 |
| 8 | EE | 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 | EE | 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 | EE | Michael Molloy,
Mohammad R. Salavatipour:
The Resolution Complexity of Random Constraint Satisfaction Problems.
FOCS 2003: 330-339 |
| 5 | EE | Kamal Jain,
Mohammad Mahdian,
Mohammad R. Salavatipour:
Packing Steiner trees.
SODA 2003: 266-274 |
| 4 | EE | 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 | EE | Mohammad R. Salavatipour:
On Sum Coloring of Graphs.
Discrete Applied Mathematics 127(3): 477-488 (2003) |
| 2002 |
|---|
| 2 | EE | Michael Molloy,
Mohammad R. Salavatipour:
Frequency Channel Assignment on Planar Networks.
ESA 2002: 736-747 |
| 2000 |
|---|
| 1 | EE | 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) |
