Bertrand Guenin

424 total citations
30 papers, 193 citations indexed

About

Bertrand Guenin is a scholar working on Computational Theory and Mathematics, Electrical and Electronic Engineering and Computer Networks and Communications. According to data from OpenAlex, Bertrand Guenin has authored 30 papers receiving a total of 193 indexed citations (citations by other indexed papers that have themselves been cited), including 27 papers in Computational Theory and Mathematics, 11 papers in Electrical and Electronic Engineering and 8 papers in Computer Networks and Communications. Recurrent topics in Bertrand Guenin's work include Advanced Graph Theory Research (23 papers), graph theory and CDMA systems (10 papers) and Complexity and Algorithms in Graphs (6 papers). Bertrand Guenin is often cited by papers focused on Advanced Graph Theory Research (23 papers), graph theory and CDMA systems (10 papers) and Complexity and Algorithms in Graphs (6 papers). Bertrand Guenin collaborates with scholars based in Canada, United States and South Korea. Bertrand Guenin's co-authors include Gérard Cornuéjols, Levent Tunçel, Jochen Könemann, James F. Geelen, François Margot, Robin Thomas, E. Amaldi, Paul Wollan, Aaron Williams and Laura Sanità and has published in prestigious journals such as Mathematical Programming, Mathematics of Operations Research and Discrete Applied Mathematics.

In The Last Decade

Bertrand Guenin

25 papers receiving 167 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Bertrand Guenin Canada 7 127 58 49 29 27 30 193
Clemens Huemer Spain 10 172 1.4× 49 0.8× 31 0.6× 13 0.4× 62 2.3× 67 296
Stephen G. Hartke United States 9 153 1.2× 40 0.7× 29 0.6× 22 0.8× 73 2.7× 41 222
Phyllis Zweig Chinn United States 4 227 1.8× 59 1.0× 91 1.9× 24 0.8× 35 1.3× 11 286
Ruy Fabila‐Monroy Mexico 8 79 0.6× 26 0.4× 26 0.5× 15 0.5× 32 1.2× 39 172
L. Thiel Canada 5 57 0.4× 134 2.3× 17 0.3× 83 2.9× 73 2.7× 11 197
Joachim Kneis Germany 10 154 1.2× 31 0.5× 101 2.1× 29 1.0× 11 0.4× 17 220
Richard D. Ringeisen United States 9 206 1.6× 76 1.3× 41 0.8× 22 0.8× 47 1.7× 21 286
Zsolt Tuza Hungary 13 313 2.5× 68 1.2× 97 2.0× 28 1.0× 90 3.3× 27 372
Gelasio Salazar Mexico 11 212 1.7× 66 1.1× 33 0.7× 11 0.4× 25 0.9× 62 327
Klaus Meer Germany 9 173 1.4× 8 0.1× 12 0.2× 86 3.0× 6 0.2× 37 243

Countries citing papers authored by Bertrand Guenin

Since Specialization
Citations

This map shows the geographic impact of Bertrand Guenin's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Bertrand Guenin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Bertrand Guenin more than expected).

Fields of papers citing papers by Bertrand Guenin

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Bertrand Guenin. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Bertrand Guenin. The network helps show where Bertrand Guenin may publish in the future.

Co-authorship network of co-authors of Bertrand Guenin

This figure shows the co-authorship network connecting the top 25 collaborators of Bertrand Guenin. A scholar is included among the top collaborators of Bertrand Guenin based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Bertrand Guenin. Bertrand Guenin is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Cornuéjols, Gérard, et al.. (2024). Dyadic linear programming and extensions. Mathematical Programming. 213(1-2). 473–516.
2.
Cornuéjols, Gérard, et al.. (2023). Total dual dyadicness and dyadic generating sets. Mathematical Programming. 206(1-2). 125–143.
3.
Guenin, Bertrand, et al.. (2023). Small separations in pinch-graphic matroids. Mathematical Programming. 204(1-2). 81–111. 2 indexed citations
4.
Guenin, Bertrand, et al.. (2023). Recognizing pinch-graphic matroids. Mathematical Programming. 204(1-2). 113–134. 2 indexed citations
5.
Feldmann, Andreas Emil, et al.. (2016). Lehman's Theorem and the Directed Steiner Tree Problem. SIAM Journal on Discrete Mathematics. 30(1). 141–153. 2 indexed citations
6.
Guenin, Bertrand, et al.. (2016). Stabilizer theorems for even cycle matroids. Journal of Combinatorial Theory Series B. 118. 44–75. 4 indexed citations
7.
Guenin, Bertrand, et al.. (2015). Displaying blocking pairs in signed graphs. European Journal of Combinatorics. 51. 135–164. 1 indexed citations
8.
Cornuéjols, Gérard, et al.. (2014). On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs. Mathematical Programming. 150(2). 459–489. 2 indexed citations
9.
Guenin, Bertrand, Jochen Könemann, & Levent Tunçel. (2014). A Gentle Introduction to Optimization. Cambridge University Press eBooks. 31 indexed citations
10.
Guenin, Bertrand, et al.. (2013). Relationships between Pairs of Representations of Signed Binary Matroids. SIAM Journal on Discrete Mathematics. 27(1). 329–341. 3 indexed citations
11.
Cornuéjols, Gérard, Bertrand Guenin, & Levent Tunçel. (2008). Lehman matrices. Journal of Combinatorial Theory Series B. 99(3). 531–556. 6 indexed citations
12.
Guenin, Bertrand, Dhruv Mubayi, & Prasad Tetali. (2004). A family of switch equivalent graphs. Discrete Mathematics. 288(1-3). 29–35.
13.
Guenin, Bertrand. (2002). A Short Proof of Seymour's Characterization of the Matroids with the Max-Flow Min-Cut Property. Journal of Combinatorial Theory Series B. 86(2). 273–279. 5 indexed citations
14.
Cornuéjols, Gérard & Bertrand Guenin. (2002). On dijoins. Discrete Mathematics. 243(1-3). 213–216. 4 indexed citations
15.
Cornuéjols, Gérard & Bertrand Guenin. (2002). Ideal clutters. Discrete Applied Mathematics. 123(1-3). 303–338. 5 indexed citations
16.
Guenin, Bertrand. (2002). Integral Polyhedra Related to Even-Cycle and Even-Cut Matroids. Mathematics of Operations Research. 27(4). 693–710. 5 indexed citations
17.
Geelen, James F. & Bertrand Guenin. (2002). Packing Odd Circuits in Eulerian Graphs. Journal of Combinatorial Theory Series B. 86(2). 280–295. 17 indexed citations
18.
Guenin, Bertrand. (2000). A Characterization of Weakly Bipartite Graphs. Electronic Notes in Discrete Mathematics. 5. 149–151. 1 indexed citations
19.
Cornuéjols, Gérard, Bertrand Guenin, & François Margot. (2000). The packing property. Mathematical Programming. 89(1). 113–126. 25 indexed citations
20.
Amaldi, E. & Bertrand Guenin. (1997). Two Constructive Methods for Designing Compact Feedforward Networks of Threshold Units. International Journal of Neural Systems. 8(05n06). 629–645. 9 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026