Jean Fonlupt

20 papers A* 1B 2Journal 14Unranked 1
YearRankTypeTitle / Venue / Authors
2008 — conf
Strongly Polynomial Algorithm for the Intersection of a Line with a Polymatroid.
Bonn Workshop of Combinatorial Optimization
Jean Fonlupt, Alexandre Skoda
2006 J jnl
Chromatic characterization of biclique covers.
Discret. Math.
Denis Cornaz, Jean Fonlupt
2006 J jnl
Critical extreme points of the 2-edge connected spanning subgraph polytope.
Math. Program.
Jean Fonlupt, Ali Ridha Mahjoub
2004 — ch.
The Clique-Rank of 3-Chromatic Perfect Graphs.
The Sharpest Cut
Jean Fonlupt
2002 J jnl
Recognizing Dart-Free Perfect Graphs.
SIAM J. Comput.
Vasek Chvátal, Jean Fonlupt, L. Sun, Abdelhamid Zemirline
2002 J jnl
The stable set polytope and some operations on graphs.
Discret. Math.
Jean Fonlupt, Ahmed Hadjar
2000 A* conf
Recognizing dart-free perfect graphs.
SODA
Vasek Chvátal, Jean Fonlupt, L. Sun, Abdelhamid Zemirline
1999 B conf
Critical Extreme Points of the 2-Edge Connected Spanning Subgraph Polytope.
IPCO
Jean Fonlupt, Ali Ridha Mahjoub
1994 J jnl
Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs.
SIAM J. Discret. Math.
Francisco Barahona, Jean Fonlupt, Ali Ridha Mahjoub
1994 J jnl
Polyhedral consequences of the amalgam operation.
Discret. Math.
Michel Burlet, Jean Fonlupt
1993 J jnl
Dynamic Programming and the Graphical Traveling Salesman Problem.
J. ACM
Jean Fonlupt, Armand Nachef
1993 J jnl
Stable Set Bonding in Perfect Graphs and Parity Graphs.
J. Comb. Theory B
Derek G. Corneil, Jean Fonlupt
1992 J jnl
Compositions in the bipartite subgraph polytope.
Discret. Math.
Jean Fonlupt, Ali Ridha Mahjoub, J. P. Uhry
1992 J jnl
The traveling salesman problem in graphs with some excluded minors.
Math. Program.
Jean Fonlupt, Denis Naddef
1990 B conf
On the Clique-Rank and the Coloration of Perfect Graphs.
IPCO
Jean Fonlupt, András Sebö
1989 J jnl
The complexity of generalized clique covering.
Discret. Appl. Math.
Derek G. Corneil, Jean Fonlupt
1986 J jnl
An integer analogue of Carathéodory's theorem.
J. Comb. Theory B
William J. Cook, Jean Fonlupt, Alexander Schrijver
1985 J jnl
The traveling salesman problem on a graph and some related integer polyhedra.
Math. Program.
Gérard Cornuéjols, Jean Fonlupt, Denis Naddef
1983 J jnl
On the number of common bases of two matroids.
Discret. Math.
Jean Fonlupt, Abdelhamid Zemirline
1981 — book
Propriétés combinatoires des produits tensoriels d'ensembles convexes. (Combinatorial properties of the tensorial products of convex sets).
Jean Fonlupt