Jean Fonlupt

According to our database1, Jean Fonlupt authored at least 18 papers between 1981 and 2008.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2008
Strongly Polynomial Algorithm for the Intersection of a Line with a Polymatroid.
Proceedings of the Research Trends in Combinatorial Optimization, 2008

2006
Critical extreme points of the 2-edge connected spanning subgraph polytope.
Math. Program., 2006

Chromatic characterization of biclique covers.
Discret. Math., 2006

2004
The Clique-Rank of 3-Chromatic Perfect Graphs.
Proceedings of the Sharpest Cut, 2004

2002
Recognizing Dart-Free Perfect Graphs.
SIAM J. Comput., 2002

The stable set polytope and some operations on graphs.
Discret. Math., 2002

1994
Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs.
SIAM J. Discret. Math., 1994

Polyhedral consequences of the amalgam operation.
Discret. Math., 1994

1993
Stable Set Bonding in Perfect Graphs and Parity Graphs.
J. Comb. Theory B, 1993

Dynamic Programming and the Graphical Traveling Salesman Problem.
J. ACM, 1993

1992
The traveling salesman problem in graphs with some excluded minors.
Math. Program., 1992

Compositions in the bipartite subgraph polytope.
Discret. Math., 1992

1990
On the Clique-Rank and the Coloration of Perfect Graphs.
Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990

1989
The complexity of generalized clique covering.
Discret. Appl. Math., 1989

1986
An integer analogue of Carathéodory's theorem.
J. Comb. Theory B, 1986

1985
The traveling salesman problem on a graph and some related integer polyhedra.
Math. Program., 1985

1983
On the number of common bases of two matroids.
Discret. Math., 1983

1981
Propriétés combinatoires des produits tensoriels d'ensembles convexes. (Combinatorial properties of the tensorial products of convex sets).
, 1981


  Loading...