Papers | Bertrand Guenin | University of Waterloo

Guenin, Bertrand, Naismith, Katie, Tunçel, Levent Unstable bridges in signed graphs Under Review.

Guenin, Bertrand, Tunçel, Levent Total Dual Integrality and beyond Under review.

Alghasi, Mahtab, Guenin, Bertrand, Tunçel, Levent The local dyadic conjecture Accepted: The 27th Conference on Integer Programming and Combinatorial Optimization, (2026).

Guenin, Bertrand, Cheolwon, Heo, Pivotto, Irene Signed graphs with the same even cycles Combinatorica 45, volume 38 (2025).
doi.org/10.1007/s00493-025-00160-4

Guenin, Bertrand, Hwang, Steven Dyadic packing of dijoins SIAM Journal on Discrete Mathematics, volume 39, (2025), volume 1, pages 593–606.
doi.org/10.1137/24M1647692

Abdi, Ahmad, Cornuéjols, Gérard, Guenin, Bertrand, Tunçel, Levent Dyadic linear programming and extensions Math. Program., volume 206, (2024), number 1-2, Ser. B, pages 125 - 143.
doi.org/10.1007/s10107-023-01967-z

Abdi, Ahmad, Cornuéjols, Gérard, Guenin, Bertrand, Tunçel, Levent Total dual dyadicness and dyadic generating sets Math. Program., volume 206, (2024), number 1-2, Ser. B, pages 125 - 143.
doi:10.1007/s10107-023-01967-z

Guenin, Bertrand, Heo, Cheolwon Recognizing pinch-graphic matroids Math. Program., volume 204, (2024), number 1-2, Ser. A, pages 113 - 134.
doi:10.1007/s10107-023-01951-7

Guenin, Bertrand, Heo, Cheolwon Small separations in pinch-graphic matroids Math. Program., volume 204, (2024), number 1-2, Ser. A, pages 81 - 111.
doi:10.1007/s10107-023-01950-8

Guenin, Bertrand, Heo, Cheolwon Recognizing even-cycle and even-cut matroids Math. Program., volume 202, (2023), number 1-2, Ser. A, pages 515–542.
doi:10.1007/s10107-023-01944-6

Abdi, Ahmad, Cornuéjols, Gérard, Guenin, Bertrand, Tunçel, Levent Testing idealness in the filter oracle model Oper. Res. Lett., volume 50, (2022), number 6, pages 753 - 755.
doi:10.1016/j.orl.2022.11.004

Abdi, Ahmad, Cornuéjols, Gérard, Guenin, Bertrand, Tunçel, Levent Total dual dyadicness and dyadic generating sets Integer programming and combinatorial optimization, Lecture Notes in Comput. Sci., volume 13265, pages 1 - 14, (2022).
doi:10.1007/978-3-031-06901-7_1

Abdi, Ahmad, Cornuéjols, Gérard, Guenin, Bertrand, Tunçel, Levent Clean clutters and dyadic fractional packings SIAM J. Discrete Math., volume 36, (2022), number 2, pages 1012 - 1037.
doi:10.1137/21M1397325

Ferchiou, Zouhaier, Guenin, Bertrand A short proof of Shih's isomorphism theorem on graphic subspaces Combinatorica, volume 40, (2020), number 6, pages 805 - 837.
doi:10.1007/s00493-020-3972-9

Heo, Cheolwon, Guenin, Bertrand Recognizing even-cycle and even-cut matroids Integer programming and combinatorial optimization, Lecture Notes in Comput. Sci., volume 12125, pages 182–195, (2020).
doi.org/10.1007/978-3-030-45771-6_15

Abdi, Ahmad, Guenin, Bertrand The two-point Fano and ideal binary clutters Combinatorica, volume 39, (2019), number 4, pages 753 - 777.
doi:10.1007/s00493-018-3779-0

Abdi, Ahmad, Guenin, Bertrand The minimally non-ideal binary clutters with a triangle Combinatorica, volume 39, (2019), number 4, pages 719 - 752.
doi:10.1007/s00493-018-3708-2

