Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMajid Farhadi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j4]Nikhil Bansal, Jatin Batra
, Majid Farhadi, Prasad Tetali:
On Min Sum Vertex Cover and Generalized Min Sum Set Cover. SIAM J. Comput. 52(2): 327-357 (2023)- 2022
- [i5]Majid Farhadi, Jai Moondra, Prasad Tetali, Alejandro Toriello:
Multi Purpose Routing: New Perspectives and Approximation Algorithms. CoRR abs/2208.04410 (2022) - 2021
- [c6]Majid Farhadi, Alejandro Toriello, Prasad Tetali:
The Traveling Firefighter Problem. ACDA 2021: 205-216 - [c5]Nikhil Bansal, Jatin Batra, Majid Farhadi, Prasad Tetali:
Improved Approximations for Min Sum Vertex Cover and Generalized Min Sum Set Cover. SODA 2021: 998-1005 - [i4]Majid Farhadi, Alejandro Toriello, Prasad Tetali:
The Traveling Firefighter Problem. CoRR abs/2107.10454 (2021) - [i3]Majid Farhadi, Swati Gupta, Shengding Sun, Prasad Tetali, Michael C. Wigal:
Hardness and Approximation of Submodular Minimum Linear Ordering Problems. CoRR abs/2108.00914 (2021) - 2020
- [j3]Majid Farhadi, Hamideh Bypour, Seyyed Erfan Asadi:
A secure and efficient multi cloud-based data storage and retrieval using hash-based verifiable secret sharing scheme. Int. J. Cloud Comput. 9(4): 412-431 (2020) - [i2]Majid Farhadi, Anand Louis, Prasad Tetali:
On the Complexity and Approximation of λ∞ Spread Constant and Maximum Variance Embedding. CoRR abs/2003.05582 (2020) - [i1]Nikhil Bansal, Jatin Batra, Majid Farhadi, Prasad Tetali:
Improved Approximations for Min Sum Vertex Cover and Generalized Min Sum Set Cover. CoRR abs/2007.09172 (2020)
2010 – 2019
- 2019
- [j2]Masoud Seddighin, Majid Farhadi, Mohammad Ghodsi, Reza Alijani, Ahmad S. Tajik:
Expand the Shares Together: Envy-Free Mechanisms with a Small Number of Cuts. Algorithmica 81(4): 1728-1755 (2019) - [c4]Majid Farhadi, Hamideh Bypour, Reza Mortazavi:
An efficient secret sharing-based storage system for cloud-based IoTs. ISCISC 2019: 122-127 - 2018
- [c3]Mahdi Boloursaz Mashhadi, Majid Farhadi, Mahmoud Essalat, Farokh Marvasti:
Low Complexity Heart Rate Measurement from Wearable Wrist-Type Photoplethysmographic Sensors Robust to Motion Artifacts. ICASSP 2018: 921-924 - 2017
- [c2]Reza Alijani, Majid Farhadi, Mohammad Ghodsi, Masoud Seddighin, Ahmad S. Tajik:
Envy-Free Mechanisms with Minimum Number of Cuts. AAAI 2017: 312-318 - 2015
- [c1]Sepideh Aghamolaei, Majid Farhadi, Hamid Zarrabi-Zadeh:
Diversity Maximization via Composable Coresets. CCCG 2015
2000 – 2009
- 2008
- [j1]Majid Farhadi, Marc Perret:
Twisting geometric codes. Finite Fields Their Appl. 14(4): 1091-1100 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
