% csauthors.net - beta - BibTeX bibliography of Mohammad R. Salavatipour
@article{journals/dm/MahdianMSST00,
title = {On a conjecture of Keedwell and the cycle double cover conjecture.},
year = {2000},
journal = {Discret. Math.},
author = {{Mohammad Mahdian} and {Ebadollah S. Mahmoodian} and {Amin Saberi} and {Mohammad R. Salavatipour} and {Ruzbeh Tusserkani}}
}
@inproceedings{conf/esa/MolloyS02,
title = {Frequency Channel Assignment on Planar Networks.},
year = {2002},
booktitle = {ESA},
author = {{Michael Molloy 001} and {Mohammad R. Salavatipour}},
publisher = {Springer},
booktitle = {Algorithms - ESA 2002, 10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings}
}
@inproceedings{conf/soda/JainMS03,
title = {Packing Steiner trees.},
year = {2003},
booktitle = {SODA},
author = {{Kamal Jain} and {Mohammad Mahdian} and {Mohammad R. Salavatipour}},
publisher = {ACM/SIAM},
booktitle = {Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 12-14, 2003, Baltimore, Maryland, USA.}
}
@inproceedings{conf/soda/Salavatipour03,
title = {A (1+epsilon)-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lovász Local Lemma.},
year = {2003},
booktitle = {SODA},
author = {{Mohammad R. Salavatipour}},
publisher = {ACM/SIAM},
booktitle = {Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 12-14, 2003, Baltimore, Maryland, USA.}
}
@article{journals/dam/Salavatipour03,
title = {On Sum Coloring of Graphs.},
year = {2003},
journal = {Discret. Appl. Math.},
author = {{Mohammad R. Salavatipour}}
}
@phdthesis{phd/ca/Salavatipour03,
title = {Graph colouring via the discharging method.},
year = {2003},
author = {{Mohammad R. Salavatipour}}
}
@article{journals/dam/Salavatipour04,
title = {A polynomial time algorithm for strong edge coloring of partial k-trees.},
year = {2004},
journal = {Discret. Appl. Math.},
author = {{Mohammad R. Salavatipour}}
}
@article{journals/rsa/Salavatipour04,
title = {A (1 + varepsilon )-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lova'sz Local Lemma.},
year = {2004},
journal = {Random Struct. Algorithms},
author = {{Mohammad R. Salavatipour}}
}
@inproceedings{conf/ipco/SalavatipourV05,
title = {Disjoint Cycles: Integrality Gap, Hardness, and Approximation.},
year = {2005},
booktitle = {IPCO},
author = {{Mohammad R. Salavatipour} and {Jacques Verstraëte}},
publisher = {Springer},
booktitle = {Integer Programming and Combinatorial Optimization, 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings}
}
@article{journals/jct/BorodinGRS05,
title = {Planar graphs without cycles of length from 4 to 7 are 3-colorable.},
year = {2005},
journal = {J. Comb. Theory, Ser. B},
author = {{Oleg V. Borodin} and {Alexei N. Glebov} and {André Raspaud} and {Mohammad R. Salavatipour}}
}
@article{journals/jct/MolloyS05,
title = {A bound on the chromatic number of the square of a planar graph.},
year = {2005},
journal = {J. Comb. Theory, Ser. B},
author = {{Michael Molloy 001} and {Mohammad R. Salavatipour}}
}
@inproceedings{conf/bibe/CaiXSSGL06,
title = {Using Gene Clustering to Identify Discriminatory Genes with Higher Classification Accuracy.},
year = {2006},
booktitle = {BIBE},
author = {{Zhipeng Cai 001} and {Lizhe Xu} and {Yi Shi 005} and {Mohammad R. Salavatipour} and {Randy Goebel} and {Guohui Lin}},
publisher = {IEEE Computer Society},
booktitle = {Sixth IEEE International Symposium on BioInformatics and BioEngineering (BIBE 2006), 16-18 October 2006, Arlington, Virginia, USA}
}
@inproceedings{conf/focs/ChekuriHKS06,
title = {Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design.},
year = {2006},
booktitle = {FOCS},
author = {{Chandra Chekuri} and {Mohammad Taghi Hajiaghayi} and {Guy Kortsarz} and {Mohammad R. Salavatipour}},
publisher = {IEEE Computer Society},
booktitle = {47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings}
}
@article{journals/algorithmica/CheriyanS06,
title = {Hardness and Approximation Results for Packing Steiner Trees.},
year = {2006},
journal = {Algorithmica},
author = {{Joseph Cheriyan} and {Mohammad R. Salavatipour}}
}
@article{journals/eccc/ECCC-TR06-007,
title = {Approximating Buy-at-Bulk k-Steiner trees},
year = {2006},
journal = {Electron. Colloquium Comput. Complex.},
author = {{Mohammad Taghi Hajiaghayi} and {Guy Kortsarz} and {Mohammad R. Salavatipour}}
}
@article{journals/eccc/ECCC-TR06-008,
title = {Polylogarithmic Approximation Algorithm for Non-Uniform Multicommodity Buy-at-Bulk},
year = {2006},
journal = {Electron. Colloquium Comput. Complex.},
author = {{Mohammad Taghi Hajiaghayi} and {Guy Kortsarz} and {Mohammad R. Salavatipour}}
}
@article{journals/gc/Salavatipour06,
title = {Large Induced Forests in Triangle-Free Planar Graphs.},
year = {2006},
journal = {Graphs Comb.},
author = {{Mohammad R. Salavatipour}}
}
@inproceedings{conf/apbc/CaiGSSXL07,
title = {Selecting Genes with Dissimilar Discrimination Strength for Sample Class Prediction.},
year = {2007},
booktitle = {APBC},
author = {{Zhipeng Cai 001} and {Randy Goebel} and {Mohammad R. Salavatipour} and {Yi Shi 005} and {Lizhe Xu} and {Guohui Lin}},
publisher = {Imperial College Press},
booktitle = {Proceedings of 5th Asia-Pacific Bioinformatics Conference, APBC 2007, 15-17 January 2007, Hong Kong, China}
}
@inproceedings{conf/soda/ChekuriHKS07,
title = {Approximation algorithms for node-weighted buy-at-bulk network design.},
year = {2007},
booktitle = {SODA},
author = {{Chandra Chekuri} and {Mohammad Taghi Hajiaghayi} and {Guy Kortsarz} and {Mohammad R. Salavatipour}},
publisher = {SIAM},
booktitle = {Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007}
}
@article{journals/bmcbi/CaiGSL07,
title = {Selecting dissimilar genes for multi-class classification, an application in cancer subtyping.},
year = {2007},
journal = {BMC Bioinform.},
author = {{Zhipeng Cai 001} and {Randy Goebel} and {Mohammad R. Salavatipour} and {Guohui Lin}}
}
@inproceedings{journals/jmlr/MadaniGKS07,
title = {Recall Systems: Effcient Learning and Use of Category Indices.},
year = {2007},
booktitle = {AISTATS},
author = {{Omid Madani} and {Wiley Greiner} and {David Kempe 001} and {Mohammad R. Salavatipour}},
publisher = {JMLR.org},
booktitle = {Proceedings of the Eleventh International Conference on Artificial Intelligence and Statistics, AISTATS 2007, San Juan, Puerto Rico, March 21-24, 2007}
}
@article{journals/siamcomp/MolloyS07,
title = {The Resolution Complexity of Random Constraint Satisfaction Problems.},
year = {2007},
journal = {SIAM J. Comput.},
author = {{Michael Molloy 001} and {Mohammad R. Salavatipour}}
}
@article{journals/talg/CheriyanS07,
title = {Packing element-disjoint steiner trees.},
year = {2007},
journal = {ACM Trans. Algorithms},
author = {{Joseph Cheriyan} and {Mohammad R. Salavatipour}}
}
@article{journals/talg/KrivelevichNSYY07,
title = {Approximation algorithms and hardness results for cycle packing problems.},
year = {2007},
journal = {ACM Trans. Algorithms},
author = {{Michael Krivelevich} and {Zeev Nutov} and {Mohammad R. Salavatipour} and {Jacques Verstraëte} and {Raphael Yuster}}
}
@inproceedings{conf/approx/SafariS08,
title = {A Constant Factor Approximation for Minimum lambda-Edge-Connected k-Subgraph with Metric Costs.},
year = {2008},
booktitle = {APPROX-RANDOM},
author = {{MohammadAli Safari} and {Mohammad R. Salavatipour}},
publisher = {Springer},
booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}
}
@article{journals/siamcomp/DemaineFHS08,
title = {Combination Can Be Hard: Approximability of the Unique Coverage Problem.},
year = {2008},
journal = {SIAM J. Comput.},
author = {{Erik D. Demaine} and {Uriel Feige} and {MohammadTaghi Hajiaghayi} and {Mohammad R. Salavatipour}}
}
@article{journals/algorithmica/HajiaghayiKS09,
title = {Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees.},
year = {2009},
journal = {Algorithmica},
author = {{Mohammad Taghi Hajiaghayi} and {Guy Kortsarz} and {Mohammad R. Salavatipour}}
}
@article{journals/corr/abs-0904-2203,
title = {A PTAS for Minimum Clique Partition in Unit Disk Graphs},
year = {2009},
journal = {CoRR},
author = {{Imran A. Pirwani} and {Mohammad R. Salavatipour}}
}
@article{journals/siamcomp/LauNSS09,
title = {Survivable Network Design with Degree or Order Constraints.},
year = {2009},
journal = {SIAM J. Comput.},
author = {{Lap Chi Lau} and {Joseph Naor} and {Mohammad R. Salavatipour} and {Mohit Singh}}
}
@article{journals/siamcomp/ChekuriHKS10,
title = {Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design.},
year = {2010},
journal = {SIAM J. Comput.},
author = {{Chandra Chekuri} and {Mohammad Taghi Hajiaghayi} and {Guy Kortsarz} and {Mohammad R. Salavatipour}}
}
@article{journals/algorithmica/FriggstadS11,
title = {Approximability of Packing Disjoint Cycles.},
year = {2011},
journal = {Algorithmica},
author = {{Zachary Friggstad} and {Mohammad R. Salavatipour}}
}
@article{journals/siamdm/SafariS11,
title = {A Constant Factor Approximation for Minimum λ-Edge-Connected k-Subgraph with Metric Costs.},
year = {2011},
journal = {SIAM J. Discret. Math.},
author = {{MohammadAli Safari} and {Mohammad R. Salavatipour}}
}
@article{journals/talg/FriggstadS11,
title = {Minimizing movement in mobile facility location problems.},
year = {2011},
journal = {ACM Trans. Algorithms},
author = {{Zachary Friggstad} and {Mohammad R. Salavatipour}}
}
@article{journals/algorithmica/PirwaniS12,
title = {A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs.},
year = {2012},
journal = {Algorithmica},
author = {{Imran A. Pirwani} and {Mohammad R. Salavatipour}}
}
@article{journals/algorithmica/KhandekarKMS13,
title = {Two-stage Robust Network Design with Exponential Scenarios.},
year = {2013},
journal = {Algorithmica},
author = {{Rohit Khandekar} and {Guy Kortsarz} and {Vahab S. Mirrokni} and {Mohammad R. Salavatipour}}
}
@article{journals/siamcomp/FriggstadSS13,
title = {Asymmetric Traveling Salesman Path and Directed Latency Problems.},
year = {2013},
journal = {SIAM J. Comput.},
author = {{Zachary Friggstad} and {Mohammad R. Salavatipour} and {Zoya Svitkina}}
}
@inproceedings{conf/approx/AhmadianBFJSS14,
title = {Approximation Algorithms for Minimum-Load k-Facility Location.},
year = {2014},
booktitle = {APPROX-RANDOM},
author = {{Sara Ahmadian} and {Babak Behsaz} and {Zachary Friggstad} and {Amin Jorati} and {Mohammad R. Salavatipour} and {Chaitanya Swamy}},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2014, September 4-6, 2014, Barcelona, Spain}
}
@article{journals/algorithmica/KhaniS14,
title = {Improved Approximation Algorithms for the Min-max Tree Cover and Bounded Tree Cover Problems.},
year = {2014},
journal = {Algorithmica},
author = {{M. Reza Khani} and {Mohammad R. Salavatipour}}
}
@article{journals/talg/BansalFKS14,
title = {A logarithmic approximation for unsplittable flow on line graphs.},
year = {2014},
journal = {ACM Trans. Algorithms},
author = {{Nikhil Bansal 001} and {Zachary Friggstad} and {Rohit Khandekar} and {Mohammad R. Salavatipour}}
}
@article{journals/algorithmica/BehsazS15,
title = {On Minimum Sum of Radii and Diameters Clustering.},
year = {2015},
journal = {Algorithmica},
author = {{Babak Behsaz} and {Mohammad R. Salavatipour}}
}
@inproceedings{conf/isaac/MartinS16,
title = {Approximation Algorithms for Capacitated k-Travelling Repairmen Problems.},
year = {2016},
booktitle = {ISAAC},
author = {{Christopher S. Martin} and {Mohammad R. Salavatipour}},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
booktitle = {27th International Symposium on Algorithms and Computation, ISAAC 2016, December 12-14, 2016, Sydney, Australia}
}
@inproceedings{conf/swat/FriggstadRS16,
title = {Approximating Connected Facility Location with Lower and Upper Bounds via LP Rounding.},
year = {2016},
booktitle = {SWAT},
author = {{Zachary Friggstad} and {Mohsen Rezapour} and {Mohammad R. Salavatipour}},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016, June 22-24, 2016, Reykjavik, Iceland}
}
@article{journals/algorithmica/BehsazSS16,
title = {New Approximation Algorithms for the Unsplittable Capacitated Facility Location Problem.},
year = {2016},
journal = {Algorithmica},
author = {{Babak Behsaz} and {Mohammad R. Salavatipour} and {Zoya Svitkina}}
}
@article{journals/dcg/Har-PeledNSS16,
title = {How to Walk Your Dog in the Mountains with No Magic Leash.},
year = {2016},
journal = {Discret. Comput. Geom.},
author = {{Sariel Har-Peled} and {Amir Nayyeri} and {Mohammad R. Salavatipour} and {Anastasios Sidiropoulos}}
}
@article{journals/jco/KhaniS16,
title = {Improved approximations for buy-at-bulk and shallow-light k-Steiner trees and (k, 2)-subgraph.},
year = {2016},
journal = {J. Comb. Optim.},
author = {{M. Reza Khani} and {Mohammad R. Salavatipour}}
}
@article{journals/algorithmica/MartinS18,
title = {Minimizing Latency of Capacitated k-Tours.},
year = {2018},
journal = {Algorithmica},
author = {{Christopher S. Martin} and {Mohammad R. Salavatipour}}
}
@article{journals/talg/AhmadianBFJSS18,
title = {Approximation Algorithms for Minimum-Load k-Facility Location.},
year = {2018},
journal = {ACM Trans. Algorithms},
author = {{Sara Ahmadian} and {Babak Behsaz} and {Zachary Friggstad} and {Amin Jorati} and {Mohammad R. Salavatipour} and {Chaitanya Swamy}}
}
@inproceedings{conf/soda/FriggstadKS19,
title = {Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-MEANS.},
year = {2019},
booktitle = {SODA},
author = {{Zachary Friggstad} and {Kamyar Khodamoradi} and {Mohammad R. Salavatipour}},
publisher = {SIAM},
booktitle = {Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019}
}
@article{journals/algorithmica/BehsazFSS19,
title = {Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median.},
year = {2019},
journal = {Algorithmica},
author = {{Babak Behsaz} and {Zachary Friggstad} and {Mohammad R. Salavatipour} and {Rohit Sivakumar}}
}
@article{journals/algorithmica/FriggstadRSS19,
title = {LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design.},
year = {2019},
journal = {Algorithmica},
author = {{Zachary Friggstad} and {Mohsen Rezapour} and {Mohammad R. Salavatipour} and {José A. Soto}}
}
@article{journals/scheduling/FriggstadGKMRRS19,
title = {Scheduling problems over a network of machines.},
year = {2019},
journal = {J. Sched.},
author = {{Zachary Friggstad} and {Arnoosh Golestanian} and {Kamyar Khodamoradi} and {Christopher S. Martin} and {Mirmahdi Rahgoshay} and {Mohsen Rezapour} and {Mohammad R. Salavatipour} and {Yifeng Zhang}}
}
@article{journals/siamcomp/FriggstadRS19,
title = {Local Search Yields a PTAS for k-Means in Doubling Metrics.},
year = {2019},
journal = {SIAM J. Comput.},
author = {{Zachary Friggstad} and {Mohsen Rezapour} and {Mohammad R. Salavatipour}}
}
@article{journals/talg/FriggstadKRS19,
title = {Approximation Schemes for Clustering with Outliers.},
year = {2019},
journal = {ACM Trans. Algorithms},
author = {{Zachary Friggstad} and {Kamyar Khodamoradi} and {Mohsen Rezapour} and {Mohammad R. Salavatipour}}
}
@inproceedings{conf/isaac/Hyatt-DenesikRS20,
title = {Approximations for Throughput Maximization.},
year = {2020},
booktitle = {ISAAC},
author = {{Dylan Hyatt-Denesik} and {Mirmahdi Rahgoshay} and {Mohammad R. Salavatipour}},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
booktitle = {31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference).}
}
@inproceedings{conf/isaac/PangS20,
title = {Approximation Algorithms for Generalized Path Scheduling.},
year = {2020},
booktitle = {ISAAC},
author = {{Haozhou Pang} and {Mohammad R. Salavatipour}},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
booktitle = {31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference).}
}
@article{journals/comgeo/FriggstadSS20,
title = {Preface.},
year = {2020},
journal = {Comput. Geom.},
author = {{Zachary Friggstad} and {Jörg-Rüdiger Sack} and {Mohammad R. Salavatipour}}
}
@article{journals/algorithmica/FriggstadSS21,
title = {Special Issue on Algorithms and Data Structures (WADS 2019).},
year = {2021},
journal = {Algorithmica},
author = {{Zachary Friggstad} and {Jörg-Rüdiger Sack} and {Mohammad R. Salavatipour}}
}
@article{journals/corr/abs-2111-06863,
title = {Hierarchical Clustering: New Bounds and Objective.},
year = {2021},
journal = {CoRR},
author = {{Mirmahdi Rahgoshay} and {Mohammad R. Salavatipour}}
}
@article{journals/corr/abs-2111-08138,
title = {Improved Approximations for CVRP with Unsplittable Demands.},
year = {2021},
journal = {CoRR},
author = {{Zachary Friggstad} and {Ramin Mousavi} and {Mirmahdi Rahgoshay} and {Mohammad R. Salavatipour}}
}
@inproceedings{conf/ipco/FriggstadMRS22,
title = {Improved Approximations for Capacitated Vehicle Routing with Unsplittable Client Demands.},
year = {2022},
booktitle = {IPCO},
author = {{Zachary Friggstad} and {Ramin Mousavi} and {Mirmahdi Rahgoshay} and {Mohammad R. Salavatipour}},
publisher = {Springer},
booktitle = {Integer Programming and Combinatorial Optimization - 23rd International Conference, IPCO 2022, Eindhoven, The Netherlands, June 27-29, 2022, Proceedings}
}
@article{journals/algorithmica/RahgoshayS22,
title = {Asymptotic Quasi-Polynomial Time Approximation Scheme for Resource Minimization for Fire Containment.},
year = {2022},
journal = {Algorithmica},
author = {{Mirmahdi Rahgoshay} and {Mohammad R. Salavatipour}}
}
@inproceedings{conf/esa/NaderiRS23,
title = {Approximation Schemes for Min-Sum k-Clustering.},
year = {2023},
booktitle = {ESA},
author = {{Ismail Naderi} and {Mohsen Rezapour} and {Mohammad R. Salavatipour}},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
booktitle = {31st Annual European Symposium on Algorithms, ESA 2023, September 4-6, 2023, Amsterdam, The Netherlands}
}
@article{journals/comgeo/HeLS23,
title = {Preface.},
year = {2023},
journal = {Comput. Geom.},
author = {{Meng He 001} and {Anna Lubiw} and {Mohammad R. Salavatipour}}
}
@article{journals/talg/JayaprakashS23,
title = {Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension.},
year = {2023},
month = {April},
journal = {ACM Trans. Algorithms},
author = {{Aditya Jayaprakash} and {Mohammad R. Salavatipour}}
}
@article{journals/algorithmica/HeLS23,
title = {Preface to the Special Issue on the 17th Algorithms and Data Structures Symposium (WADS 2021).},
year = {2023},
month = {June},
journal = {Algorithmica},
author = {{Meng He 001} and {Anna Lubiw} and {Mohammad R. Salavatipour}}
}