Journal Papers

  1. H. Catanese, K. Brayton and A.H. Gebremedhin. A Nearest-Neighbors Network Model for Sequence Data Reveals New Insight into Genotype Distribution of a Pathogen, BMC Bioinformatics (2018) 19:475.
  2. R. Saeedi and A.H. Gebremedhin. A Signal-level Transfer Learning Framework for Autonomous Reconfiguration of Wearable Systems, IEEE Transactions on Mobile computing, 2018. DOI: 10.1109/TMC.2018.2878673.
  3. Yunshu Du, Assefaw H. Gebremedhin, and Matthew E. Taylor. Analysis of University Fitness Center Data Uncovers Interesting Patterns, Enables Prediction. IEEE Transactions on Knowledge and Data Engineering, 2018.
  4. H. Catanese, C. Hauser and A.H. Gebremedhin. Evaluation of Native and Transfer Students’ Success in a Computer Science Course. ACM Inroads, 9(2), 53–57, 2018.
  5. H. Lu, M. Halappanavar, D. Chavarri-a-Miranda, A.H. Gebremedhin, A. Panyala and A. Kalyanaraman, Algorithms for Balanced Graph Colorings with Applications in Parallel Computing, IEEE Transactions on Parallel and Distributed Systems, 28(5), 1240–1256, 2017.
  6. P. Hove, M.E. Chaisi, K.A. Brayton, H. Ganesan, H.N. Catanese, M.S. Mtshali, A.M. Mutshembele, M.C. Oosthuizen, and N.E. Collins, Co-infections with multiple genotypes of Anaplasma marginale in cattle indicate pathogen diversity, Parasites & Vectors (2018).
  7. Z.T.H. Khumalo, H.N. Catanese, N. Leisching, P. Hove, N.E. Collins, M.E. Chaisit, A.H. Gebremedhin, M.C. Oosthuizen and K.A. Brayton, Characterization of Anaplasma marginale subspecies centrale using msp1aS genotyping reveals wildfire reservoir, Journal of Clinical Microbiology 2016 54:10, 2503-2512.
  8. H.N. Catanese, K.A. Brayton and A.H. Gebremedhin, RepeatAnalyzer: a tool for analysing and managing short-sequence repeat data , BMC Genomics 2016 17:422. DOI: 10.1186/s12864-016-2686-2
  9. M. Wang, A.H. Gebremedhin and A. Pothen, Capitalizing on Live Variables: New Algorithms for Efficient Hessian Computation via Automatic Differentiation, Mathematical Programming Computation , 8(4), 393-433, 2016. DOI = 10.1007/s12532-016-0100-3.
  10. R.A. Rossi, D.F. Gleich and A.H. Gebremedhin, Parallel Maximum Clique Algorithms with Applications to Network Analysis, SIAM Journal on Scientific Cpmputing, 37(5), pages C589–C618, 2015.
  11. B. Pattabiraman, M.A. Patwary, A.H. Gebremedhin, W. Liao and A. Choudhary, Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection, Internet Mathematics, Vol 11, No 4-5, pp 421-448, 2015.
  12. A.H. Gebremedhin, D. Nguyen, M.M.A. Patwary and A. Pothen, ColPack: Software for Graph Coloring and Related Problems in Scientific Computing, ACM Transactions on Mathematical Software, Vol 40, No 1, pp 1–31, 2013. (http://dl.acm.org/citation.cfm?doid=2513109.2513110)
  13. U. Catalyurek, J. Feo, A.H. Gebremedhin, M. Halappanavar and A. Pothen, Graph Coloring Algorithms for Multi-core and Massively Multithreaded Architectures, Parallel Computing 38 (2012), 576-594.
  14. D. Bozdag, U. Catalyurek, A. Gebremedhin, F. Manne, E. Boman and F. Ozguner, Distributed-memory Parallel Algorithms for Distance-2 Coloring and Related Problems in Derivative Computation, SIAM Journal on Scientific Computing Vol 32, Issue 4, pp 2418–2446, 2010.
  15. A. Gebremedhin, A. Pothen, A. Tarafdar and A. Walther, Efficient Computation of Sparse Hessians Using Coloring and Automatic Differentiation, INFORMS Journal on Computing Vol 21, No 2, pp 209–223, 2009.
  16. D. Bozdag, A. Gebremedhin, F. Manne, E. Boman and U. Catalyurek, A framework for Scalable Greedy Coloring on Distributed Memory Parallel Computers,Journal of Parallel and Distributed Computing Vol 68, No 4, pp 515–535, 2008.
  17. A. Gebremedhin, A. Tarafdar, F. Manne and A. Pothen, New Acyclic and Star Coloring Algorithms with Applications to Hessian Computation, SIAM Journal on Scientific Computing, Vol 29, No 3, pp 1042–1072, 2007.
  18. A. Gebremedhin, M. Essaidi, I. Guerin-Lassous, J. Gustedt, J.A. Telle, PRO: A Model for the Design and Analysis of Efficient and Scalable Parallel Algorithms, Nordic Journal of Computing, Vol 13, pp 1–25, 2006.
  19. A. Gebremedhin, F. Manne and A. Pothen, What Color Is Your Jacobian? Graph Coloring for Computing Derivatives, SIAM Review, Vol 47, No 4, pp 629–705, 2005.
  20. A. Gebremedhin, I.Guerrin-Lassous, J. Gustedt and J.A. Telle, Graph Coloring on Coarse Grained Multicomputers, Discrete Applied Mathematics, Vol 131, No 1, pp 179–198, 2003.
  21. A. Gebremedhin and F. Manne, Scalable Parallel Graph Coloring Algorithms, Concurrency: Practice and Expereince Vol 12, pp 1131–1146, 2000.