Frédéric Mazoit

Publication Activity (10 Years)

Years Active: 2001-2023
Publications (10 Years): 4

Top Venues

CoRR

DISC

École normale supérieure de Lyon, France (PHD)

Education History

École normale supérieure de Lyon, France

PHD

Publications

Pierre Fraigniaud, Frédéric Mazoit, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
Distributed Certification for Classes of Dense Graphs. CoRR (2023)
Pierre Fraigniaud, Frédéric Mazoit, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
Distributed Certification for Classes of Dense Graphs. DISC (2023)
Stéphane Devismes, David Ilcinkas, Colette Johnen, Frédéric Mazoit
Making local algorithms efficiently self-stabilizing in arbitrary asynchronous environments. CoRR (2023)
Stéphane Devismes, David Ilcinkas, Colette Johnen, Frédéric Mazoit
Trade-off between Time, Space, and Workload: the case of the Self-stabilizing Unison. CoRR (2023)
Frédéric Mazoit
Tree-width of hypergraphs and surface duality. J. Comb. Theory, Ser. B 102 (3) (2012)
Frédéric Mazoit
Tree-width of hypergraphs and surface duality CoRR (2010)
Laurent Lyaudet, Frédéric Mazoit, Stéphan Thomassé
Partitions versus sets: A case of duality. Eur. J. Comb. 31 (3) (2010)
Fedor V. Fomin, Frédéric Mazoit, Ioan Todinca
Computing branchwidth via efficient triangulations and blocks. Discret. Appl. Math. 157 (12) (2009)
Laurent Lyaudet, Frédéric Mazoit, Stéphan Thomassé
Partitions versus sets : a case of duality CoRR (2009)
Mathieu Chapelle, Frédéric Mazoit, Ioan Todinca
Constructing Brambles. MFCS (2009)
Omid Amini, Frédéric Mazoit, Nicolas Nisse, Stéphan Thomassé
Submodular partition functions. Discret. Math. 309 (20) (2009)
Frédéric Mazoit
Tree-width of graphs and surface duality. Electron. Notes Discret. Math. 32 (2009)
Frédéric Mazoit
Tree-width of hypergraphs and surface duality CoRR (2008)
Frédéric Mazoit, Nicolas Nisse
Monotonicity of non-deterministic graph searching. Theor. Comput. Sci. 399 (3) (2008)
Frédéric Mazoit, Nicolas Nisse
Monotonicity of Non-deterministic Graph Searching. WG (2007)
Frédéric Mazoit
The Branch-Width of Circular-Arc Graphs. LATIN (2006)
Frédéric Mazoit
Listing all the minimal separators of a 3-connected planar graph. Discret. Math. 306 (3) (2006)
Fedor V. Fomin, Frédéric Mazoit, Ioan Todinca
Computing Branchwidth Via Efficient Triangulations and Blocks. WG (2005)
Vincent Bouchitté, Frédéric Mazoit, Ioan Todinca
Chordal embeddings of planar graphs. Discret. Math. 273 (1-3) (2003)
Vincent Bouchitté, Frédéric Mazoit, Ioan Todinca
Treewidth of planar graphs: connections with duality. Electron. Notes Discret. Math. 10 (2001)

Frédéric Mazoit.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Frédéric Mazoit