Abdi, Ahmad, Guenin, Bertrand Packing odd T-joins with at most two terminals J. Graph Theory, volume 87, (2018), number 4, pages 587 - 652.
doi:10.1002/jgt.22178

Abdi, Ahmad, Guenin, Bertrand The two-point Fano and ideal binary clutters Integer programming and combinatorial optimization, Lecture Notes in Comput. Sci., volume 10328, pages 1 - 12 (2017).
doi.org/10.1007/978-3-319-59250-3

Guenin, Bertrand, Stuive, Leanne Single commodity-flow algorithms for lifts of graphic and cographic matroids SIAM J. Discrete Math., volume 30, (2016), number 3, pages 1775 - 1797.
doi:10.1137/130937603

Guenin, Bertrand A survey on flows in graphs and matroids Discrete Appl. Math., volume 209, (2016), pages 122 - 132.
doi:10.1016/j.dam.2015.10.035

Guenin, Bertrand, Pivotto, Irene, Wollan, Paul Stabilizer theorems for even cycle matroids J. Combin. Theory Ser. B, volume 118, (2016), pages 44 - 75.
doi:10.1016/j.jctb.2016.01.006

Guenin, Bertrand, Pivotto, Irene Stabilizer theorems for even cut matroids Unpublished manuscript, (2016).

Abdi, Ahmad, Feldmann, Andreas Emil, Guenin, Bertrand, Könemann, Jochen, Sanità, Laura Lehman's theorem and the directed Steiner tree problem SIAM J. Discrete Math., volume 30, (2016), number 1, pages 141 - 153.
doi:10.1137/15M1007185

Guenin, Bertrand, Pivotto, Irene, Wollan, Paul Displaying blocking pairs in signed graphs European J. Combin., volume 51, (2016), pages 135 - 164.
doi:10.1016/j.ejc.2015.04.005

Awate, Yogesh, Cornuéjols, Gérard, Guenin, Bertrand, Tunçel, Levent On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs Math. Program., volume 150, (2015), number 2, Ser. A, pages 459 - 489.
doi:10.1007/s10107-014-0775-z

Abdi, Ahmad, Guenin, Bertrand The cycling property for the clutter of odd st-walks Integer programming and combinatorial optimization, Lecture Notes in Comput. Sci., volume 8494, pages 1-12, (2014).
doi:10.1007/978-3-319-07557-0_1

Guenin, Bertrand, Stuive, Leanne Single commodity-flow algorithms for lifts of graphic and co-graphic matroids Integer programming and combinatorial optimization, Lecture Notes in Comput. Sci., volume 7801, pages 193–204, (2013).
doi:10.1007/978-3-642-36694-9_17

Guenin, Bertrand, Pivotto, Irene, Wollan, Paul Relationships between pairs of representations of signed binary matroids SIAM J. Discrete Math., volume 27, (2013), pages 329 - 341.
doi:10.1137/100798442

Guenin, Bertrand, Thomas, Robin Packing directed circuits exactly Combinatorica, volume 31, (2011), number 4, pages 397 - 421.
doi:10.1007/s00493-011-1687-5

Cornuéjols, Gérard, Guenin, Bertrand, Tunçel, Levent Lehman matrices J. Combin. Theory Ser. B, volume 99, (2009), number 3, pages 531 - 556.
doi:10.1016/j.jctb.2008.06.009

Guenin, Bertrand Packing T-joins and edge colouring in planar graphs Unpublished manuscript, (2005).

Guenin, Bertrand Packing odd circuit covers: a conjecture Unpublished manuscript, (2005).

Williams, Aaron Michael, Guenin, Bertrand Advances in packing directed joins Proceedings of GRACO2005, Electron. Notes Discrete Math., volume 19, pages 249 - 255, (2005).
doi:10.1016/j.endm.2005.05.034

