What color is your Jacobian? Graph coloring for computing derivatives AH Gebremedhin, F Manne, A Pothen SIAM review 47 (4), 629-705, 2005 | 336 | 2005 |

Scalable parallel graph coloring algorithms AH Gebremedhin, F Manne Concurrency: Practice and Experience 12 (12), 1131-1146, 2000 | 100 | 2000 |

Combinatorial scientific computing U Naumann, O Schenk CRC Press, 2012 | 96 | 2012 |

Fast algorithms for the maximum clique problem on massive sparse graphs B Pattabiraman, MMA Patwary, AH Gebremedhin, W Liao, A Choudhary International Workshop on Algorithms and Models for the Web-Graph, 156-169, 2013 | 92 | 2013 |

Fast maximum clique algorithms for large graphs RA Rossi, DF Gleich, AH Gebremedhin, MMA Patwary Proceedings of the 23rd International Conference on World Wide Web, 365-366, 2014 | 85 | 2014 |

Colpack: Software for graph coloring and related problems in scientific computing AH Gebremedhin, D Nguyen, MMA Patwary, A Pothen ACM Transactions on Mathematical Software (TOMS) 40 (1), 1-31, 2013 | 84 | 2013 |

Graph coloring algorithms for multi-core and massively multithreaded architectures ÜV Çatalyürek, J Feo, AH Gebremedhin, M Halappanavar, A Pothen Parallel Computing 38 (10-11), 576-594, 2012 | 83 | 2012 |

Efficient computation of sparse Hessians using coloring and automatic differentiation AH Gebremedhin, A Tarafdar, A Pothen, A Walther INFORMS Journal on Computing 21 (2), 209-223, 2009 | 79 | 2009 |

New acyclic and star coloring algorithms with application to computing Hessians AH Gebremedhin, A Tarafdar, F Manne, A Pothen SIAM Journal on Scientific Computing 29 (3), 1042-1072, 2007 | 74 | 2007 |

Computing active subspaces with Monte Carlo P Constantine, D Gleich arXiv preprint arXiv:1408.0545, 2014 | 69 | 2014 |

A framework for scalable greedy coloring on distributed-memory parallel computers D Bozdağ, AH Gebremedhin, F Manne, EG Boman, UV Catalyurek Journal of Parallel and Distributed Computing 68 (4), 515-535, 2008 | 68 | 2008 |

A scalable parallel graph coloring algorithm for distributed memory computers EG Boman, D Bozdağ, U Catalyurek, AH Gebremedhin, F Manne European Conference on Parallel Processing, 241-251, 2005 | 62 | 2005 |

Parallel maximum clique algorithms with applications to network analysis RA Rossi, DF Gleich, AH Gebremedhin SIAM Journal on Scientific Computing 37 (5), C589-C616, 2015 | 59 | 2015 |

Fast algorithms for the maximum clique problem on massive graphs with applications to overlapping community detection B Pattabiraman, MMA Patwary, AH Gebremedhin, W Liao, A Choudhary Internet Mathematics 11 (4-5), 421-448, 2015 | 39 | 2015 |

A parallel distance-2 graph coloring algorithm for distributed memory computers D Bozdağ, U Catalyurek, AH Gebremedhin, F Manne, EG Boman, ... International conference on high performance computing and communications …, 2005 | 37 | 2005 |

Parallel Distance-*k* Coloring Algorithms for Numerical OptimizationAH Gebremedhin, F Manne, A Pothen European Conference on Parallel Processing, 912-921, 2002 | 36 | 2002 |

Distributed louvain algorithm for graph community detection S Ghosh, M Halappanavar, A Tumeo, A Kalyanaraman, H Lu, ... 2018 IEEE international parallel and distributed processing symposium (IPDPS …, 2018 | 34 | 2018 |

A fast parallel maximum clique algorithm for large sparse graphs and temporal strong components RA Rossi, DF Gleich, AH Gebremedhin, MMA Patwary, M Ali CoRR, abs/1302.6256, 2013 | 33 | 2013 |

Distributed-memory parallel algorithms for matching and coloring ÜV Çatalyürek, F Dobrian, A Gebremedhin, M Halappanavar, A Pothen 2011 IEEE International Symposium on Parallel and Distributed Processing …, 2011 | 33 | 2011 |

Exploiting sparsity in jacobian computation via coloring and automatic differentiation: a case study in a simulated moving bed process AH Gebremedhin, A Pothen, A Walther Advances in automatic differentiation, 327-338, 2008 | 27 | 2008 |