| Submodular partition functions O Amini, F Mazoit, N Nisse, S Thomassé Discrete Mathematics 309 (20), 6000-6008, 2009 | 65 | 2009 |
| Chordal embeddings of planar graphs V Bouchitté, F Mazoit, I Todinca Discrete Mathematics 273 (1-3), 85-102, 2003 | 43 | 2003 |
| Branchwidth of graphic matroids F Mazoit, S Thomassé Surveys in combinatorics 346, 275-286, 2007 | 39 | 2007 |
| Monotonicity of non-deterministic graph searching F Mazoit, N Nisse Theoretical Computer Science 399 (3), 169-178, 2008 | 27 | 2008 |
| Partitions versus sets: a case of duality L Lyaudet, F Mazoit, S Thomassé European journal of Combinatorics 31 (3), 681-687, 2010 | 23 | 2010 |
| Constructing brambles M Chapelle, F Mazoit, I Todinca International Symposium on Mathematical Foundations of Computer Science, 223-234, 2009 | 15 | 2009 |
| Computing branchwidth via efficient triangulations and blocks FV Fomin, F Mazoit, I Todinca Discrete applied mathematics 157 (12), 2726-2736, 2009 | 15 | 2009 |
| Treewidth of planar graphs: connections with duality V Bouchitté, F Mazoit, I Todinca Euroconference on Combinatorics, Graph Theory and Applications 10, 34-38, 2001 | 13 | 2001 |
| A single exponential bound for the redundant vertex theorem on surfaces F Mazoit arXiv preprint arXiv:1309.7820, 2013 | 12 | 2013 |
| Computing branchwidth via efficient triangulations and blocks F Fomin, F Mazoit, I Todinca International Workshop on Graph-Theoretic Concepts in Computer Science, 374-384, 2005 | 12 | 2005 |
| Distributed certification for classes of dense graphs P Fraigniaud, F Mazoit, P Montealegre, I Rapaport, I Todinca arXiv preprint arXiv:2307.14292, 2023 | 10 | 2023 |
| Tree-width of hypergraphs and surface duality F Mazoit Journal of Combinatorial Theory, Series B 102 (3), 671-687, 2012 | 10 | 2012 |
| Monotonicity of non-deterministic graph searching F Mazoit, N Nisse Graph-Theoretic Concepts in Computer Science: 33rd International Workshop …, 2007 | 10 | 2007 |
| An unified FPT algorithm for width of partition functions P Berthomé, T Bouvier, F Mazoit, N Nisse, RP Soares INRIA, 2013 | 9 | 2013 |
| The branch-width of circular-arc graphs F Mazoit LATIN 2006: Theoretical Informatics: 7th Latin American Symposium, Valdivia …, 2006 | 9 | 2006 |
| A simple proof of the tree-width duality theorem F Mazoit arXiv preprint arXiv:1309.2266, 2013 | 7 | 2013 |
| Listing all the minimal separators of a 3-connected planar graph F Mazoit Discrete mathematics 306 (3), 372-380, 2006 | 7 | 2006 |
| Tree-width of graphs and surface duality F Mazoit Electronic Notes in Discrete Mathematics 32, 93-97, 2009 | 5 | 2009 |
| Tangle-tree duality in infinite graphs and matroids N Bowler, R Diestel, F Mazoit preparation, 0 | 5 | |
| Making local algorithms efficiently self-stabilizing in arbitrary asynchronous environments S Devismes, D Ilcinkas, C Johnen, F Mazoit arXiv preprint arXiv:2307.06635, 2023 | 3 | 2023 |
