Coloring Fast with Broadcasts. - Maxime Flin; Mohsen Ghaffari 001; Magnús M. Halldórsson; Fabian Kuhn; Alexandre Nolin (SPAA, 2023)

Fast Coloring Despite Congested Relays. - Maxime Flin; Magnús M. Halldórsson; Alexandre Nolin (DISC, 2023)

(Δ+1) Vertex Coloring in O(n) Communication. - Maxime Flin; Parth Mittal (PODC, 2024)

A Distributed Palette Sparsification Theorem. - Maxime Flin; Mohsen Ghaffari 001; Magnús M. Halldórsson; Fabian Kuhn; Alexandre Nolin (SODA, 2024)

Decentralized Distributed Graph Coloring II: Degree+1-Coloring Virtual Graphs. - Maxime Flin; Magnús M. Halldórsson; Alexandre Nolin (DISC, 2024)

Faster Dynamic (Δ+1)-Coloring Against Adaptive Adversaries. - Maxime Flin; Magnús M. Halldórsson (ICALP, 2025)

Decentralized Distributed Graph Coloring: Cluster Graphs. - Maxime Flin; Magnús M. Halldórsson; Alexandre Nolin (PODC, 2025)

When MIS and Maximal Matching are Easy in the Congested Clique. - Keren Censor-Hillel; Tomer Even; Maxime Flin; Magnús M. Halldórsson (SIROCCO, 2025)

(Δ + 1) vertex coloring in O(n) communication. - Maxime Flin; Parth Mittal (Distributed Comput., 2025)