Export 7 results:
Search results for field_research_area:7
Filters: 1 is biblio_year:2015 and Author is Ariful Azad  [Reset Search]
2021
J. Langguth, A. Tumanis and A. Azad. Incremental Clustering Algorithms for Massive Dynamic Graphs In International Conference on Data Mining Workshops (ICDMW). Auckland, New Zealand : IEEE, 2021.
2018
J. Langguth, A. Azad, A. Buluc, X. Li and X. Wang. A distributed - memory parallel approximation of maximum weight perfect bipartite matching In Sparse Days 2018, Toulouse, France., 2018.
J. Langguth, A. Azad, A. Buluc, X. Li and X. Wang. A distributed - memory parallel approximation of maximum weight perfect bipartite matching In Pacific Northwest National Laboratory, Richland, WA, USA., 2018.
A. Azad, A. Buluc, X. Li, X. Wang and J. Langguth. "A Distributed-Memory Approximation Algorithm for Maximum Weight Perfect Bipartite Matching." SIAM Journal on Scientific Computing (2018).
X. Li, A. Azad, A. Buluc, P. Ghysels, J. Langguth and X. Wang. ExaGraph Collaboration with STRUMPACK/SuperLU: Factorization-Based Sparse Solvers and Preconditioners for Exascale. ECP Website: Exascale Computing Project (ECP), 2018.
2015
M. Halappanavar, A. Pothen, A. Azad, F. Manne, J. Langguth and A. M. Khan. "Codesign Lessons Learned from Implementing Graph Matching on Multithreaded Architectures." IEEE Computer 48 (2015): 46-55.
2014
J. Langguth, A. Azad, M. Halappanavar and F. Manne. "On Parallel Push-Relabel Based Algorithms for Bipartite Maximum Matching." Parallel Computing 40, no. 7 (2014): 289-308.