 | 2005 |
|---|
| 16 |       | Aaron Michael Williams,
Bertrand Guenin:
Advances in packing directed joins.
Electronic Notes in Discrete Mathematics 19: 249-255 (2005) |
| 2004 |
|---|
| 15 | | Bertrand Guenin,
Dhruv Mubayi,
Prasad Tetali:
A family of switch equivalent graphs.
Discrete Mathematics 288(1-3): 29-35 (2004) |
| 2002 |
|---|
| 14 | | Bertrand Guenin:
A Short Proof of Seymour's Characterization of the Matroids with the Max-Flow Min-Cut Property.
IPCO 2002: 188-193 |
| 13 |  | Gérard Cornuéjols,
Bertrand Guenin:
Ideal clutters.
Discrete Applied Mathematics 123(1-3): 303-338 (2002) |
| 12 | | Gérard Cornuéjols,
Bertrand Guenin:
On dijoins.
Discrete Mathematics 243(1-3): 213-216 (2002) |
| 11 | | Bertrand Guenin:
A Short Proof of Seymour's Characterization of the Matroids with the Max-Flow Min-Cut Property.
J. Comb. Theory, Ser. B 86(2): 273-279 (2002) |
| 10 | | James F. Geelen,
Bertrand Guenin:
Packing Odd Circuits in Eulerian Graphs.
J. Comb. Theory, Ser. B 86(2): 280-295 (2002) |
| 9 | | Bertrand Guenin:
Integral Polyhedra Related to Even-Cycle and Even-Cut Matroids.
Math. Oper. Res. 27(4): 693-710 (2002) |
| 8 | | Gérard Cornuéjols,
Bertrand Guenin:
Ideal Binary Clutters, Connectivity, and a Conjecture of Seymour.
SIAM J. Discrete Math. 15(3): 329-352 (2002) |
| 2001 |
|---|
| 7 | | Bertrand Guenin:
Circuit Mengerian Directed Graphs.
IPCO 2001: 185-195 |
| 6 | | Bertrand Guenin:
Integral Polyhedra Related to Even Cycle and Even Cut Matroids.
IPCO 2001: 196-209 |
| 5 | | Bertrand Guenin:
A Characterization of Weakly Bipartite Graphs.
J. Comb. Theory, Ser. B 83(1): 112-168 (2001) |
| 2000 |
|---|
| 4 | | Bertrand Guenin:
A Characterization of Weakly Bipartite Graphs.
Electronic Notes in Discrete Mathematics 5: 149-151 (2000) |
| 1998 |
|---|
| 3 | | Gérard Cornuéjols,
Bertrand Guenin,
François Margot:
The Packing Property.
IPCO 1998: 1-8 |
| 2 | | Bertrand Guenin:
A Characterization of Weakly Bipartite Graphs.
IPCO 1998: 9-22 |
| 1997 |
|---|
| 1 | | Edoardo Amaldi,
Bertrand Guenin:
Two Constructive Methods for Designing Compact Feedforward Networks of Threshold Units.
Int. J. Neural Syst. 8(5-6): 629-645 (1997) |
