11 citations · 14 across the 10 of their papers we have counts for
16 papers
Fast Deterministic Distributed Degree Splitting
Yannic Maus, Alexandre Nolin, Florian Schager
We obtain better algorithms for computing more balanced orientations and degree splits in LOCAL. Important to our result is a connection to the hypergraph sinkless orientation prob…
Faster Distributed -Coloring via Ruling Subgraphs
Yann Bourreau, Sebastian Brandt, Alexandre Nolin
Brooks' theorem states that all connected graphs but odd cycles and cliques can be colored with colors, where is the maximum degree of the graph. Such colorings have been s…
Decentralized Distributed Graph Coloring II: degree+1-Coloring Virtual Graphs
Maxime Flin, Magnús M. Halldórsson, Alexandre Nolin
Graph coloring is fundamental to distributed computing. We give the first general treatment of the coloring of virtual graphs, where the graph to be colored is locally embedded…
Content-Oblivious Leader Election on Rings
Fabian Frei, Ran Gelles, Ahmed Ghazy +1
In content-oblivious computation, n nodes wish to compute a given task over an asynchronous network that suffers from an extremely harsh type of noise, which corrupts the content o…
Decentralized Distributed Graph Coloring: Cluster Graphs
Maxime Flin, Magnus M. Halldorsson, Alexandre Nolin
Graph coloring is fundamental to distributed computing. We give the first sub-logarithmic distributed algorithm for coloring cluster graphs. These graphs are obtained from the unde…
Fast Coloring Despite Congested Relays
Maxime Flin, Magnús M. Halldórsson, Alexandre Nolin
We provide a -round randomized algorithm for distance-2 coloring in CONGEST with colors. For , this improves exponentially…