default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBabak Behsaz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i2]Wei-Hung Weng, Sebastien Baur, Mayank Daswani, Christina Chen, Lauren Harrell, Sujay Kakarmath, Mariam Jabara, Babak Behsaz, Cory Y. McLean, Yossi Matias, Gregory S. Corrado, Shravya Shetty, Shruthi Prabhakara, Yun Liu, Goodarz Danaei, Diego Ardila:
Predicting Cardiovascular Disease Risk using Photoplethysmography and Deep Learning. CoRR abs/2305.05648 (2023)
2010 – 2019
- 2019
- [j7]Babak Behsaz, Zachary Friggstad, Mohammad R. Salavatipour
, Rohit Sivakumar:
Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median. Algorithmica 81(3): 1006-1030 (2019) - 2018
- [j6]Sara Ahmadian, Babak Behsaz, Zachary Friggstad, Amin Jorati, Mohammad R. Salavatipour, Chaitanya Swamy:
Approximation Algorithms for Minimum-Load k-Facility Location. ACM Trans. Algorithms 14(2): 16:1-16:29 (2018) - 2016
- [j5]Babak Behsaz, Mohammad R. Salavatipour, Zoya Svitkina:
New Approximation Algorithms for the Unsplittable Capacitated Facility Location Problem. Algorithmica 75(1): 53-83 (2016) - 2015
- [j4]Babak Behsaz, Mohammad R. Salavatipour:
On Minimum Sum of Radii and Diameters Clustering. Algorithmica 73(1): 143-165 (2015) - [c8]Babak Behsaz, Zachary Friggstad, Mohammad R. Salavatipour, Rohit Sivakumar:
Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median. ICALP (1) 2015: 116-128 - 2014
- [c7]Sara Ahmadian, Babak Behsaz, Zachary Friggstad, Amin Jorati, Mohammad R. Salavatipour, Chaitanya Swamy:
Approximation Algorithms for Minimum-Load k-Facility Location. APPROX-RANDOM 2014: 17-33 - [c6]Babak Behsaz, Mike H. MacGregor:
Minimizing transmit power consumption in multi-level WSNs for environmental monitoring. WCNC 2014: 3046-3051 - 2013
- [c5]Babak Behsaz, Mike H. MacGregor:
Near optimal design of multi-level WSNs for environmental monitoring. LCN 2013: 348-355 - 2012
- [c4]Babak Behsaz, Mohammad R. Salavatipour:
On Minimum Sum of Radii and Diameters Clustering. SWAT 2012: 71-82 - [c3]Babak Behsaz, Mohammad R. Salavatipour, Zoya Svitkina:
New Approximation Algorithms for the Unsplittable Capacitated Facility Location Problem. SWAT 2012: 237-248 - 2010
- [i1]Babak Behsaz, Pooya Hatami, Ebadollah S. Mahmoodian:
On minimum vertex cover of generalized Petersen graphs. CoRR abs/1008.3208 (2010)
2000 – 2009
- 2009
- [j3]Babak Behsaz, Pawel Gburzynski, Mike H. MacGregor:
Transport-independent fairness. Comput. Networks 53(14): 2444-2457 (2009) - [j2]Babak Behsaz, Pooya Hatami:
Measure preserving homomorphisms and independent sets in tensor graph powers. Discret. Math. 309(4): 955-958 (2009) - 2008
- [j1]Babak Behsaz, Pooya Hatami, Ebadollah S. Mahmoodian:
On minimum vertex covers of generalized Petersen graphs. Australas. J Comb. 40: 253-264 (2008) - 2007
- [c2]Babak Behsaz, Reza Safabakhsh:
NEFRL: A New Neuro-Fuzzy System for Episodic Reinforcement Learning Tasks. FBIT 2007: 819-826 - 2006
- [c1]Babak Behsaz, Pooya Jaferian, Mohammad Reza Meybodi:
Comparison of Global Computing with Grid Computing. PDCAT 2006: 531-534
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-04-25 05:51 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:
