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

On the number of common bases of two matroids. - Jean Fonlupt; Abdelhamid Zemirline (Discret. Math., 1983)

The traveling salesman problem on a graph and some related integer polyhedra. - Gérard Cornuéjols; Jean Fonlupt; Denis Naddef (Math. Program., 1985)

An integer analogue of Carathéodory's theorem. - William J. Cook; Jean Fonlupt; Alexander Schrijver (J. Comb. Theory B, 1986)

The complexity of generalized clique covering. - Derek G. Corneil; Jean Fonlupt (Discret. Appl. Math., 1989)

On the Clique-Rank and the Coloration of Perfect Graphs. - Jean Fonlupt; András Sebö (IPCO, 1990)

Compositions in the bipartite subgraph polytope. - Jean Fonlupt; Ali Ridha Mahjoub; J. P. Uhry (Discret. Math., 1992)

The traveling salesman problem in graphs with some excluded minors. - Jean Fonlupt; Denis Naddef (Math. Program., 1992)

Dynamic Programming and the Graphical Traveling Salesman Problem. - Jean Fonlupt; Armand Nachef (J. ACM, 1993)

Stable Set Bonding in Perfect Graphs and Parity Graphs. - Derek G. Corneil; Jean Fonlupt (J. Comb. Theory B, 1993)

Polyhedral consequences of the amalgam operation. - Michel Burlet; Jean Fonlupt (Discret. Math., 1994)

Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs. - Francisco Barahona; Jean Fonlupt; Ali Ridha Mahjoub (SIAM J. Discret. Math., 1994)

The stable set polytope and some operations on graphs. - Jean Fonlupt; Ahmed Hadjar (Discret. Math., 2002)

Recognizing Dart-Free Perfect Graphs. - Vasek Chvátal; Jean Fonlupt; L. Sun; Abdelhamid Zemirline (SIAM J. Comput., 2002)

The Clique-Rank of 3-Chromatic Perfect Graphs. - Jean Fonlupt (The Sharpest Cut, 2004)

Chromatic characterization of biclique covers. - Denis Cornaz; Jean Fonlupt (Discret. Math., 2006)

Critical extreme points of the 2-edge connected spanning subgraph polytope. - Jean Fonlupt; Ali Ridha Mahjoub (Math. Program., 2006)

Strongly Polynomial Algorithm for the Intersection of a Line with a Polymatroid. - Jean Fonlupt; Alexandre Skoda (Bonn Workshop of Combinatorial Optimization, 2008)