- Parallel Graph Coloring Assefaw Hadish Gebremedhin
- Ordering for Coloring and More Assefaw H. Gebremedhin
- Copyright by SIAM. Unauthorized reproduction of this article is prohibited. SIAM J. SCI. COMPUT. c 2010 Society for Industrial and Applied Mathematics
- INFORMS Journal on Computing Vol. 21, No. 2, Spring 2009, pp. 209223
- J. Parallel Distrib. Comput. 68 (2008) 515535 www.elsevier.com/locate/jpdc
- SIAM J. SCI. COMPUT. c 2007 Society for Industrial and Applied Mathematics Vol. 29, No. 3, pp. 10421072
- SIAM REVIEW c 2005 Society for Industrial and Applied Mathematics Vol. 47, No. 4, pp. 629705
- Discrete Applied Mathematics 131 (2003) 179198 www.elsevier.com/locate/dam
- CONCURRENCY: PRACTICE AND EXPERIENCE Concurrency: Pract. Exper. 2000; 12:11311146
- Distributed-Memory Parallel Algorithms for Matching and Coloring Umit V. C atalyurek, Florin Dobrian, Assefaw Gebremedhin, Mahantesh Halappanavar, Alex Pothen
- Procedia Computer Science 00 (2011) 110 Procedia Computer
- Exploiting Sparsity in Jacobian Computation via Coloring and Automatic Differentiation
- Combinatorial algorithms enabling computational science: tales from the front
- Speeding up Parallel Graph Coloring Assefaw H. Gebremedhin1
- Parallel Distance-k Coloring Algorithms for Numerical Optimization
- PRO: a Model for Parallel Resource-Optimal Computation Assefaw Hadish Gebremedhin
- Practical Parallel Algorithms for Graph Coloring Problems in
- Multithreaded Algorithms for Graph Coloring Assefaw Gebremedhin
- The Enabling Power of Graph Coloring Algorithms in Automatic Differentiation and
- Nordic Journal of Computing 13(2006), 125. PRO: A MODEL FOR THE DESIGN AND ANALYSIS OF
- Combinatorial Algorithms for Computational Science and Engineering
- Efficient Computation of Sparse Hessians using Automatic Differentiation
- Graph Coloring on a Coarse Grained Multiprocessor (extended abstract)
- New Multithreaded Ordering and Coloring Algorithms for Multicore Architectures
