top of page

Publication

 

CONFERENCE PAPERS
 

 

 

  • C. Chan, A. Al-Bashabsheh, J. B. Ebrahimi, T. Kaced, S. Kadhe, T. Liu, A. Sprintson, M. Yan, Q. Zhou, "Successive omniscience", Proc. IEEE Information Theory Workshop (ITW) 2015. 

  • J. B. Ebrahimi and M. Jafari, “On index coding and graph homomorphism”, To appear in Proc. IEEE Information Theory Workshop (ITW), Tasmania, Australia, 2014.

 

  • J. B. Ebrahimi, M. Jafari Siavoshani, "Linear Index Coding via Graph Homomorphism" CoRR abs/1410.1371 (2014)

 

  • J. B. Ebrahimi and C. Fragouli, “Properties of network polynomials”, Proc. IEEE International Symposium on Information Theory (ISIT), Boston, USA, 2012.

 

 

  • C. Nazaroglu, J. B. Ebrahimi, A. Ozgur and C. Fragouli, “Network simplification: The Gaussian diamond network with multiple antennas”, Proc. IEEE International Symposium on Information Theory (ISIT), St Petersburg, Russia, 2011.

 

 

  • J. Ebrahimi and C. Fragouli, “On the benefits of vector network coding”, Proc. 48th Annual Allerton Conference on Communication, Control, and Computing, Urbana, USA, 2010.

 

 

  • J. Ebrahimi and C. Fragouli, “Vector network coding”, Proc. IEEE International Symposium on Information Theory (ISIT), Austin, USA, 2010.

 

 

  • J. Ebrahimi and C. Fragouli, “Multicasting algorithms for deterministic networks”, Proc. IEEE Information Theory Workshop (ITW), Cairo, Egypt, 2010.

 

 

  • J. Ebrahimi, B. Mohar and A. Sheikh Ahmady, “On the sum of two largest eigenvalues of graphs”, 38th Annual Iranian Conference of Mathematics, Zanjan, Iran, 2007.

 

 

  • J. Ebrahimi, N. Jahanbakht and M. Mahmoodian, “Vertex domination of generalized Petersen graphs”, 36th Annual Iranian Conference of Mathematics, Yazd, Iran, 2005.

 

 

 

JOURNAL PUBLICATIONS

 

 

  • C. Chan, A. Al-Bashabsheh, J. B. Ebrahimi, T. Kaced and T. Liu, "Multivariate mutual information inspired by secret key agreement", Proceedings of the IEEE, accepted 2015.

 

  • J. B. Ebrahimi and C. Fragouli, “Combinatorial algorithms for wireless information flow”, ACM Transactions in Algorithms, Volume 9, Issue 1, December 2012

 

 

  • J. B. Ebrahimi and C. Fragouli, “Algebraic algorithms for vector network coding”, IEEE Transactions on Information Theory, Volume 57, pp 996–1007, February 2011.

 

 

  • J. B. Ebrahimi, N. Besharati and A. Azadi, “Independence number of generalized Petersen graphs”, Ars Combinotoria, accepted, 2011.

 

 

  • J. Ebrahimi, N. Jahanbakht and M. Mahmoodian, “Vertex domination ofgeneralized Petersen graphs”, Discrete Mathematics, Volume 309, Issue 13, pp 4355–4361, July 2009.

 

 

  • J. Ebrahimi, V. Nikiforov, B. Mohar and A. Sheikh Ahmady, “On the sumof two largest eigenvalues of graphs and symmetric matrices”, Journal of Linear Algebra and its Applications, Volume 429, Issues 11-12, pp 2781–2787, December 2008.

 

 

  • M. Devos, J. Ebrahimi, M. Ghebleh, L. Goddyn, B. Mohar and R. Naserasr, “Circular coloring the plane”, SIAM Journal on Discrete Mathematics, Volume 2, pp 461–465, April 2007.

 

 

  • S. Akbari, A. Alipour, J. Ebrahimi, E. Ghorbani and M. Mirjalalieh Shirazi, “Some relations between rank of a graph and its complement”, Journal of Linear Algebra and its Applications, Volume 422, Issue 1, pp 341–347, April 2007.

 

bottom of page