Maxime Flin

activity

20232026

most citedSublogarithmic Distributed Vertex Coloring with Optimal Number of Colors

1 citations · 1 across the 10 of their papers we have counts for

collaborators

Showing 2025Show all

2 papers · 1 filter

cs.DS2025

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

Maxime Flin, Magnús M. Halldórsson

We consider the problem of maintaining a proper $(Δ + 1)$ -vertex coloring in a graph on $n$ -vertices and maximum degree $Δ$ undergoing edge insertions and deletions. We give a rando…

cs.DC2025

When MIS and Maximal Matching are Easy in the Congested Clique

Keren Censor-Hillel, Tomer Even, Maxime Flin +1

Two of the most fundamental distributed symmetry-breaking problems are that of finding a maximal independent set (MIS) and a maximal matching (MM) in a graph. It is a major open qu…

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

When MIS and Maximal Matching are Easy in the Congested Clique

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