Two Constructive Methods for Designing Compact Feedforward Networks of Threshold Units. - Edoardo Amaldi; Bertrand Guenin (Int. J. Neural Syst., 1997)

Perfect and Ideal 0, ±1 Matrices. - Bertrand Guenin (Math. Oper. Res., 1998)

The packing property. - Gérard Cornuéjols; Bertrand Guenin; François Margot (Math. Program., 2000)

Circuit Mengerian Directed Graphs. - Bertrand Guenin (IPCO, 2001)

A Characterization of Weakly Bipartite Graphs. - Bertrand Guenin (J. Comb. Theory B, 2001)

Ideal clutters. - Gérard Cornuéjols; Bertrand Guenin (Discret. Appl. Math., 2002)

On dijoins. - Gérard Cornuéjols; Bertrand Guenin (Discret. Math., 2002)

Packing Odd Circuits in Eulerian Graphs. - James F. Geelen; Bertrand Guenin (J. Comb. Theory B, 2002)

A Short Proof of Seymour's Characterization of the Matroids with the Max-Flow Min-Cut Property. - Bertrand Guenin (J. Comb. Theory B, 2002)

Integral Polyhedra Related to Even-Cycle and Even-Cut Matroids. - Bertrand Guenin (Math. Oper. Res., 2002)

Ideal Binary Clutters, Connectivity, and a Conjecture of Seymour. - Gérard Cornuéjols; Bertrand Guenin (SIAM J. Discret. Math., 2002)

A family of switch equivalent graphs. - Bertrand Guenin; Dhruv Mubayi; Prasad Tetali (Discret. Math., 2004)

Advances in packing directed joins. - Aaron Michael Williams; Bertrand Guenin (Electron. Notes Discret. Math., 2005)

Lehman matrices. - Gérard Cornuéjols; Bertrand Guenin; Levent Tunçel (J. Comb. Theory B, 2009)

Packing directed circuits exactly. - Bertrand Guenin; Robin Thomas 001 (Comb., 2011)

Single Commodity-Flow Algorithms for Lifts of Graphic and Co-graphic Matroids. - Bertrand Guenin; Leanne Stuive (IPCO, 2013)

Relationships between Pairs of Representations of Signed Binary Matroids. - Bertrand Guenin; Irene Pivotto; Paul Wollan (SIAM J. Discret. Math., 2013)

The Cycling Property for the Clutter of Odd st-Walks. - Ahmad Abdi; Bertrand Guenin (IPCO, 2014)

On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs. - Yogesh Awate; Gérard Cornuéjols; Bertrand Guenin; Levent Tunçel (Math. Program., 2015)

A survey on flows in graphs and matroids. - Bertrand Guenin (Discret. Appl. Math., 2016)

Displaying blocking pairs in signed graphs. - Bertrand Guenin; Irene Pivotto; Paul Wollan (Eur. J. Comb., 2016)

Stabilizer theorems for even cycle matroids. - Bertrand Guenin; Irene Pivotto; Paul Wollan (J. Comb. Theory B, 2016)

Lehman's Theorem and the Directed Steiner Tree Problem. - Ahmad Abdi; Andreas Emil Feldmann; Bertrand Guenin; Jochen Könemann; Laura Sanità (SIAM J. Discret. Math., 2016)

Single Commodity-Flow Algorithms for Lifts of Graphic and CoGraphic Matroids. - Bertrand Guenin; Leanne Stuive (SIAM J. Discret. Math., 2016)

Packing odd T-joins with at most two terminals. - Ahmad Abdi; Bertrand Guenin (J. Graph Theory, 2018)

The Minimally Non-Ideal Binary Clutters with a Triangle. - Ahmad Abdi; Bertrand Guenin (Comb., 2019)

The Two-Point Fano and Ideal Binary Clutters. - Ahmad Abdi; Bertrand Guenin (Comb., 2019)

A Short Proof of Shih's Isomorphism Theorem on Graphic Subspaces. - Zouhaier Ferchiou; Bertrand Guenin (Comb., 2020)

Testing idealness in the filter oracle model. - Ahmad Abdi; Gérard Cornuéjols; Bertrand Guenin; Levent Tunçel (Oper. Res. Lett., 2022)

Clean Clutters and Dyadic Fractional Packings. - Ahmad Abdi; Gérard Cornuéjols; Bertrand Guenin; Levent Tunçel (SIAM J. Discret. Math., 2022)

Recognizing even-cycle and even-cut matroids. - Bertrand Guenin; Cheolwon Heo (Math. Program., 2023)

Small separations in pinch-graphic matroids. - Bertrand Guenin; Cheolwon Heo (Math. Program., 2024)

Recognizing pinch-graphic matroids. - Bertrand Guenin; Cheolwon Heo (Math. Program., 2024)

Total dual dyadicness and dyadic generating sets. - Ahmad Abdi; Gérard Cornuéjols; Bertrand Guenin; Levent Tunçel (Math. Program., 2024)

Dyadic Packing of Dijoins. - Bertrand Guenin; Steven Hwang (SIAM J. Discret. Math., 2025)

Signed graphs with the same even cycles. - Bertrand Guenin; Cheolwon Heo; Irene Pivotto (Comb., 2025)