Frédéric Mazoit

Orcid: 0009-0000-7660-9275

According to our database1, Frédéric Mazoit authored at least 16 papers between 2001 and 2024.

Collaborative distances:

Timeline

2005
2010
2015
2020
0
1
2
3
4
5
2
1
1
3
1
1
1
1
1
1
1
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Asynchronous Self-stabilization Made Fast, Simple, and Energy-efficient.
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.
CoRR, 2023

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

Distributed Certification for Classes of Dense Graphs.
Proceedings of the 37th International Symposium on Distributed Computing, 2023

2012
Tree-width of hypergraphs and surface duality.
J. Comb. Theory B, 2012

2010
Partitions versus sets: A case of duality.
Eur. J. Comb., 2010

2009
Tree-width of graphs and surface duality.
Electron. Notes Discret. Math., 2009

Submodular partition functions.
Discret. Math., 2009

Computing branchwidth via efficient triangulations and blocks.
Discret. Appl. Math., 2009

Constructing Brambles.
Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

2008
Monotonicity of non-deterministic graph searching.
Theor. Comput. Sci., 2008

2006
Listing all the minimal separators of a 3-connected planar graph.
Discret. Math., 2006

The Branch-Width of Circular-Arc Graphs.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

2004
Décomposition algorithmique des graphes. (algorithmic decomposition of graphs).
PhD thesis, 2004

2003
Chordal embeddings of planar graphs.
Discret. Math., 2003

2001
Treewidth of planar graphs: connections with duality.
Electron. Notes Discret. Math., 2001


  Loading...