Guenin, Bertrand, Mubayi, Dhruv, Tetali, Prasad A family of switch equivalent graphs Discrete Math., volume 288, (2004), number 1-3, pages 29 - 35.
doi:10.1016/j.disc.2004.09.001

Guenin, Bertrand A short proof of Seymour's characterization of the matroids with the Max-Flow Min-Cut property Integer programming and combinatorial optimization, Lecture Notes in Comput. Sci., volume 2337, pages 188 - 193, (2002).
doi:10.1007/3-540-47867-1_14

Guenin, Bertrand Integral polyhedra related to even-cycle and even-cut matroids Math. Oper. Res., volume 27, (2002), number 4, pages 693 - 710.
doi:10.1287/moor.27.4.693.299

Geelen, James F., Guenin, Bertrand Packing odd circuits in Eulerian graphs J. Combin. Theory Ser. B, volume 86, (2002), number 2, pages 280 - 295.
doi:10.1006/jctb.2002.2128

Guenin, Bertrand A short proof of Seymour's characterization of the matroids with the max-flow min-cut property J. Combin. Theory Ser. B, volume 86, (2002), number 2, pages 273 - 279.
doi:10.1006/jctb.2002.2127

Cornuéjols, Gérard, Guenin, Bertrand Ideal clutters Discrete Appl. Math., volume 123, (2002), number 1-3, pages 303 - 338.
doi:10.1016/S0166-218X(01)00344-4

Cornuéjols, Gérard, Guenin, Bertrand Ideal binary clutters, connectivity, and a conjecture of Seymour SIAM J. Discrete Math., volume 15, (2002), number 3, pages 329 - 352.
doi:10.1137/S0895480100371389

Cornuéjols, Gérard, Guenin, Bertrand On dijoins Discrete Math., volume 243, (2002), number 1-3, pages 213 - 216.
doi:10.1016/S0012-365X(01)00209-6

Guenin, Bertrand Integral polyhedra related to even cycle and even cut matroids Integer programming and combinatorial optimization, Lecture Notes in Comput. Sci., volume 2081, pages 196 - 209, (2001).
doi:10.1007/3-540-45535-3_16

Guenin, Bertrand Circuit Mengerian directed graphs Integer programming and combinatorial optimization, Lecture Notes in Comput. Sci., volume 2081, pages 185 - 195, (2001).
doi:10.1007/3-540-45535-3_15

Guenin, Bertrand A characterization of weakly bipartite graphs J. Combin. Theory Ser. B, volume 83, (2001), number 1, pages 112 - 168.
doi:10.1006/jctb.2001.2051

Guenin, Bertrand A characterization of weakly bipartite graphs 6th International Conference on Graph Theory, Electron. Notes Discrete Math., volume 5 (2000).
doi:10.1016/S1571-0653(05)80110-6

Cornuéjols, Gérard, Guenin, Bertrand, Margot, François The packing property Math. Program., volume 89, (2000), number 1, Ser. A, pages 113 - 126.
doi:10.1007/PL00011389

Guenin, Bertrand A characterization of weakly bipartite graphs Integer programming and combinatorial optimization, Lecture Notes in Comput. Sci., volume 1412, pages 9 - 22, (1998).
doi:10.1007/3-540-69346-7_2

Cornuéjols, Gérard, Guenin, Bertrand, Margot, François The packing property Integer programming and combinatorial optimization, Lecture Notes in Comput. Sci., volume 1412, pages 1-8, (1998).
doi:10.1007/3-540-69346-7_1

Guenin, Bertrand Perfect and ideal 0,1,-1 matrices Math. Oper. Res., volume 23, (1998), number 2, pages 322 - 338.
doi:10.1287/moor.23.2.322

Amaldi, Edoardo, Guenin, Bertrand Two Constructive Methods for Designing Compact Feedforward Networks of Threshold Units International Journal of Neural Systems, volume 08, number 05n06, pages 629 - 645, (1997).
doi.org/10.1142/S0129065797000562