Circular Coloring the Plane. - Matt DeVos; Javad B. Ebrahimi; Mohammad Ghebleh; Luis A. Goddyn; Bojan Mohar; Reza Naserasr (SIAM J. Discret. Math., 2007)

Vertex domination of generalized Petersen graphs. - B. Javad Ebrahimi; Nafiseh Jahanbakht; Ebadollah S. Mahmoodian (Discret. Math., 2009)

On benefits of vector network coding. - B. Javad Ebrahimi; Christina Fragouli (Allerton, 2010)

Vector network coding algorithms. - B. Javad Ebrahimi; Christina Fragouli (ISIT, 2010)

Network Simplification: The Gaussian diamond network with multiple antennas. - Caner Nazaroglu; B. Javad Ebrahimi; Ayfer Özgür; Christina Fragouli (ISIT, 2011)

Algebraic Algorithms for Vector Network Coding. - B. Javad Ebrahimi; Christina Fragouli (IEEE Trans. Inf. Theory, 2011)

Properties of network polynomials. - B. Javad Ebrahimi; Christina Fragouli (ISIT, 2012)

Combinatiorial algorithms for wireless information flow. - B. Javad Ebrahimi; Christina Fragouli (ACM Trans. Algorithms, 2012)

Algebraic algorithms for network information flow. - Javad B. Ebrahimi (2013)

Linear index coding via graph homomorphism. - Javad B. Ebrahimi; Mahdi Jafari Siavoshani (CoDIT, 2014)

On index coding and graph homomorphism. - Javad B. Ebrahimi; Mahdi Jafari Siavoshani (ITW, 2014)

On linear index coding from graph homomorphism perspective. - Javad B. Ebrahimi; Mahdi Jafari Siavoshani (ITA, 2015)

Successive omniscience. - Chung Chan; Ali Al-Bashabsheh; Javad B. Ebrahimi; Tarik Kaced; Swanand Kadhe; Tie Liu 002; Alex Sprintson; Muxi Yan; Qiaoqiao Zhou (NetCod, 2015)

Multivariate Mutual Information Inspired by Secret-Key Agreement. - Chung Chan; Ali Al-Bashabsheh; Javad B. Ebrahimi; Tarik Kaced; Tie Liu 002 (Proc. IEEE, 2015)

Subdeterminant Maximization via Nonconvex Relaxations and Anti-Concentration. - Javad B. Ebrahimi; Damian Straszak; Nisheeth K. Vishnoi (SIAM J. Comput., 2020)

Heterogeneous Differential Privacy via Graphs. - Sahel Torkamani; Javad B. Ebrahimi; Parastoo Sadeghi; Rafael G. L. D'Oliveira; Muriel Médard (ISIT, 2022)

Entropic Weighted Rank Function. - Mohammad Rashid; Elahe Ghasemi; Javad B. Ebrahimi (IWCIT, 2022)

Differentially Private All-Pairs Shortest Distances for Low Tree-Width Graphs. - Javad B. Ebrahimi; Alireza Tofighi Mohammadi; Fatemeh Kermani (ISNCC, 2023)

Extending Partial Differential Private Mechanisms via Linear Programming. - Javad B. Ebrahimi; Alireza Tofighi Mohammadi (IWCIT, 2024)

Binary Stretch Embedding of Weighted Graphs. - Javad B. Ebrahimi; Mehri Oghbaei Bonab (CoRR, 2024)

Bounds on the Complete Forcing Number of Graphs. - Javad B. Ebrahimi; Aref Nemayande; Elahe Tohidi (CoRR, 2024)

Optimal Binary Differential Privacy via Graphs. - Sahel Torkamani; Javad B. Ebrahimi; Parastoo Sadeghi; Rafael G. L. D'Oliveira; Muriel Médard (IEEE J. Sel. Areas Inf. Theory, 2024)