Frédéric Mazoit

According to our database, Frédéric Mazoit authored at least 17 papers between 2001 and 2025.

Collaborative distances:

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

2025

Being Efficient in Time, Space, and Workload: a Self-Stabilizing Unison and Its Consequences.

Stéphane Devismes, David Ilcinkas, Colette Johnen, Frédéric Mazoit

Proceedings of the 42nd International Symposium on Theoretical Aspects of Computer Science, 2025

2024

Asynchronous Self-stabilization Made Fast, Simple, and Energy-efficient.

Colette Johnen, Stéphane Devismes, Frédéric Mazoit, David Ilcinkas

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

2023

Trade-off between Time, Space, and Workload: the case of the Self-stabilizing Unison.

Stéphane Devismes, David Ilcinkas, Colette Johnen, Frédéric Mazoit

CoRR, 2023

Making local algorithms efficiently self-stabilizing in arbitrary asynchronous environments.

Stéphane Devismes, David Ilcinkas, Colette Johnen, Frédéric Mazoit

CoRR, 2023

Distributed Certification for Classes of Dense Graphs.

Pierre Fraigniaud, Frédéric Mazoit, Pedro Montealegre, Ivan Rapaport, Ioan Todinca

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

2012

Tree-width of hypergraphs and surface duality.

Frédéric Mazoit

J. Comb. Theory B, 2012

2010

Partitions versus sets: A case of duality.

Laurent Lyaudet, Frédéric Mazoit, Stéphan Thomassé

Eur. J. Comb., 2010

2009

Tree-width of graphs and surface duality.

Frédéric Mazoit

Electron. Notes Discret. Math., 2009

Submodular partition functions.

Omid Amini, Frédéric Mazoit, Nicolas Nisse, Stéphan Thomassé

Discret. Math., 2009

Computing branchwidth via efficient triangulations and blocks.

Fedor V. Fomin, Frédéric Mazoit, Ioan Todinca

Discret. Appl. Math., 2009

Constructing Brambles.

Mathieu Chapelle, Frédéric Mazoit, Ioan Todinca

Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

2008

Monotonicity of non-deterministic graph searching.

Frédéric Mazoit, Nicolas Nisse

Theor. Comput. Sci., 2008

2006

Listing all the minimal separators of a 3-connected planar graph.

Frédéric Mazoit

Discret. Math., 2006

The Branch-Width of Circular-Arc Graphs.

Frédéric Mazoit

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

2004

Décomposition algorithmique des graphes. (algorithmic decomposition of graphs).

Frédéric Mazoit

PhD thesis, 2004

2003

Chordal embeddings of planar graphs.

Vincent Bouchitté, Frédéric Mazoit, Ioan Todinca

Discret. Math., 2003

2001

Treewidth of planar graphs: connections with duality.

Vincent Bouchitté, Frédéric Mazoit, Ioan Todinca

Electron. Notes Discret. Math., 2001