The SCEAS System
Navigation Menu

Search the dblp DataBase


Jean François Maurras: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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:134-146 [Conf]
  2. Jean François Maurras
    More on the plane of order 10. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1988, pp:226-231 [Conf]
  3. Jean François Maurras, Sonia Vanier
    Network synthesis under survivability constraints. [Citation Graph (0, 0)][DBLP]
    4OR, 2004, v:2, n:1, pp:53-67 [Journal]
  4. Jean François Maurras
    From Membership to Separation, a Simple Construction. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2002, v:22, n:4, pp:531-536 [Journal]
  5. 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:257-265 [Journal]
  6. 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:377-394 [Journal]
  7. 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:481-486 [Journal]
  8. Jean François Maurras
    Hypergraphes de Petersen! Hypergraphes de Moore? [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:373-379 [Journal]
  9. Jean François Maurras
    The line-polytope of a finite affine plane. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:115, n:1-3, pp:283-286 [Journal]

  10. A family of easy polyhedra. [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.002secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002