Obserwuj
Assefaw Gebremedhin
Tytuł
Cytowane przez
Cytowane przez
Rok
What color is your Jacobian? Graph coloring for computing derivatives
AH Gebremedhin, F Manne, A Pothen
SIAM review 47 (4), 629-705, 2005
3632005
Scalable parallel graph coloring algorithms
AH Gebremedhin, F Manne
Concurrency: Practice and Experience 12 (12), 1131-1146, 2000
1122000
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
1042014
Fast algorithms for the maximum clique problem on massive sparse graphs
B Pattabiraman, MMA Patwary, AH Gebremedhin, W Liao, A Choudhary
Algorithms and Models for the Web Graph: 10th International Workshop, WAW …, 2013
1022013
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
972012
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
912013
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
842018
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
832015
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
792009
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
792007
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
762008
A scalable parallel graph coloring algorithm for distributed memory computers
EG Boman, D Bozdag, U Catalyurek, AH Gebremedhin, F Manne
Euro-Par 5, 241-251, 2005
662005
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
582015
A parallel distance-2 graph coloring algorithm for distributed memory computers
D Bozdağ, U Catalyurek, AH Gebremedhin, F Manne, EG Boman, ...
High Performance Computing and Communications: First International …, 2005
452005
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
372011
Parallel Distance-k Coloring Algorithms for Numerical Optimization
AH Gebremedhin, F Manne, A Pothen
Euro-Par 2002 Parallel Processing: 8th International Euro-Par Conference …, 2002
372002
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
362013
RepeatAnalyzer: a tool for analysing and managing short-sequence repeat data
HN Catanese, KA Brayton, AH Gebremedhin
BMC genomics 17 (1), 1-13, 2016
332016
Distributed-memory parallel algorithms for distance-2 coloring and related problems in derivative computation
D Bozdağ, ÜV Çatalyürek, AH Gebremedhin, F Manne, EG Boman, ...
SIAM Journal on Scientific Computing 32 (4), 2418-2446, 2010
312010
Parallel maximum clique algorithms with applications to network analysis and storage
RA Rossi, DF Gleich, AH Gebremedhin, M Patwary, M Ali
arXiv preprint arXiv:1302.6256, 2013
272013
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20