Maxime Flin

According to our database, Maxime Flin authored at least 9 papers between 2023 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

(Δ + 1) vertex coloring in O(n) communication.

Maxime Flin, Parth Mittal

Distributed Comput., March, 2025

When MIS and Maximal Matching are Easy in the Congested Clique.

Keren Censor-Hillel, Tomer Even, Maxime Flin, Magnús M. Halldórsson

Proceedings of the Structural Information and Communication Complexity, 2025

Decentralized Distributed Graph Coloring: Cluster Graphs.

Maxime Flin, Magnús M. Halldórsson, Alexandre Nolin

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2025

Faster Dynamic (Δ+1)-Coloring Against Adaptive Adversaries.

Maxime Flin, Magnús M. Halldórsson

Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

2024

Decentralized Distributed Graph Coloring II: Degree+1-Coloring Virtual Graphs.

Maxime Flin, Magnús M. Halldórsson, Alexandre Nolin

Proceedings of the 38th International Symposium on Distributed Computing, 2024

A Distributed Palette Sparsification Theorem.

Maxime Flin, Mohsen Ghaffari, Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

(Δ+1) Vertex Coloring in <i>O</i>(<i>n</i>) Communication.

Maxime Flin, Parth Mittal

Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

2023

Fast Coloring Despite Congested Relays.

Maxime Flin, Magnús M. Halldórsson, Alexandre Nolin

Proceedings of the 37th International Symposium on Distributed Computing, 2023

Coloring Fast with Broadcasts.

Maxime Flin, Mohsen Ghaffari, Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin

Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023