Publications

Chapitres de livres

  1. Mazoit (F.) et Thomassé (S.), Surveys in Combinatorics 2007, chapitre Branchwidth of graphic matroids, pages 275-286. Cambridge university press, 2007.
    [ .pdf | hal ]

Articles de journaux

  1. 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 ]
  2. Lyaudet (L.), Mazoit (F.) et Thomassé (S.), Partitions versus sets : a case of duality. European journal of Combinatorics, n°31(3), pages 681-687, 2010.
    [ .pdf | hal | doi ]
  3. Amini (O.), Mazoit (F.), Nisse (N.) et Thomassé (S.), Submodular Partition Functions. Discrete Mathematics, n°309(20) pages 6000-6008, 2009.
    [ .pdf | hal | doi ]
  4. Fomin (F. V.), Mazoit (F.) et Todinca (I.), Computing branchwidth via efficient triangulations and blocks. Discrete Applied Mathematics, n°157(12) pages 2726-2736, 2009.
    [ .pdf | hal | doi ]
  5. Mazoit (F.) et Nisse (N.), Monotonicity of non-deterministic graph searching, Theoretical Computer Science, n°399(3) pages 169-178, 2008.
    [ .pdf | hal | doi ]
  6. 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 ]
  7. Bouchitté (V.), Mazoit (F.) et Todinca (I.), Chordal embeddings of planar graphs. Discrete Mathematics, n°273(1-3) pages 85-102, 2003.
    [ .pdf | hal | doi ]

Actes de conférences

  1. Chapelle (M.), Mazoit (F.) et Todinca (I.), Constructing brambles, Actes du 34e International Symposium on Mathematical Foundations of Computer Science (MFCS'09), pages 223-234, 2009.
    [ .pdf | hal | doi ]
  2. Mazoit (F.), Tree-width of hypergraphs and surface duality, Electronic Notes in Discrete Mathematics n°32 pages 93-97, Actes de DIMAP workshop on Algorithmic Graph Theory (AGT'09), 2009.
    [ .pdf | hal | doi ]
  3. Mazoit (F.) et Nisse (N.), Monotonicity of Non-deterministic Graph Searching. Actes du 33ème International Workshop on Graphs (WG'07), pages 33-44, 2007.
    [ .pdf | hal | doi ]
  4. Mazoit (F.), The branch-width of circular-arc graphs. Actes du 7ème Latin American Theoretical Informatics Symposium (LATIN'06), pages 727-736, 2006.
    [ .pdf | hal | doi ]
  5. Fomin (F. V.), Mazoit (F.) et Todinca (I.), Computing branchwidth via efficient triangulations and blocks. Actes du 31ème International Workshop on Graphs, (WG'05), pages 374-384, 2005.
    [ .pdf | hal | doi ]
  6. Bouchitté (V.), Mazoit (F.) et Todinca (I.), Treewidth of planar graphs: connections with duality, Electronic Notes in Discrete Mathematics, n°10 pages 34-38, Actes de la 1ère European Conference on Combinatorics, Graph Theory and Applications, (EUROCOMB'01), 2001.
    [ .pdf | hal | doi ]

Thèse

  • Mazoit (F.), Décomposition algorithmique des graphes, thèse, École normale supérieure de Lyon, 2004.
    [ .pdf ]

Vulgarisation scientifique

  1. Mazoit (F.), Sur un théorème de pavage d'un rectangle, Bulletin vert de l'APMEP, n°480 pages 113-118, 2009.
    [ .pdf ]
  2. Mazoit (F.), Pavages par des calissons, feuille à problèmes n°4 de l'IREM de Lyon, 2006.
    [ Énoncé | Solution ]

edit

Valid XHTML 1.0 Strict Valid CSS!