| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Imran A. Pirwani, Mohammad R. Salavatipour |
A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs.  |
Algorithmica  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Zachary Friggstad, Mohammad R. Salavatipour |
Approximability of Packing Disjoint Cycles. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Zachary Friggstad, Mohammad R. Salavatipour |
Minimizing movement in mobile facility location problems. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | MohammadAli Safari, Mohammad R. Salavatipour |
A Constant Factor Approximation for Minimum λ-Edge-Connected k-Subgraph with Metric Costs. |
SIAM J. Discrete Math. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | M. Reza Khani, Mohammad R. Salavatipour |
Improved Approximation Algorithms for the Min-Max Tree Cover and Bounded Tree Cover Problems. |
APPROX-RANDOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | M. Reza Khani, Mohammad R. Salavatipour |
Improved Approximations for Buy-at-Bulk and Shallow-Light k-Steiner Trees and (k, 2)-Subgraph. |
ISAAC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour |
Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Zachary Friggstad, Mohammad R. Salavatipour, Zoya Svitkina |
Asymmetric Traveling Salesman Path and Directed Latency Problems. |
SODA |
2010 |
DBLP BibTeX RDF |
|
| 1 | Imran A. Pirwani, Mohammad R. Salavatipour |
A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs. |
SWAT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour |
Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Zachary Friggstad, Mohammad R. Salavatipour, Zoya Svitkina |
Asymmetric Traveling Salesman Path and Directed Latency Problems |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Imran A. Pirwani, Mohammad R. Salavatipour |
A PTAS for Minimum Clique Partition in Unit Disk Graphs |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Lap Chi Lau, Joseph Naor, Mohammad R. Salavatipour, Mohit Singh |
Survivable Network Design with Degree or Order Constraints. |
SIAM J. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Bansal, Zachary Friggstad, Rohit Khandekar, Mohammad R. Salavatipour |
A logarithmic approximation for unsplittable flow on line graphs. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Erik D. Demaine, Uriel Feige, MohammadTaghi Hajiaghayi, Mohammad R. Salavatipour |
Combination Can Be Hard: Approximability of the Unique Coverage Problem. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, Mohammad R. Salavatipour |
Two-Stage Robust Network Design with Exponential Scenarios. |
ESA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | MohammadAli Safari, Mohammad R. Salavatipour |
A Constant Factor Approximation for Minimum lambda-Edge-Connected k-Subgraph with Metric Costs. |
APPROX-RANDOM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Zachary Friggstad, Mohammad R. Salavatipour |
Minimizing Movement in Mobile Facility Location Problems. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhipeng Cai, Randy Goebel, Mohammad R. Salavatipour, Guohui Lin |
Selecting dissimilar genes for multi-class classification, an application in cancer subtyping. |
BMC Bioinformatics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Omid Madani, Wiley Greiner, David Kempe, Mohammad R. Salavatipour |
Recall Systems: Effcient Learning and Use of Category Indices. |
Journal of Machine Learning Research - Proceedings Track |
2007 |
DBLP BibTeX RDF |
|
| 1 | Michael Krivelevich, Zeev Nutov, Mohammad R. Salavatipour, Jacques Yuster, Raphael Yuster |
Approximation algorithms and hardness results for cycle packing problems. |
ACM Transactions on Algorithms |
2007 |
DBLP DOI BibTeX RDF |
Cycle packing, edge-disjoint, approximation algorithms, hardness of approximation, integrality gap |
| 1 | Joseph Cheriyan, Mohammad R. Salavatipour |
Packing element-disjoint steiner trees. |
ACM Transactions on Algorithms |
2007 |
DBLP DOI BibTeX RDF |
element-disjoint, approximation algorithms, Steiner trees, hardness of approximation, Packing |
| 1 | Michael Molloy, Mohammad R. Salavatipour |
The Resolution Complexity of Random Constraint Satisfaction Problems. |
SIAM J. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour |
Approximation algorithms for node-weighted buy-at-bulk network design. |
SODA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Zachary Friggstad, Mohammad R. Salavatipour |
Approximability of Packing Disjoint Cycles. |
ISAAC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Lap Chi Lau, Joseph Naor, Mohammad R. Salavatipour, Mohit Singh |
Survivable network design with degree or order constraints. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
approximation algorithms, network design, NP-hard problems, bounded degree, iterative rounding |
| 1 | Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour |
Approximating Buy-at-Bulk k-Steiner trees |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour |
Polylogarithmic Approximation Algorithm for Non-Uniform Multicommodity Buy-at-Bulk |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Joseph Cheriyan, Mohammad R. Salavatipour |
Hardness and Approximation Results for Packing Steiner Trees. |
Algorithmica |
2006 |
DBLP DOI BibTeX RDF |
Approximation algorithms, Steiner trees, Hardness of approximation, Packing problems |
| 1 | Mohammad R. Salavatipour |
Large Induced Forests in Triangle-Free Planar Graphs. |
Graphs and Combinatorics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Erik D. Demaine, Mohammad Taghi Hajiaghayi, Uriel Feige, Mohammad R. Salavatipour |
Combination can be hard: approximability of the unique coverage problem. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour |
Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees. |
APPROX-RANDOM |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour |
Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design. |
FOCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Molloy, Mohammad R. Salavatipour |
A bound on the chromatic number of the square of a planar graph. |
J. Comb. Theory, Ser. B |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohammad R. Salavatipour, Jacques Verstraëte |
Disjoint Cycles: Integrality Gap, Hardness, and Approximation. |
IPCO |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Cheriyan, Mohammad R. Salavatipour |
Packing Element-Disjoint Steiner Trees. |
APPROX-RANDOM |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohammad R. Salavatipour |
A polynomial time algorithm for strong edge coloring of partial k-trees. |
Discrete Applied Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Cheriyan, Mohammad R. Salavatipour |
Hardness and Approximation Results for Packing Steiner Trees. |
ESA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohammad R. Salavatipour |
On Sum Coloring of Graphs. |
Discrete Applied Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Kamal Jain, Mohammad Mahdian, Mohammad R. Salavatipour |
Packing Steiner trees. |
SODA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohammad R. Salavatipour |
A (1+epsilon)-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lovász Local Lemma. |
SODA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Molloy, Mohammad R. Salavatipour |
The Resolution Complexity of Random Constraint Satisfaction Problems. |
FOCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Molloy, Mohammad R. Salavatipour |
Frequency Channel Assignment on Planar Networks. |
ESA |
2002 |
DBLP DOI BibTeX RDF |
|
| 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 |
2000 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")