Jean Fonlupt - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 20 from 20

2008

Strongly Polynomial Algorithm for the Intersection of a Line with a PolymatroidJean Fonlupt, Alexandre Skoda. bonnco 2009: 69-85 [doi]

2006

Chromatic characterization of biclique coversDenis Cornaz, Jean Fonlupt. DM, 306(5):495-507, 2006. [doi]

Critical extreme points of the 2-edge connected spanning subgraph polytopeJean Fonlupt, Ali Ridha Mahjoub. mp, 105(2-3):289-310, 2006. [doi]

2004

The Clique-Rank of 3-Chromatic Perfect GraphsJean Fonlupt. In Martin Grötschel, editor, The Sharpest Cut. Volume 4 of MPS-SIAM series on optimization, pages 39-49, SIAM, 2004. [doi]

2002

Recognizing Dart-Free Perfect GraphsVasek Chvátal, Jean Fonlupt, L. Sun, A. Zemirline. SICOMP, 31(5):1315-1338, 2002. [doi]

The stable set polytope and some operations on graphsJean Fonlupt, Ahmed Hadjar. DM, 252(1-3):123-140, 2002. [doi]

2000

Recognizing dart-free perfect graphsVasek Chvátal, Jean Fonlupt, L. Sun, A. Zemirline. soda 2000: 50-53 [doi]

1999

Critical Extreme Points of the 2-Edge Connected Spanning Subgraph PolytopeJean Fonlupt, Ali Ridha Mahjoub. ipco 1999: 166-182 [doi]

1994

Compositions of Graphs and Polyhedra IV: Acyclic Spanning SubgraphsFrancisco Barahona, Jean Fonlupt, Ali Ridha Mahjoub. siamdm, 7(3):390-402, 1994. [doi]

Polyhedral consequences of the amalgam operationMichel Burlet, Jean Fonlupt. DM, 130(1-3):39-55, 1994. [doi]

1993

Stable Set Bonding in Perfect Graphs and Parity GraphsDerek G. Corneil, Jean Fonlupt. JCT, 59(1):1-14, 1993. [doi]

Dynamic Programming and the Graphical Traveling Salesman ProblemJean Fonlupt, Armand Nachef. JACM, 40(5):1165-1187, 1993. [doi]

1992

The traveling salesman problem in graphs with some excluded minorsJean Fonlupt, Denis Naddef. mp, 53:147-172, 1992.

Compositions in the bipartite subgraph polytopeJean Fonlupt, Ali Ridha Mahjoub, J. P. Uhry. DM, 105(1-3):73-91, 1992. [doi]

1990

On the Clique-Rank and the Coloration of Perfect GraphsJean Fonlupt, András Sebö. ipco 1990: 201-216

1989

The complexity of generalized clique coveringDerek G. Corneil, Jean Fonlupt. DAM, 22(2):109-118, 1989. [doi]

1986

An integer analogue of Carathéodory s theoremWilliam J. Cook, Jean Fonlupt, Alexander Schrijver. JCT, 40(1):63-70, 1986. [doi]

1985

The traveling salesman problem on a graph and some related integer polyhedraGérard Cornuéjols, Jean Fonlupt, Denis Naddef. mp, 33(1):1-27, 1985. [doi]

1983

On the number of common bases of two matroidsJean Fonlupt, A. Zemirline. DM, 45(2-3):217-228, 1983. [doi]

1981

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

Sign in or sign up to see more results.

runs on WebDSL