
Search the dblp DataBase
Jean François Maurras:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Jean François Maurras, Viet Hung Nguyen
A Procedure of Facet Composition for the Symmetric Traveling Salesman Polytope. [Citation Graph (0, 0)][DBLP] Combinatorial Optimization, 2001, pp:134146 [Conf]
 Jean François Maurras
More on the plane of order 10. [Citation Graph (0, 0)][DBLP] Coding Theory and Applications, 1988, pp:226231 [Conf]
 Jean François Maurras, Sonia Vanier
Network synthesis under survivability constraints. [Citation Graph (0, 0)][DBLP] 4OR, 2004, v:2, n:1, pp:5367 [Journal]
 Jean François Maurras
From Membership to Separation, a Simple Construction. [Citation Graph (0, 0)][DBLP] Combinatorica, 2002, v:22, n:4, pp:531536 [Journal]
 Jean François Maurras
Convex hull of the edges of a graph and near bipartite graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1983, v:46, n:3, pp:257265 [Journal]
 Malika Hadjiat, Jean François Maurras
A strongly polynomial algorithm for the minimum cost tension problem. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1997, v:165, n:, pp:377394 [Journal]
 Jean François Maurras, Yann Vaxès
Multicommodity network flow with jump constraints. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1997, v:165, n:, pp:481486 [Journal]
 Jean François Maurras
Hypergraphes de Petersen! Hypergraphes de Moore? [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1993, v:111, n:13, pp:373379 [Journal]
 Jean François Maurras
The linepolytope of a finite affine plane. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1993, v:115, n:13, pp:283286 [Journal]
A family of easy polyhedra. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.002secs
