Bertrand Guenin

46 papers B 10Journal 36

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Dyadic Packing of Dijoins. SIAM J. Discret. Math. Bertrand Guenin, Steven Hwang
2025	J	`jnl`	Dyadic linear programming and extensions. Math. Program. Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel
2025	J	`jnl`	Signed graphs with the same even cycles. Comb. Bertrand Guenin, Cheolwon Heo, Irene Pivotto
2024	J	`jnl`	Recognizing pinch-graphic matroids. Math. Program. Bertrand Guenin, Cheolwon Heo
2024	J	`jnl`	Small separations in pinch-graphic matroids. Math. Program. Bertrand Guenin, Cheolwon Heo
2024	J	`jnl`	Total dual dyadicness and dyadic generating sets. Math. Program. Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel
2023	J	`jnl`	Recognizing even-cycle and even-cut matroids. Math. Program. Bertrand Guenin, Cheolwon Heo
2022	J	`jnl`	Clean Clutters and Dyadic Fractional Packings. SIAM J. Discret. Math. Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel
2022	J	`jnl`	Testing idealness in the filter oracle model. Oper. Res. Lett. Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel
2022	B	`conf`	Total Dual Dyadicness and Dyadic Generating Sets. IPCO Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel
2020	J	`jnl`	A Short Proof of Shih's Isomorphism Theorem on Graphic Subspaces. Comb. Zouhaier Ferchiou, Bertrand Guenin
2020	B	`conf`	Recognizing Even-Cycle and Even-Cut Matroids. IPCO Cheolwon Heo, Bertrand Guenin
2019	J	`jnl`	The Minimally Non-Ideal Binary Clutters with a Triangle. Comb. Ahmad Abdi, Bertrand Guenin
2019	J	`jnl`	The Two-Point Fano and Ideal Binary Clutters. Comb. Ahmad Abdi, Bertrand Guenin
2018	J	`jnl`	Packing odd J. Graph Theory Ahmad Abdi, Bertrand Guenin
2017	B	`conf`	The Two-Point Fano and Ideal Binary Clutters. IPCO Ahmad Abdi, Bertrand Guenin
2016	J	`jnl`	A survey on flows in graphs and matroids. Discret. Appl. Math. Bertrand Guenin
2016	J	`jnl`	Displaying blocking pairs in signed graphs. Eur. J. Comb. Bertrand Guenin, Irene Pivotto, Paul Wollan
2016	J	`jnl`	Lehman's Theorem and the Directed Steiner Tree Problem. SIAM J. Discret. Math. Ahmad Abdi, Andreas Emil Feldmann, Bertrand Guenin, Jochen Könemann, Laura Sanità
2016	J	`jnl`	Single Commodity-Flow Algorithms for Lifts of Graphic and CoGraphic Matroids. SIAM J. Discret. Math. Bertrand Guenin, Leanne Stuive
2016	J	`jnl`	Stabilizer theorems for even cycle matroids. J. Comb. Theory B Bertrand Guenin, Irene Pivotto, Paul Wollan
2015	J	`jnl`	On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs. Math. Program. Yogesh Awate, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel
2014	B	`conf`	The Cycling Property for the Clutter of Odd st-Walks. IPCO Ahmad Abdi, Bertrand Guenin
2013	J	`jnl`	Relationships between Pairs of Representations of Signed Binary Matroids. SIAM J. Discret. Math. Bertrand Guenin, Irene Pivotto, Paul Wollan
2013	B	`conf`	Single Commodity-Flow Algorithms for Lifts of Graphic and Co-graphic Matroids. IPCO Bertrand Guenin, Leanne Stuive
2011	J	`jnl`	Packing directed circuits exactly. Comb. Bertrand Guenin, Robin Thomas
2010	J	`jnl`	Packing directed circuits exactly CoRR Bertrand Guenin, Robin Thomas
2009	J	`jnl`	Lehman matrices. J. Comb. Theory B Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel
2005	J	`jnl`	Advances in packing directed joins. Electron. Notes Discret. Math. Aaron Michael Williams, Bertrand Guenin
2004	J	`jnl`	A family of switch equivalent graphs. Discret. Math. Bertrand Guenin, Dhruv Mubayi, Prasad Tetali
2002	B	`conf`	A Short Proof of Seymour's Characterization of the Matroids with the Max-Flow Min-Cut Property. IPCO Bertrand Guenin
2002	J	`jnl`	A Short Proof of Seymour's Characterization of the Matroids with the Max-Flow Min-Cut Property. J. Comb. Theory B Bertrand Guenin
2002	J	`jnl`	Ideal Binary Clutters, Connectivity, and a Conjecture of Seymour. SIAM J. Discret. Math. Gérard Cornuéjols, Bertrand Guenin
2002	J	`jnl`	Ideal clutters. Discret. Appl. Math. Gérard Cornuéjols, Bertrand Guenin
2002	J	`jnl`	Integral Polyhedra Related to Even-Cycle and Even-Cut Matroids. Math. Oper. Res. Bertrand Guenin
2002	J	`jnl`	On dijoins. Discret. Math. Gérard Cornuéjols, Bertrand Guenin
2002	J	`jnl`	Packing Odd Circuits in Eulerian Graphs. J. Comb. Theory B James F. Geelen, Bertrand Guenin
2001	J	`jnl`	A Characterization of Weakly Bipartite Graphs. J. Comb. Theory B Bertrand Guenin
2001	B	`conf`	Circuit Mengerian Directed Graphs. IPCO Bertrand Guenin
2001	B	`conf`	Integral Polyhedra Related to Even Cycle and Even Cut Matroids. IPCO Bertrand Guenin
2000	J	`jnl`	A Characterization of Weakly Bipartite Graphs. Electron. Notes Discret. Math. Bertrand Guenin
2000	J	`jnl`	The packing property. Math. Program. Gérard Cornuéjols, Bertrand Guenin, François Margot
1998	B	`conf`	A Characterization of Weakly Bipartite Graphs. IPCO Bertrand Guenin
1998	J	`jnl`	Perfect and Ideal 0, ±1 Matrices. Math. Oper. Res. Bertrand Guenin
1998	B	`conf`	The Packing Property. IPCO Gérard Cornuéjols, Bertrand Guenin, François Margot
1997	J	`jnl`	Two Constructive Methods for Designing Compact Feedforward Networks of Threshold Units. Int. J. Neural Syst. Edoardo Amaldi, Bertrand Guenin