Skip to content


  • Pro


@thrill @KarlsruheMIS

Popular repositories

  1. KaGen: Communication-free Massively Distributed Graph Generators

    C 15 5

  2. Forked from darrenstrash/quick-cliques

    Code to quickly compute all maximal cliques. Code was originally written to run experiments for paper "Listing All Maximal Cliques in Large Sparse Real-World Graphs", D. Eppstein and D. Strash, In …

    C++ 1

  3. Forked from schulzchristian/KaDraw

    This the open source graph drawing package KaDraw (Karlsruhe Graph Drawing).

    C++ 1

  4. Benchmark for PACE 2019


  5. Forked from KaHIP/KaHIP

    The graph partitioning framework KaHIP -- Karlsruhe High Quality Partitioning.


5 contributions in the last year

Jul Aug Sep Oct Nov Dec Jan Feb Mar Apr May Jun Mon Wed Fri

Contribution activity

July 2020

sebalamm has no activity yet for this period.

June 2020

KaMIS -- Karlsruhe Maximum Independent Sets

This is the open source framework to compute (weighted) independent sets and vertex covers.

Seeing something unexpected? Take a look at the GitHub profile guide.

You can’t perform that action at this time.