Seguir
Assefaw Gebremedhin
Título
Citado por
Citado por
Ano
What color is your Jacobian? Graph coloring for computing derivatives
AH Gebremedhin, F Manne, A Pothen
SIAM review 47 (4), 629-705, 2005
4362005
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
1572018
Scalable parallel graph coloring algorithms
AH Gebremedhin, F Manne
Concurrency: Practice and Experience 12 (12), 1131-1146, 2000
1232000
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
1192014
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
1142013
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
1132015
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
113*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
1082012
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
872009
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
872007
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
842008
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
802015
A scalable parallel graph coloring algorithm for distributed memory computers
EG Boman, D Bozdağ, U Catalyurek, AH Gebremedhin, F Manne
Euro-Par 2005 Parallel Processing: 11th International Euro-Par Conference …, 2005
752005
MPC-based decentralized voltage control in power distribution systems with EV and PV coordination
L Wang, A Dubey, AH Gebremedhin, AK Srivastava, N Schulz
IEEE Transactions on Smart Grid 13 (4), 2908-2919, 2022
622022
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
492005
An adaptive machine learning framework for behind-the-meter load/PV disaggregation
R Saeedi, SK Sadanandan, AK Srivastava, KL Davies, AH Gebremedhin
IEEE Transactions on Industrial Informatics 17 (10), 7060-7069, 2021
472021
Synthetic sensor data generation for health applications: A supervised deep learning approach
S Norgaard, R Saeedi, K Sasani, AH Gebremedhin
2018 40th Annual International Conference of the IEEE Engineering in …, 2018
472018
RepeatAnalyzer: a tool for analysing and managing short-sequence repeat data
HN Catanese, KA Brayton, AH Gebremedhin
BMC genomics 17, 1-13, 2016
432016
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
422011
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
412013
O sistema não pode executar a operação agora. Tente novamente mais tarde.
Artigos 1–20