Bertrand Guenin

发表

Circuit Mengerian Directed Graphs

Bertrand Guenin, B. Guenin, 2001, IPCO.

Packing odd T‐joins with at most two terminals

Bertrand Guenin, Ahmad Abdi, B. Guenin, 2014, J. Graph Theory.

A Short Proof of Seymour's Characterization of the Matroids with the Max-Flow Min-Cut Property

Bertrand Guenin, 2002, J. Comb. Theory, Ser. B.

The packing property

Gérard Cornuéjols, François Margot, Bertrand Guenin, 2000, Math. Program..

Advances in packing directed joins

Bertrand Guenin, Aaron Michael Williams, B. Guenin, 2005, Electron. Notes Discret. Math..

Integral Polyhedra Related to Even Cycle and Even Cut Matroids

Bertrand Guenin, B. Guenin, 2001, IPCO.

Single Commodity-Flow Algorithms for Lifts of Graphic and CoGraphic Matroids

Leanne Stuive, Bertrand Guenin, 2016, SIAM J. Discret. Math..

Displaying blocking pairs in signed graphs

Paul Wollan, Irene Pivotto, Bertrand Guenin, 2016, Eur. J. Comb..

Packing directed circuits exactly

Robin Thomas, Bertrand Guenin, B. Guenin, 2010, Comb..

Integral Polyhedra Related to Even-Cycle and Even-Cut Matroids

Bertrand Guenin, B. Guenin, 2002, Math. Oper. Res..

A Characterization of Weakly Bipartite Graphs

Bertrand Guenin, 2000, Electron. Notes Discret. Math..

On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs

Gérard Cornuéjols, Levent Tunçel, Bertrand Guenin, 2015, Math. Program..

Perfect and Ideal 0, ±1 Matrices

Bertrand Guenin, B. Guenin, 1998, Math. Oper. Res..

The Cycling Property for the Clutter of Odd st-Walks

Bertrand Guenin, Ahmad Abdi, B. Guenin, 2014, IPCO.

A Short Proof of Seymour's Characterization of the Matroids with the Max-Flow Min-Cut Property

Bertrand Guenin, 2002, IPCO.

Packing Odd Circuits in Eulerian Graphs

James F. Geelen, Bertrand Guenin, 2002, J. Comb. Theory, Ser. B.

Ideal Binary Clutters, Connectivity, and a Conjecture of Seymour

Gérard Cornuéjols, Bertrand Guenin, G. Cornuéjols, 2002, SIAM J. Discret. Math..

A Characterization of Weakly Bipartite Graphs

Bertrand Guenin, B. Guenin, 1998, Electron. Notes Discret. Math..

A family of switch equivalent graphs

Dhruv Mubayi, Prasad Tetali, Bertrand Guenin, 2004, Discret. Math..

The Two-Point Fano and Ideal Binary Clutters

Bertrand Guenin, Ahmad Abdi, 2017, IPCO.

Two Constructive Methods for Designing Compact Feedforward Networks of Threshold Units

Edoardo Amaldi, Bertrand Guenin, E. Amaldi, 1997, Int. J. Neural Syst..

Recognizing even-cycle and even-cut matroids

Bertrand Guenin, Cheolwon Heo, B. Guenin, 2020, IPCO.

Relationships between Pairs of Representations of Signed Binary Matroids

Paul Wollan, Irene Pivotto, Bertrand Guenin, 2013, SIAM J. Discret. Math..

The Two-Point Fano and Ideal Binary Clutters

Bertrand Guenin, Ahmad Abdi, 2019, Comb..

Lehman's Theorem and the Directed Steiner Tree Problem

Jochen Könemann, Laura Sanità, Andreas Emil Feldmann, 2016, SIAM J. Discret. Math..

On dijoins

Gérard Cornuéjols, Bertrand Guenin, 2002, Discret. Math..

A survey on flows in graphs and matroids

Bertrand Guenin, B. Guenin, 2016, Discret. Appl. Math..

The packing property

Gérard Cornuéjols, François Margot, Bertrand Guenin, 1998, Math. Program..

Single Commodity-Flow Algorithms for Lifts of Graphic and Co-graphic Matroids

Leanne Stuive, Bertrand Guenin, 2013, IPCO.

Ideal clutters

Gérard Cornuéjols, Bertrand Guenin, G. Cornuéjols, 2002, Discret. Appl. Math..

Stabilizer theorems for even cycle matroids

Paul Wollan, Irene Pivotto, Bertrand Guenin, 2016, J. Comb. Theory, Ser. B.

The Minimally Non-Ideal Binary Clutters with a Triangle

Bertrand Guenin, Ahmad Abdi, B. Guenin, 2019, Comb..

A Characterization of Weakly Bipartite Graphs

Bertrand Guenin, 1998, IPCO.

Lehman matrices

Gérard Cornuéjols, Levent Tunçel, Bertrand Guenin, 2009, J. Comb. Theory, Ser. B.

Total dual dyadicness and dyadic generating sets

Bertrand Guenin, Levent Tunccel, Ahmad Abdi, 2021 .