Publications
Book Chapter
- Mazoit (F.) and Thomassé (S.), Surveys in Combinatorics 2007, chapitre Branchwidth of graphic matroids, pages 275-286. Cambridge university press, 2007. [ .pdf | hal | doi ]
Journal Papers
Mazoit (F.), Tree-width of hypergraphs and surface duality. Journal of Combinatorial Theory, Series B, n° 102(3), pages 671-687, 2012. [ .pdf | hal | doi ]
Lyaudet (L.), Mazoit (F.) and Thomassé (S.), Partitions versus sets : a case of duality. European journal of Combinatorics, n°31(3), pages 681-687, 2010. [ .pdf | hal | doi ]
Amini (O.), Mazoit (F.), Nisse (N.) and Thomassé (S.), Submodular Partition Functions. Discrete Mathematics, n°309(20) pages 6000-6008, 2009. [ .pdf | hal | doi ]
Fomin (F. V.), Mazoit (F.) and Todinca (I.), Computing branchwidth via efficient triangulations and blocks. Discrete Applied Mathematics, n°157(12) pages 2726-2736, 2009. [ .pdf | hal | doi ]
Mazoit (F.) and Nisse (N.), Monotonicity of non-deterministic graph searching, Theoretical Computer Science, n°399(3) pages 169-178, 2008. [ .pdf | hal | doi ]
Mazoit (F.), Listing all the minimal separators of a 3-connected planar graph. Discrete Mathematics, n°306(3) pages 372-380, 2006. [ .pdf | hal | doi ]
Bouchitté (V.), Mazoit (F.) and Todinca (I.), Chordal embeddings of planar graphs. Discrete Mathematics, n°273(1-3) pages 85-102, 2003. [ .pdf | hal | doi ]
International Conference Papers
Devismes (S.), Johnen (C.), Ilcinkas (D.) and Mazoit (F.), Trade-off between Time, Space, and Workload: the case of the Self-stabilizing Unison, Proceedings of the 42nd International Symposium on Theoretical Aspects of Computer Science (STACS’25), pages 30:1-30:18, 2025. [ .pdf | hal | doi ]
Devismes (S.), Ilcinkas (D.), Johnen (C.) and Mazoit (F.), Asynchronous Self-stabilization Made Fast, Simple, and Energy-efficient, Proceedings of the 43th Symposium on Principles of Distributed Computing (PODC’24), pages 538-548, 2024. [ .pdf | hal | doi ]
Fraigniaud (P.), Mazoit (F.), Montealegre (P.), Rapaport (I.) and Todinca (I.), Distributed Certification for Classes of Dense Graphs, Proceedings of the 37th International Symposium on Distributed Computing (DISC’23), pages 20:1–20:17, 2023. [ .pdf | hal | doi ]
Chapelle (M.), Mazoit (F.) and Todinca (I.), Constructing brambles, Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science (MFCS’09), pages 223-234, 2009. [ .pdf | hal | doi ]
Mazoit (F.), Tree-width of hypergraphs and surface duality, Proceedings of the DIMAP workshop on Algorithmic Graph Theory (AGT’09), pages 93-97, 2009. [ .pdf | hal | doi ]
Mazoit (F.) and Nisse (N.), Monotonicity of Non-deterministic Graph Searching. Proceedings of the 33rd International Workshop on Graphs (WG’07), pages 33-44, 2007. [ .pdf | hal | doi ]
Mazoit (F.), The branch-width of circular-arc graphs. Proceedings of the 7th Latin American Theoretical Informatics Symposium (LATIN’06), pages 727-736, 2006. [ .pdf | hal | doi ]
Fomin (F. V.), Mazoit (F.) and Todinca (I.), Computing branchwidth via efficient triangulations and blocks. Proceedings of the 31st International Workshop on Graphs (WG’05), pages 374-384, 2005. [ .pdf | hal | doi ]
Bouchitté (V.), Mazoit (F.) and Todinca (I.), Treewidth of planar graphs: connections with duality, Proceedings of the 1st European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB’01), pages 34-38, 2001. [ .pdf | hal | doi ]
National Conference Papers
Devismes (S.), Ilcinkas (D.), Johnen (C.) and Mazoit (F.), Temps, travail, espace: pourquoi choisir ? Un unisson autostabilisant et ses retombées, Proceedings of the 27th Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel’25), 2025. [ .pdf | hal ]
Devismes (S.), Ilcinkas (D.), Johnen (C.) and Mazoit (F.), Nous aussi on fait du « log * » !, Proceedings of the 26th Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel’24), 2024. [ .pdf | hal ]
Unpublished Manuscripts
Berthomé (P.), Bouvier (T.), Mazoit (F.), Nisse (N.) and Pardo Soares (R.), An Unified FPT Algorithm for Width of Partition Functions, 2013. [ .pdf | hal ]
Mazoit (F.), A simple proof of the tree-width duality theorem, 2013. [ .pdf | arxiv ]
Mazoit (F.), A single exponential bound for the redundant vertex Theorem on surfaces, 2013. [ .pdf | arxiv ]
Legrand (A.), Mazoit (F.) and Quinson (M.), An Application-Level Network Mapper, 2006. [ .pdf | hal ]
PhD Thesis (in French)
- Mazoit (F.), Décomposition algorithmique des graphes, thèse, École normale supérieure de Lyon, 2004. [ .pdf ]