default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAkbar Rafiey
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c9]Akbar Rafiey:
Decomposable Submodular Maximization in Federated Setting. ICML 2024- [c8]Pavol Hell, Akbar Rafiey, Arash Rafiey:
Bi-arc Digraphs: Recognition Algorithm and Applications. LATIN (2) 2024: 31-45 - [i10]Akbar Rafiey:
Decomposable Submodular Maximization in Federated Setting. CoRR abs/2402.00138 (2024) - 2023
- [j1]MohammadMahdi Jahanara, Vahid R. Asadi
, Marco Carmosino, Akbar Rafiey, Bahar Salamatian:
Private Boosted Decision Trees via Smooth Re-Weighting. J. Priv. Confidentiality 13(1) (2023) - [c7]Jeff Kinne, Akbar Rafiey, Arash Rafiey, Mohammad Sorkhpar:
Vertex Ordering with Precedence Constraints. FCT 2023: 304-317 - 2022
- [c6]Akbar Rafiey, Yuichi Yoshida:
Sparsification of Decomposable Submodular Functions. AAAI 2022: 10336-10344 - [c5]Andrei A. Bulatov, Akbar Rafiey:
The Ideal Membership Problem and Abelian Groups. STACS 2022: 18:1-18:16 - [c4]Andrei A. Bulatov, Akbar Rafiey:
On the complexity of CSP-based ideal membership problems. STOC 2022: 436-449 - [i9]Andrei A. Bulatov, Akbar Rafiey:
The Ideal Membership Problem and Abelian Groups. CoRR abs/2201.05218 (2022) - [i8]Akbar Rafiey, Yuichi Yoshida:
Sparsification of Decomposable Submodular Functions. CoRR abs/2201.07289 (2022) - [i7]Vahid R. Asadi, Marco L. Carmosino, MohammadMahdi Jahanara, Akbar Rafiey, Bahar Salamatian:
Private Boosted Decision Trees via Smooth Re-Weighting. CoRR abs/2201.12648 (2022) - 2020
- [c3]Akbar Rafiey, Yuichi Yoshida:
Fast and Private Submodular and k-Submodular Functions Maximization with Matroid Constraints. ICML 2020: 7887-7897 - [i6]Akbar Rafiey, Yuichi Yoshida:
Fast and Private Submodular and k-Submodular Functions Maximization with Matroid Constraints. CoRR abs/2006.15744 (2020) - [i5]Andrei A. Bulatov, Akbar Rafiey:
On the Complexity of CSP-based Ideal Membership Problems. CoRR abs/2011.03700 (2020)
2010 – 2019
- 2019
- [c2]Akbar Rafiey, Arash Rafiey, Thiago Santos:
Toward a Dichotomy for Approximation of H-Coloring. ICALP 2019: 91:1-91:16 - [i4]Akbar Rafiey, Arash Rafiey, Thiago Santos:
Toward a Dichotomy for Approximation of $H$-coloring. CoRR abs/1902.02201 (2019) - 2018
- [i3]Yifan Jing, Akbar Rafiey:
Counting maximal near perfect matchings in quasirandom and dense graphs. CoRR abs/1807.04803 (2018) - 2015
- [c1]Binay K. Bhattacharya, Ante Custic, Akbar Rafiey, Arash Rafiey, Vladyslav Sokol:
Approximation Algorithms for Generalized MST and TSP in Grid Clusters. COCOA 2015: 110-125 - [i2]Binay K. Bhattacharya, Ante Custic, Akbar Rafiey, Arash Rafiey, Vladyslav Sokol:
Approximation Algorithms for Generalized MST and TSP in Grid Clusters. CoRR abs/1507.04438 (2015) - [i1]Jeff Kinne, Ján Manuch, Akbar Rafiey, Arash Rafiey:
Ordering with precedence constraints and budget minimization. CoRR abs/1507.04885 (2015)
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-10-07 21:20 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:
