Assefaw Hadish Gebremedhin

Ryan A. Rossi, David F. Gleich, Assefaw Hadish Gebremedhin, Md. Mostofa Ali Patwary: A Fast Parallel Maximum Clique Algorithm for Large Sparse Graphs and Temporal Strong Components. CoRR abs/1302.6256 (2013)

Ümit V. Çatalyürek, John Feo, Assefaw Hadish Gebremedhin, Mahantesh Halappanavar, Alex Pothen: Graph coloring algorithms for multi-core and massively multithreaded architectures. Parallel Computing 38(10-11): 576-594 (2012)

Ümit V. Çatalyürek, John Feo, Assefaw Hadish Gebremedhin, Mahantesh Halappanavar, Alex Pothen: Graph Coloring Algorithms for Muti-core and Massively Multithreaded Architectures. CoRR abs/1205.3809 (2012)

Bharath Pattabiraman, Md. Mostofa Ali Patwary, Assefaw Hadish Gebremedhin, Wei-keng Liao, Alok N. Choudhary: Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs. CoRR abs/1209.5818 (2012)

Ryan A. Rossi, David F. Gleich, Assefaw Hadish Gebremedhin, Md. Mostofa Ali Patwary: What if CLIQUE were fast? Maximum Cliques in Information Networks and Strong Components in Temporal Networks. CoRR abs/1210.5802 (2012)

Sri Hari Krishna Narayanan, Boyana Norris, Paul D. Hovland, Duc C. Nguyen, Assefaw Hadish Gebremedhin: Sparse Jacobian Computation Using ADIC2 and ColPack. Procedia CS 4: 2115-2123 (2011)

Md. Mostofa Ali Patwary, Assefaw Hadish Gebremedhin, Alex Pothen: New Multithreaded Ordering and Coloring Algorithms for Multicore Architectures. Euro-Par (2) 2011: 250-262

Ümit V. Çatalyürek, Florin Dobrian, Assefaw Hadish Gebremedhin, Mahantesh Halappanavar, Alex Pothen: Distributed-Memory Parallel Algorithms for Matching and Coloring. IPDPS Workshops 2011: 1971-1980

Assefaw Hadish Gebremedhin, Arijit Tarafdar, Alex Pothen, Andrea Walther: Efficient Computation of Sparse Hessians Using Coloring and Automatic Differentiation. INFORMS Journal on Computing 21(2): 209-223 (2009)

Doruk Bozdag, Assefaw Hadish Gebremedhin, Fredrik Manne, Erik G. Boman, Ümit V. Çatalyürek: A framework for scalable greedy coloring on distributed-memory parallel computers. J. Parallel Distrib. Comput. 68(4): 515-535 (2008)

Assefaw Hadish Gebremedhin, Arijit Tarafdar, Fredrik Manne, Alex Pothen: New Acyclic and Star Coloring Algorithms with Application to Computing Hessians. SIAM J. Scientific Computing 29(3): 1042-1072 (2007)

Assefaw Hadish Gebremedhin, Mohamed Essaïdi, Isabelle Guérin Lassous, Jens Gustedt, Jan Arne Telle: PRO: A Model for the Design and Analysis of Efficient and Scalable Parallel Algorithms. Nord. J. Comput. 13(4): 215-239 (2006)

Erik G. Boman, Doruk Bozdag, Ümit V. Çatalyürek, Assefaw Hadish Gebremedhin, Fredrik Manne: A Scalable Parallel Graph Coloring Algorithm for Distributed Memory Computers. Euro-Par 2005: 241-251

Doruk Bozdag, Ümit V. Çatalyürek, Assefaw Hadish Gebremedhin, Fredrik Manne, Erik G. Boman, Füsun Özgüner: A Parallel Distance-2 Graph Coloring Algorithm for Distributed Memory Computers. HPCC 2005: 796-806

Assefaw Hadish Gebremedhin, Fredrik Manne, Tom Woods: Speeding up Parallel Graph Coloring. PARA 2004: 1079-1088

Assefaw Hadish Gebremedhin, Isabelle Guérin Lassous, Jens Gustedt, Jan Arne Telle: Graph coloring on coarse grained multicomputers. Discrete Applied Mathematics 131(1): 179-198 (2003)

Assefaw Hadish Gebremedhin, Fredrik Manne, Alex Pothen: Parallel Distance-k Coloring Algorithms for Numerical Optimization. Euro-Par 2002: 912-921

Assefaw Hadish Gebremedhin, Isabelle Guérin Lassous, Jens Gustedt, Jan Arne Telle: PRO: A Model for Parallel Resource-Optimal Computation. HPCS 2002: 106-113

Tor Sørevik, Fredrik Manne, Randi Moe, Assefaw Hadish Gebremedhin (Eds.): Applied Parallel Computing, New Paradigms for HPC in Industry and Academia, 5th International Workshop, PARA 2000 Bergen, Norway, June 18-20, 2000 Proceedings. Lecture Notes in Computer Science 1947, Springer 2001, isbn 3-540-41729-X

Assefaw Hadish Gebremedhin, Fredrik Manne: Scalable parallel graph coloring algorithms. Concurrency - Practice and Experience 12(12): 1131-1146 (2000)

Assefaw Hadish Gebremedhin, Isabelle Guérin Lassous, Jens Gustedt, Jan Arne Telle: Graph Coloring on a Coarse Grained Multiprocessor. WG 2000: 184-195