1. Grappolo: A C++ library implementing parallel graph clustering algorithms. The code is targeted for multithreaded architectures.
  2. Matchbox-MT: A C/C++ library to compute several variants of matching in graphs. The code is targeted for multithreaded architectures.
  3. GPU-Suitor: A C++ library for approximate weighted matching on Nvidia GPUs.
  4. Juggernaut: A C++ library for efficient assignment of judges to cars at Jaguar competitions.
  5. ParCD: A C/C++ library implementing several Stochastic Coordinate Descent (SCD) algorithms. The code is targeted for multithreaded architectures.
  6. MatchboxP: A C/C++ library to compute half-approximation weighted matching in graphs. The code is targeted for distributed-memory architectures.
  7. Milan: A C++ library implementing several optimal and approximate matching algorithms. This was the first library on matching developed during my thesis.
  8. Other libraries that are available upon request:
    1. Extraction of maximal chordal subgraph from a graph: C/C++ and OpenMP library.
    2. Distance-1 and partial distance-2 coloring: C/C++ and OpenMP library.
    3. Balanced coloring: Several heuristics for balanced distance-1 and partial distance-2 coloring.
    4. Network flow: C++ targeting Cray XMT.

Last updated: