Maxime Flin

I am a postdoctoral researcher at Aalto University in the group of Jukka Suomela.

I recently completed my PhD at Reykjavik University under the supervision of Magnús M. Halldórsson. Prior to that, I did my master studies at École Normale Supérieure de Paris, where I completed the Master Parisien de Recherche en Informatique. I received a bachelor of Computer Science and one of Mathematics from Université Paris Diderot (now Paris Cité)

Je suis un postdoctorant à Aalto University dans le groupe de Jukka Suomela.

J'ai récemment soutenu ma thèse de doctorat à l'Université de Reykjavik sous la supervision de Magnús M. Halldórsson. Avant cela, j'ai fait mes études à l'École Normale Supérieure de Paris, où j'ai complété le Master Parisien de Recherche en Informatique. J'ai obtenu une double licence en informatique et un autre en mathématiques de l'Université Paris Diderot (maintenant Paris Cité).

My research is supported by the Research Council of Finland, Grant 359104. My PhD was funded by the Icelandic Research Fund.

Ma recherche est soutenue par le Research Council of Finland, bourse n°359104. Ma thèse a été financée par Fond de Recherche Islandais.

Research Interests: I have a broad interest in algorithms, complexity, and combinatorics. Notably in graph theory, randomness, and optimization. So far, my work has focused on coloring in constrained models.

Domaines de Recherche: Je m'intéresse aux algorithmes, la complexité et la combinatoire. Notamment en théorie des graphes, aléatoire et optimisation. Pour l'instant, mon travail s'est concentré sur la coloration dans des modèles contraints.

Publications [ arxiv | dblp | orcid ]

• Faster Dynamic \((\Delta+1)\)-Coloring Against Adaptive Adversaries

  with Magnús M. Halldórsson

  International Colloquium on Automata, Languages, and Programming, ICALP 2025

  [ arxiv ]

• Decentralized Distributed Graph Coloring: Cluster Graphs

  with Magnús M. Halldórsson, Alexandre Nolin

  Symposium on Principles of Distributed Computing, PODC 2025

  [ arxiv ]

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

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

  Structural Information and Communication Complexity, SIROCCO 2025

  [ arxiv ]

• Decentralized Distributed Graph Coloring II: degree+1-Coloring Virtual Graphs

  with Magnús M. Halldórsson, Alexandre Nolin

  International Symposium on Distributed Computing, DISC 2024

  [ arxiv | conference version ]

• \(\Delta+1\) Vertex Coloring in \( O(n) \) Communication

  with Parth Mittal

  Symposium on Principles of Distributed Computing, PODC 2024

  Invited to Distributed Computing

  [ arxiv | conference version | journal version ]

• A Distributed Palette Sparsification Theorem

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

  Symposium on Discrete Algorithms, SODA 2024

  [ arxiv | conference version ]

• Fast Coloring Despite Congested Relays

  with Magnús M. Halldórsson, Alexandre Nolin

  International Symposium on Distributed Computing, DISC 2023

  [ arxiv | conference version ]

• Coloring Fast with Broadcasts

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

  Symposium on Parallelism in Algorithms and Architectures, SPAA 2023

  [ arxiv | conference version ]

Talks

Exposés & Séminaires

• PODC'24

• GALAC Seminar at LISN, Université Paris-Saclay

• Complexity & Algorithm Seminar at Waterloo University

• SODA'24

• DISC'23

• SPAA'23

• ICE-TCS Seminar at Reykjavik University

Teaching

Enseignement

• Design of Algorithms

  Teacher

  Reykjavik University, Spring 2025

• Algorithms

  Head Teaching Assistant

  Reykjavik University, Fall 2022, Fall 2023

• Design of Algorithms

  Teaching Assistant

  Reykjavik University, Spring 2023