default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJavad B. Ebrahimi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2026
[j10]Javad B. Ebrahimi
, Babak Ghanbari:
Fractional forcing number of graphs. Discret. Math. 349(2): 114739 (2026)- 2025
- [j9]Javad Ebrahimi Boroojeni, Mehri Oghbaei Bonab:
Binary stretch embedding of weighted graphs. Des. Codes Cryptogr. 93(7): 2741-2760 (2025) - 2024
- [j8]Sahel Torkamani, Javad B. Ebrahimi, Parastoo Sadeghi, Rafael G. L. D'Oliveira, Muriel Médard:
Optimal Binary Differential Privacy via Graphs. IEEE J. Sel. Areas Inf. Theory 5: 162-174 (2024) - [c13]Javad B. Ebrahimi, Alireza Tofighi Mohammadi:
Extending Partial Differential Private Mechanisms via Linear Programming. IWCIT 2024: 1-6 - [i10]Javad B. Ebrahimi, Mehri Oghbaei Bonab:
Binary Stretch Embedding of Weighted Graphs. CoRR abs/2403.09311 (2024) - [i9]Javad B. Ebrahimi, Aref Nemayande, Elahe Tohidi:
Bounds on the Complete Forcing Number of Graphs. CoRR abs/2409.17306 (2024) - 2023
- [c12]Javad B. Ebrahimi, Alireza Tofighi Mohammadi, Fatemeh Kermani:
Differentially Private All-Pairs Shortest Distances for Low Tree-Width Graphs. ISNCC 2023: 1-6 - [i8]Javad B. Ebrahimi, Alireza Tofighi Mohammadi, Fatemeh Kermani:
Differentially Private All-Pairs Shortest Distances for Low Tree-Width Graphs. CoRR abs/2306.05916 (2023) - [i7]Sahel Torkamani, Javad B. Ebrahimi, Parastoo Sadeghi, Rafael G. L. D'Oliveira, Muriel Médard:
Optimal Binary Differential Privacy via Graphs. CoRR abs/2310.20486 (2023) - 2022
- [c11]Sahel Torkamani, Javad B. Ebrahimi, Parastoo Sadeghi, Rafael G. L. D'Oliveira, Muriel Médard:
Heterogeneous Differential Privacy via Graphs. ISIT 2022: 1623-1628 - [c10]Mohammad Rashid, Elahe Ghasemi, Javad B. Ebrahimi:
Entropic Weighted Rank Function. IWCIT 2022: 1-6 - [i6]Sahel Torkamani, Javad B. Ebrahimi, Parastoo Sadeghi, Rafael G. L. D'Oliveira, Muriel Médard:
Heterogeneous Differential Privacy via Graphs. CoRR abs/2203.15429 (2022) - [i5]Mohammad Rashid, Elahe Ghasemi, Javad B. Ebrahimi:
Entropic Weighted Rank Function. CoRR abs/2206.05968 (2022) - 2020
- [j7]Javad B. Ebrahimi, Damian Straszak, Nisheeth K. Vishnoi:
Subdeterminant Maximization via Nonconvex Relaxations and Anti-Concentration. SIAM J. Comput. 49(6): 1249-1270 (2020)
2010 – 2019
- 2017
- [c9]Javad B. Ebrahimi, Damian Straszak, Nisheeth K. Vishnoi:
Subdeterminant Maximization via Nonconvex Relaxations and Anti-Concentration. FOCS 2017: 1020-1031 - [i4]Javad B. Ebrahimi, Damian Straszak, Nisheeth K. Vishnoi:
Subdeterminant Maximization via Nonconvex Relaxations and Anti-concentration. CoRR abs/1707.02757 (2017) - 2016
- [j6]Nazli Besharati, Javad B. Ebrahimi, A. Azadi:
Independence number of generalized Petersen graphs. Ars Comb. 124: 239-255 (2016) - 2015
- [j5]Chung Chan, Ali Al-Bashabsheh, Javad B. Ebrahimi, Tarik Kaced, Tie Liu:
Multivariate Mutual Information Inspired by Secret-Key Agreement. Proc. IEEE 103(10): 1883-1913 (2015) - [c8]Javad B. Ebrahimi, Mahdi Jafari Siavoshani:
On linear index coding from graph homomorphism perspective. ITA 2015: 220-229 - [c7]Chung Chan, Ali Al-Bashabsheh, Javad B. Ebrahimi, Tarik Kaced, Swanand Kadhe, Tie Liu, Alex Sprintson, Muxi Yan, Qiaoqiao Zhou:
Successive omniscience. NetCod 2015: 21-25 - 2014
- [c6]Javad B. Ebrahimi, Mahdi Jafari Siavoshani:
Linear index coding via graph homomorphism. CoDIT 2014: 158-163 - [c5]Javad B. Ebrahimi, Mahdi Jafari Siavoshani:
On index coding and graph homomorphism. ITW 2014: 541-545 - [i3]Javad B. Ebrahimi, Mahdi Jafari Siavoshani:
On Index Coding and Graph Homomorphism. CoRR abs/1408.7019 (2014) - [i2]Javad B. Ebrahimi, Mahdi Jafari Siavoshani:
Linear Index Coding via Graph Homomorphism. CoRR abs/1410.1371 (2014) - 2013
- [b1]Javad B. Ebrahimi:
Algebraic algorithms for network information flow. EPFL, Switzerland, 2013 - 2012
- [j4]B. Javad Ebrahimi, Christina Fragouli:
Combinatiorial algorithms for wireless information flow. ACM Trans. Algorithms 9(1): 8:1-8:33 (2012) - [c4]B. Javad Ebrahimi, Christina Fragouli:
Properties of network polynomials. ISIT 2012: 1306-1310 - 2011
- [j3]B. Javad Ebrahimi, Christina Fragouli:
Algebraic Algorithms for Vector Network Coding. IEEE Trans. Inf. Theory 57(2): 996-1007 (2011) - [c3]Caner Nazaroglu, B. Javad Ebrahimi, Ayfer Özgür, Christina Fragouli:
Network Simplification: The Gaussian diamond network with multiple antennas. ISIT 2011: 79-83 - 2010
- [c2]B. Javad Ebrahimi, Christina Fragouli:
On benefits of vector network coding. Allerton 2010: 1526-1533 - [c1]B. Javad Ebrahimi, Christina Fragouli:
Vector network coding algorithms. ISIT 2010: 2408-2412
2000 – 2009
- 2009
- [j2]B. Javad Ebrahimi, Nafiseh Jahanbakht, Ebadollah S. Mahmoodian:
Vertex domination of generalized Petersen graphs. Discret. Math. 309(13): 4355-4361 (2009) - [i1]B. Javad Ebrahimi, Christina Fragouli:
Combinatiorial Algorithms for Wireless Information Flow. CoRR abs/0909.4808 (2009) - 2007
- [j1]Matt DeVos, Javad B. Ebrahimi, Mohammad Ghebleh, Luis A. Goddyn, Bojan Mohar, Reza Naserasr:
Circular Coloring the Plane. SIAM J. Discret. Math. 21(2): 461-465 (2007)
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 2025-09-09 03:01 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:
