Frédéric Mazoit

23 papers A* 1A 2B 4Journal 15

Year	Rank	Type	Title / Venue / Authors
2025	A	`conf`	Being Efficient in Time, Space, and Workload: a Self-Stabilizing Unison and Its Consequences. STACS Stéphane Devismes, David Ilcinkas, Colette Johnen, Frédéric Mazoit
2024	A*	`conf`	Asynchronous Self-stabilization Made Fast, Simple, and Energy-efficient. PODC Colette Johnen, Stéphane Devismes, Frédéric Mazoit, David Ilcinkas
2023	A	`conf`	Distributed Certification for Classes of Dense Graphs. DISC Pierre Fraigniaud, Frédéric Mazoit, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
2023	J	`jnl`	Distributed Certification for Classes of Dense Graphs. CoRR Pierre Fraigniaud, Frédéric Mazoit, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
2023	J	`jnl`	Making local algorithms efficiently self-stabilizing in arbitrary asynchronous environments. CoRR Stéphane Devismes, David Ilcinkas, Colette Johnen, Frédéric Mazoit
2023	J	`jnl`	Trade-off between Time, Space, and Workload: the case of the Self-stabilizing Unison. CoRR Stéphane Devismes, David Ilcinkas, Colette Johnen, Frédéric Mazoit
2012	J	`jnl`	Tree-width of hypergraphs and surface duality. J. Comb. Theory B Frédéric Mazoit
2010	J	`jnl`	Partitions versus sets: A case of duality. Eur. J. Comb. Laurent Lyaudet, Frédéric Mazoit, Stéphan Thomassé
2010	J	`jnl`	Tree-width of hypergraphs and surface duality CoRR Frédéric Mazoit
2009	J	`jnl`	Computing branchwidth via efficient triangulations and blocks. Discret. Appl. Math. Fedor V. Fomin, Frédéric Mazoit, Ioan Todinca
2009	B	`conf`	Constructing Brambles. MFCS Mathieu Chapelle, Frédéric Mazoit, Ioan Todinca
2009	J	`jnl`	Partitions versus sets : a case of duality CoRR Laurent Lyaudet, Frédéric Mazoit, Stéphan Thomassé
2009	J	`jnl`	Submodular partition functions. Discret. Math. Omid Amini, Frédéric Mazoit, Nicolas Nisse, Stéphan Thomassé
2009	J	`jnl`	Tree-width of graphs and surface duality. Electron. Notes Discret. Math. Frédéric Mazoit
2008	J	`jnl`	Monotonicity of non-deterministic graph searching. Theor. Comput. Sci. Frédéric Mazoit, Nicolas Nisse
2008	J	`jnl`	Tree-width of hypergraphs and surface duality CoRR Frédéric Mazoit
2007	B	`conf`	Monotonicity of Non-deterministic Graph Searching. WG Frédéric Mazoit, Nicolas Nisse
2006	J	`jnl`	Listing all the minimal separators of a 3-connected planar graph. Discret. Math. Frédéric Mazoit
2006	B	`conf`	The Branch-Width of Circular-Arc Graphs. LATIN Frédéric Mazoit
2005	B	`conf`	Computing Branchwidth Via Efficient Triangulations and Blocks. WG Fedor V. Fomin, Frédéric Mazoit, Ioan Todinca
2004	—	`—`	Décomposition algorithmique des graphes. (algorithmic decomposition of graphs). Frédéric Mazoit
2003	J	`jnl`	Chordal embeddings of planar graphs. Discret. Math. Vincent Bouchitté, Frédéric Mazoit, Ioan Todinca
2001	J	`jnl`	Treewidth of planar graphs: connections with duality. Electron. Notes Discret. Math. Vincent Bouchitté, Frédéric Mazoit, Ioan Todinca