Envy-free mechanisms with minimum number of cuts R Alijani, M Farhadi, M Ghodsi, M Seddighin, A Tajik Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017 | 26 | 2017 |

Diversity Maximization via Composable Coresets. S Aghamolaei, M Farhadi, H Zarrabi-Zadeh CCCG, 2015 | 23 | 2015 |

Low Complexity Heart Rate Measurement from Wearable Wrist-Type Photoplethysmographic Sensors Robust to Motion Artifacts MB Mashhadi, M Farhadi, M Essalat, F Marvasti 2018 IEEE International Conference on Acoustics, Speech and Signal …, 2018 | 7 | 2018 |

Improved approximations for min sum vertex cover and generalized min sum set cover N Bansal, J Batra, M Farhadi, P Tetali Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 6 | 2021 |

Realtime heart rate monitoring using photoplethysmographic (PPG) signals during intensive physical exercises. bioRxiv 092627 M Farhadi, MB Mashhadi, M Essalat, F Marvasti | 6* | 2016 |

Bridging Classical and Quantum with SDP initialized warm-starts for QAOA R Tate, M Farhadi, C Herold, G Mohler, S Gupta arXiv preprint arXiv:2010.14021, 2020 | 3 | 2020 |

Routing in well-separated pair decomposition spanners F Baharifard, M Farhadi, H Zarrabi-Zadeh Iranian Conference on Computational Geometry, 25-28, 2018 | 3 | 2018 |

Expand the Shares Together: Envy-Free Mechanisms with a Small Number of Cuts M Seddighin, M Farhadi, M Ghodsi, R Alijani, AS Tajik Algorithmica 81 (4), 1728-1755, 2019 | 2 | 2019 |

The Traveling Firefighter Problem M Farhadi, A Toriello, P Tetali SIAM Conference on Applied and Computational Discrete Algorithms (ACDA21 …, 2021 | | 2021 |

On the Complexity of Vertex Expansion, and Spread Constant of Trees M Farhadi, A Louis, P Tetali arXiv preprint arXiv:2003.05582, 2020 | | 2020 |