Deterministic Distributed Edge-Coloring via Hypergraph Maximal Matching. - Manuela Fischer; Mohsen Ghaffari 001; Fabian Kuhn (FOCS, 2017)

Sublogarithmic Distributed Algorithms for Lovász Local Lemma, and the Complexity Hierarchy. - Manuela Fischer; Mohsen Ghaffari 001 (DISC, 2017)

Deterministic Distributed Matching: Simpler, Faster, Better. - Manuela Fischer; Mohsen Ghaffari 001 (CoRR, 2017)

Tight Analysis of Randomized Greedy MIS. - Manuela Fischer; Andreas Noever (CoRR, 2017)

DISC 2017 Review. - Manuela Fischer; Yannic Maus (SIGACT News, 2017)

A Simple Parallel and Distributed Sampling Technique: Local Glauber Dynamics. - Manuela Fischer; Mohsen Ghaffari 001 (DISC, 2018)

Breaking the Linear-Memory Barrier in MPC: Fast MIS on Trees with nε Memory per Machine. - Manuela Fischer; Jara Uitto (CoRR, 2018)

Matching and MIS for Uniformly Sparse Graphs in the Low-Memory MPC Model. - Sebastian Brandt 002; Manuela Fischer; Jara Uitto (CoRR, 2018)

Simple Graph Coloring Algorithms for Congested Clique and Massively Parallel Computation. - Manuela Fischer; Mohsen Ghaffari 001; Jara Uitto (CoRR, 2018)

Massively Parallel Computation of Matching and MIS in Sparse Graphs. - Soheil Behnezhad; Sebastian Brandt 002; Mahsa Derakhshan; Manuela Fischer; MohammadTaghi Hajiaghayi; Richard M. Karp; Jara Uitto (PODC, 2019)

The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation. - Yi-Jun Chang; Manuela Fischer; Mohsen Ghaffari 001; Jara Uitto; Yufan Zheng (PODC, 2019)

SIROCCO 2019 Review. - Sebastian Brandt 002; Manuela Fischer; Jara Uitto (SIGACT News, 2019)

Improved deterministic distributed matching via rounding. - Manuela Fischer (Distributed Comput., 2020)

Tight Analysis of Parallel Randomized Greedy MIS. - Manuela Fischer; Andreas Noever (ACM Trans. Algorithms, 2020)

Extreme k-Center Clustering. - MohammadHossein Bateni; Hossein Esfandiari; Manuela Fischer; Vahab S. Mirrokni (AAAI, 2021)

Deterministic (1+ε)-Approximate Maximum Matching with poly(1/ε) Passes in the Semi-Streaming Model. - Manuela Fischer; Slobodan Mitrovic; Jara Uitto (CoRR, 2021)

Breaking the linear-memory barrier in MPC: Fast MIS on trees with strongly sublinear memory. - Sebastian Brandt 002; Manuela Fischer; Jara Uitto (Theor. Comput. Sci., 2021)

Local Algorithms for Classic Graph Problems. - Manuela Fischer (2021)

Deterministic (1+ε)-approximate maximum matching with poly(1/ε) passes in the semi-streaming model and beyond. - Manuela Fischer; Slobodan Mitrovic; Jara Uitto (STOC, 2022)

Exponential Speedup over Locality in MPC with Optimal Memory. - Alkida Balliu; Sebastian Brandt 002; Manuela Fischer; Rustam Latypov; Yannic Maus; Dennis Olivetti; Jara Uitto (DISC, 2022)

Improved Deterministic Connectivity in Massively Parallel Computation. - Manuela Fischer; Jeff Giliberti; Christoph Grunau (DISC, 2022)

Triangle resilience of the square of a Hamilton cycle in random graphs. - Manuela Fischer; Nemanja Skoric; Angelika Steger; Milos Trujic (J. Comb. Theory B, 2022)

Fast Distributed Brooks' Theorem. - Manuela Fischer; Magnús M. Halldórsson; Yannic Maus (SODA, 2023)

Deterministic Massively Parallel Symmetry Breaking for Sparse Graphs. - Manuela Fischer; Jeff Giliberti; Christoph Grunau (SPAA, 2023)