| |
| 2004 | ||
|---|---|---|
| 10 | EE | Jean François Maurras, Sonia Vanier: Network synthesis under survivability constraints. 4OR 2(1): 53-67 (2004) |
| 2002 | ||
| 9 | EE | Jean François Maurras: From Membership to Separation, a Simple Construction. Combinatorica 22(4): 531-536 (2002) |
| 2001 | ||
| 8 | EE | Jean François Maurras, Viet Hung Nguyen: A Procedure of Facet Composition for the Symmetric Traveling Salesman Polytope. Combinatorial Optimization 2001: 134-146 |
| 2000 | ||
| 7 | EE | Viet Hung Nguyen, Jean François Maurras: A procedure of facet composition for the symmetric Traveling Salesman Polytope. Electronic Notes in Discrete Mathematics 5: 251-252 (2000) |
| 1997 | ||
| 6 | EE | Malika Hadjiat, Jean François Maurras: A strongly polynomial algorithm for the minimum cost tension problem. Discrete Mathematics 165-166: 377-394 (1997) |
| 5 | EE | Jean François Maurras, Yann Vaxès: Multicommodity network flow with jump constraints. Discrete Mathematics 165-166: 481-486 (1997) |
| 1993 | ||
| 4 | EE | Jean François Maurras: Hypergraphes de Petersen! Hypergraphes de Moore? Discrete Mathematics 111(1-3): 373-379 (1993) |
| 3 | EE | Jean François Maurras: The line-polytope of a finite affine plane. Discrete Mathematics 115(1-3): 283-286 (1993) |
| 1988 | ||
| 2 | Jean François Maurras: More on the plane of order 10. Coding Theory and Applications 1988: 226-231 | |
| 1983 | ||
| 1 | EE | Jean François Maurras: Convex hull of the edges of a graph and near bipartite graphs. Discrete Mathematics 46(3): 257-265 (1983) |
| 1 | Malika Hadjiat | [6] |
| 2 | Viet Hung Nguyen | [7] [8] |
| 3 | Sonia Vanier | [10] |
| 4 | Yann Vaxès | [5] |