- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j14 |      | Bertrand Guenin, Irene Pivotto, Paul Wollan: Relationships between Pairs of Representations of Signed Binary Matroids. SIAM J. Discrete Math. 27(1): 329-341 (2013) |
| c6 | | Bertrand Guenin, Leanne Stuive: Single Commodity-Flow Algorithms for Lifts of Graphic and Co-graphic Matroids. IPCO 2013: 193-204 |
| 2011 | ||
| j13 | | Bertrand Guenin, Robin Thomas: Packing directed circuits exactly. Combinatorica 31(4): 397-421 (2011) |
| 2010 | ||
| i1 | | |
| 2009 | ||
| j12 | | Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel: Lehman matrices. J. Comb. Theory, Ser. B 99(3): 531-556 (2009) |
| 2005 | ||
| j11 | | Aaron Michael Williams, Bertrand Guenin: Advances in packing directed joins. Electronic Notes in Discrete Mathematics 19: 249-255 (2005) |
| 2004 | ||
| j10 | | Bertrand Guenin, Dhruv Mubayi, Prasad Tetali: A family of switch equivalent graphs. Discrete Mathematics 288(1-3): 29-35 (2004) |
| 2002 | ||
| j9 | | Gérard Cornuéjols, Bertrand Guenin: Ideal clutters. Discrete Applied Mathematics 123(1-3): 303-338 (2002) |
| j8 | | |
| j7 | | 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) |
| j6 | | James F. Geelen, Bertrand Guenin: Packing Odd Circuits in Eulerian Graphs. J. Comb. Theory, Ser. B 86(2): 280-295 (2002) |
| j5 | | Bertrand Guenin: Integral Polyhedra Related to Even-Cycle and Even-Cut Matroids. Math. Oper. Res. 27(4): 693-710 (2002) |
| j4 | | Gérard Cornuéjols, Bertrand Guenin: Ideal Binary Clutters, Connectivity, and a Conjecture of Seymour. SIAM J. Discrete Math. 15(3): 329-352 (2002) |
| c5 | | Bertrand Guenin: A Short Proof of Seymour's Characterization of the Matroids with the Max-Flow Min-Cut Property. IPCO 2002: 188-193 |
| 2001 | ||
| j3 | | Bertrand Guenin: A Characterization of Weakly Bipartite Graphs. J. Comb. Theory, Ser. B 83(1): 112-168 (2001) |
| c4 | | |
| c3 | | |
| 2000 | ||
| j2 | | Bertrand Guenin: A Characterization of Weakly Bipartite Graphs. Electronic Notes in Discrete Mathematics 5: 149-151 (2000) |
| 1998 | ||
| c2 | | |
| c1 | | |
| 1997 | ||
| j1 | | 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) |
Colors in the list of coauthors
Last update Thu May 23 23:45:42 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page