 | 2009 |
| 12 |  | Mathieu Chapelle,
Frédéric Mazoit,
Ioan Todinca:
Constructing Brambles.
MFCS 2009: 223-234 |
| 11 |  | Laurent Lyaudet,
Frédéric Mazoit,
Stéphan Thomassé:
Partitions versus sets : a case of duality
CoRR abs/0903.2100: (2009) |
| 10 |  | Fedor V. Fomin,
Frédéric Mazoit,
Ioan Todinca:
Computing branchwidth via efficient triangulations and blocks.
Discrete Applied Mathematics 157(12): 2726-2736 (2009) |
| 9 |  | Frédéric Mazoit:
Tree-width of graphs and surface duality.
Electronic Notes in Discrete Mathematics 32: 93-97 (2009) |
| 2008 |
| 8 |  | Frédéric Mazoit:
Tree-width of hypergraphs and surface duality
CoRR abs/0812.2990: (2008) |
| 7 |  | Frédéric Mazoit,
Nicolas Nisse:
Monotonicity of non-deterministic graph searching.
Theor. Comput. Sci. 399(3): 169-178 (2008) |
| 2007 |
| 6 |  | Frédéric Mazoit,
Nicolas Nisse:
Monotonicity of Non-deterministic Graph Searching.
WG 2007: 33-44 |
| 2006 |
| 5 |  | Frédéric Mazoit:
The Branch-Width of Circular-Arc Graphs.
LATIN 2006: 727-736 |
| 4 |  | Frédéric Mazoit:
Listing all the minimal separators of a 3-connected planar graph.
Discrete Mathematics 306(3): 372-380 (2006) |
| 2005 |
| 3 |  | Fedor V. Fomin,
Frédéric Mazoit,
Ioan Todinca:
Computing Branchwidth Via Efficient Triangulations and Blocks.
WG 2005: 374-384 |
| 2003 |
| 2 |  | Vincent Bouchitté,
Frédéric Mazoit,
Ioan Todinca:
Chordal embeddings of planar graphs.
Discrete Mathematics 273(1-3): 85-102 (2003) |
| 2001 |
| 1 |  | Vincent Bouchitté,
Frédéric Mazoit,
Ioan Todinca:
Treewidth of planar graphs: connections with duality.
Electronic Notes in Discrete Mathematics 10: 34-38 (2001) |