“ Since 2019, I am a PhD student of Torsten Hoefler's at SPCL. My research focusses on parallel graph algorithms, with a special interest in randomized approaches to solve graph cuts and related problems. I received my MSc in Computer Science from ETH Zurich, where I was mentored by Peter Widmayer. ”
SPAA 2020   Best Paper Finalist

SC 2020

High-Performance Parallel Graph Coloring with Strong Guarantees on Work, Depth, and Quality.
Maciej Besta, Armon Carigiet, Zur Vonarburg-Shmaria, Kacper Janda, Lukas Gianinazzi, Torsten Hoefler
ATMOS 2019
Routing in Stochastic Public Transit Networks.
Barbara Geissmann, Lukas Gianinazzi
SC 2019   Best Paper Finalist, Best Student Paper Finalist
Slim Graph: Practical Lossy Graph Compression for Approximate Graph Processing, Storage, and Analytics.
Maciej Besta, Simon Weber, Lukas Gianinazzi, Robert Gerstenberger, Andrey Ivanov, Yishai Oltchik, Torsten Hoefler
PPoPP 2018
Communication-avoiding Parallel Minimum Cuts and Connected Components.
Lukas Gianinazzi, Pavel Kalvoda, Alessandro De Palma, Maciej Besta, Torsten Hoefler
→ Slides
→ Talk
SPAA 2018   Best Paper Award

CIAC 2017
Cache Oblivious Minimum Cut.
Barbara Geissmann, Lukas Gianinazzi