Highspeed Graph Processing Exploiting Main-Memory Column Stores. - Matthias Hauck; Marcus Paradies; Holger Fröning; Wolfgang Lehner; Hannes Rauhe (Euro-Par Workshops, 2015)

Optimizing communication for a 2D-partitioned scalable BFS. - Jeffrey S. Young 001; Julian Romera; Matthias Hauck; Holger Fröning (HPEC, 2016)

Can Modern Graph Processing Engines Run Concurrent Queries Efficiently? - Matthias Hauck; Marcus Paradies; Holger Fröning (GRADES@SIGMOD/PODS, 2017)

Fast Construction of Compressed Web Graphs. - Jan Broß; Simon Gog; Matthias Hauck; Marcus Paradies (SPIRE, 2017)

Software-Based Buffering of Associative Operations on Random Memory Addresses. - Matthias Hauck; Marcus Paradies; Holger Fröning (IPDPS, 2019)

Scheduling of Graph Queries: Controlling Intra- and Inter-query Parallelism for a High System Throughput. - Matthias Hauck; Ismail Oukid; Holger Fröning (CoRR, 2021)