| 2025 | FOCS | Towards True Work-Efficiency in Parallel Derandomization: MIS, Maximal Matching, and Hitting Set. | Mohsen Ghaffari, Christoph Grunau |
| 2025 | PODC | Density-Dependent Graph Orientation and Coloring in Scalable MPC. | Mohsen Ghaffari, Christoph Grunau |
| 2024 | ESA | Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge Weights. | Vikrant Ashvinkumar, Aaron Bernstein, Nairen Cao, Christoph Grunau, Bernhard Haeupler, Yonggang Jiang, Danupon Nanongkai, Hsin-Hao Su |
| 2024 | FOCS | Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS. | Mohsen Ghaffari, Christoph Grunau |
| 2024 | SODA | Fully Dynamic Consistent | Jakub Lacki, Bernhard Haeupler, Christoph Grunau, Rajesh Jayaram, Vclav Rozhon |
| 2024 | STOC | Dynamic O(Arboricity) Coloring in Polylogarithmic Worst-Case Time. | Mohsen Ghaffari, Christoph Grunau |
| 2024 | STOC | Work-Efficient Parallel Derandomization II: Optimal Concentrations via Bootstrapping. | Mohsen Ghaffari, Christoph Grunau |
| 2023 | ESA | Noisy k-Means++ Revisited. | Christoph Grunau, Ahmet Alper zdogru, Vclav Rozhon |
| 2023 | FOCS | Work-Efficient Parallel Derandomization I: Chernoff-like Concentrations via Pairwise Independence. | Mohsen Ghaffari, Christoph Grunau, Vclav Rozhon |
| 2023 | SODA | Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via Derandomization. | Mohsen Ghaffari, Christoph Grunau, Bernhard Haeupler, Saeed Ilchi, Vclav Rozhon |
| 2023 | SODA | Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond. | Salwa Faour, Mohsen Ghaffari, Christoph Grunau, Fabian Kuhn, Vclav Rozhon |
| 2023 | SODA | A Nearly Tight Analysis of Greedy k-means++. | Christoph Grunau, Ahmet Alper zdogru, Vclav Rozhon, Jakub Tetek |
| 2023 | STOC | Faster Deterministic Distributed MIS and Approximate Matching. | Mohsen Ghaffari, Christoph Grunau |
| 2023 | STOC | Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances. | Vclav Rozhon, Bernhard Haeupler, Anders Martinsson, Christoph Grunau, Goran Zuzic |
| 2023 | SPAA | Nearly Work-Efficient Parallel DFS in Undirected Graphs. | Mohsen Ghaffari, Christoph Grunau, Jiahao Qu |
| 2023 | SPAA | Deterministic Massively Parallel Symmetry Breaking for Sparse Graphs. | Manuela Fischer, Jeff Giliberti, Christoph Grunau |
| 2022 | FOCS | Deterministic Low-Diameter Decompositions for Weighted Graphs and Distributed and Parallel Applications. | Vclav Rozhon, Michael Elkin, Christoph Grunau, Bernhard Haeupler |
| 2022 | ICML | Adapting k-means Algorithms for Outliers. | Christoph Grunau, Vclav Rozhon |
| 2022 | PODC | The Landscape of Distributed Complexities on Trees and Beyond. | Christoph Grunau, Vclav Rozhon, Sebastian Brandt |
| 2022 | STOC | Undirected (1+ | Vclav Rozhon, Christoph Grunau, Bernhard Haeupler, Goran Zuzic, Jason Li |
| 2022 | SPAA | Massively Parallel Algorithms for b-Matching. | Mohsen Ghaffari, Christoph Grunau, Slobodan Mitrovic |
| 2022 | SPAA | Deterministic Distributed Sparse and Ultra-Sparse Spanners and Connectivity Certificates. | Marcel Bezdrighin, Michael Elkin, Mohsen Ghaffari, Christoph Grunau, Bernhard Haeupler, Saeed Ilchi, Vclav Rozhon |
| 2021 | PODC | The Randomized Local Computation Complexity of the Lovsz Local Lemma. | Sebastian Brandt, Christoph Grunau, Vclav Rozhon |
| 2021 | SODA | Improved Deterministic Network Decomposition. | Mohsen Ghaffari, Christoph Grunau, Vclav Rozhon |
| 2020 | ICML | k-means++: few more steps yield constant approximation. | Davin Choo, Christoph Grunau, Julian Portmann, Vclav Rozhon |
| 2020 | PODC | Generalizing the Sharp Threshold Phenomenon for the Distributed Complexity of the Lovsz Local Lemma. | Sebastian Brandt, Christoph Grunau, Vclav Rozhon |
| 2020 | SODA | Improved Local Computation Algorithm for Set Cover via Sparsification. | Christoph Grunau, Slobodan Mitrovic, Ronitt Rubinfeld, Ali Vakilian |