• Approximation algorithms in combinatorial scientific computing 

      Pothen, Alex; Ferdous, SM; Manne, Fredrik (Journal article; Peer reviewed, 2019)
      We survey recent work on approximation algorithms for computing degreeconstrained subgraphs in graphs and their applications in combinatorial scientific computing. The problems we consider include maximization versions of ...
    • Community Detection on the GPU 

      Naim, Md.; Manne, Fredrik; Halappanavar, Mahantesh; Tumeo, Antonino (Conference object; Peer reviewed, 2017)
      We present and evaluate a new GPU algorithm based on the Louvain method for community detection. Our algorithm is the first for this problem that parallelizes the access to individual edges. In this way we can fine tune ...
    • On Stable Marriages and Greedy Matchings 

      Manne, Fredrik; Naim, Md.; Lerring, Håkon; Halappanavar, Mahantesh (Conference object; Peer reviewed, 2016)
      Research on stable marriage problems has a long and mathematically rigorous history, while that of exploiting greedy matchings in combinatorial scientific computing is a younger and less developed research field. We consider ...
    • Optimizing Approximate Weighted Matching on Nvidia Kepler K40 

      Naim, Md.; Manne, Fredrik; Halappanavar, Mahantesh; Tumeo, Antonino; Langguth, Johannes (Conference object; Peer reviewed, 2018)
      Matching is a fundamental graph problem with numerous applications in science and engineering. While algorithms for computing optimal matchings are difficult to parallelize, approximation algorithms on the other hand ...