default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBertrand Guenin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j32]Bertrand Guenin
, Cheolwon Heo:
Small separations in pinch-graphic matroids. Math. Program. 204(1): 81-111 (2024)- [j31]Bertrand Guenin, Cheolwon Heo:
Recognizing pinch-graphic matroids. Math. Program. 204(1): 113-134 (2024) - [j30]Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel:
Total dual dyadicness and dyadic generating sets. Math. Program. 206(1): 125-143 (2024) - 2023
- [j29]Bertrand Guenin, Cheolwon Heo:
Recognizing even-cycle and even-cut matroids. Math. Program. 202(1): 515-542 (2023) - 2022
- [j28]Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel:
Testing idealness in the filter oracle model. Oper. Res. Lett. 50(6): 753-755 (2022) - [j27]Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel:
Clean Clutters and Dyadic Fractional Packings. SIAM J. Discret. Math. 36(2): 1012-1037 (2022) - [c10]Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel:
Total Dual Dyadicness and Dyadic Generating Sets. IPCO 2022: 1-14 - 2020
- [j26]Zouhaier Ferchiou, Bertrand Guenin:
A Short Proof of Shih's Isomorphism Theorem on Graphic Subspaces. Comb. 40(6): 805-837 (2020) - [c9]Cheolwon Heo, Bertrand Guenin:
Recognizing Even-Cycle and Even-Cut Matroids. IPCO 2020: 182-195
2010 – 2019
- 2019
- [j25]Ahmad Abdi, Bertrand Guenin:
The Minimally Non-Ideal Binary Clutters with a Triangle. Comb. 39(4): 719-752 (2019) - [j24]Ahmad Abdi, Bertrand Guenin:
The Two-Point Fano and Ideal Binary Clutters. Comb. 39(4): 753-777 (2019) - 2018
- [j23]Ahmad Abdi, Bertrand Guenin:
Packing odd T-joins with at most two terminals. J. Graph Theory 87(4): 587-652 (2018) - 2017
- [c8]Ahmad Abdi, Bertrand Guenin:
The Two-Point Fano and Ideal Binary Clutters. IPCO 2017: 1-12 - 2016
- [j22]Bertrand Guenin:
A survey on flows in graphs and matroids. Discret. Appl. Math. 209: 122-132 (2016) - [j21]Bertrand Guenin, Irene Pivotto, Paul Wollan:
Displaying blocking pairs in signed graphs. Eur. J. Comb. 51: 135-164 (2016) - [j20]Bertrand Guenin, Irene Pivotto, Paul Wollan:
Stabilizer theorems for even cycle matroids. J. Comb. Theory B 118: 44-75 (2016) - [j19]Ahmad Abdi, Andreas Emil Feldmann, Bertrand Guenin, Jochen Könemann, Laura Sanità:
Lehman's Theorem and the Directed Steiner Tree Problem. SIAM J. Discret. Math. 30(1): 141-153 (2016) - [j18]Bertrand Guenin, Leanne Stuive:
Single Commodity-Flow Algorithms for Lifts of Graphic and CoGraphic Matroids. SIAM J. Discret. Math. 30(3): 1775-1797 (2016) - 2015
- [j17]Yogesh Awate, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel:
On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs. Math. Program. 150(2): 459-489 (2015) - 2014
- [c7]Ahmad Abdi, Bertrand Guenin:
The Cycling Property for the Clutter of Odd st-Walks. IPCO 2014: 1-12 - 2013
- [j16]Bertrand Guenin, Irene Pivotto, Paul Wollan:
Relationships between Pairs of Representations of Signed Binary Matroids. SIAM J. Discret. Math. 27(1): 329-341 (2013) - [c6]Bertrand Guenin, Leanne Stuive:
Single Commodity-Flow Algorithms for Lifts of Graphic and Co-graphic Matroids. IPCO 2013: 193-204 - 2011
- [j15]Bertrand Guenin, Robin Thomas:
Packing directed circuits exactly. Comb. 31(4): 397-421 (2011) - 2010
- [i1]Bertrand Guenin, Robin Thomas:
Packing directed circuits exactly. CoRR abs/1012.2749 (2010)
2000 – 2009
- 2009
- [j14]Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel:
Lehman matrices. J. Comb. Theory B 99(3): 531-556 (2009) - 2005
- [j13]Aaron Michael Williams, Bertrand Guenin:
Advances in packing directed joins. Electron. Notes Discret. Math. 19: 249-255 (2005) - 2004
- [j12]Bertrand Guenin, Dhruv Mubayi, Prasad Tetali:
A family of switch equivalent graphs. Discret. Math. 288(1-3): 29-35 (2004) - 2002
- [j11]Gérard Cornuéjols, Bertrand Guenin:
Ideal clutters. Discret. Appl. Math. 123(1-3): 303-338 (2002) - [j10]Gérard Cornuéjols, Bertrand Guenin:
On dijoins. Discret. Math. 243(1-3): 213-216 (2002) - [j9]Bertrand Guenin:
A Short Proof of Seymour's Characterization of the Matroids with the Max-Flow Min-Cut Property. J. Comb. Theory B 86(2): 273-279 (2002) - [j8]James F. Geelen, Bertrand Guenin:
Packing Odd Circuits in Eulerian Graphs. J. Comb. Theory B 86(2): 280-295 (2002) - [j7]Bertrand Guenin:
Integral Polyhedra Related to Even-Cycle and Even-Cut Matroids. Math. Oper. Res. 27(4): 693-710 (2002) - [j6]Gérard Cornuéjols, Bertrand Guenin:
Ideal Binary Clutters, Connectivity, and a Conjecture of Seymour. SIAM J. Discret. Math. 15(3): 329-352 (2002) - [c5]Bertrand Guenin:
A Short Proof of Seymour's Characterization of the Matroids with the Max-Flow Min-Cut Property. IPCO 2002: 188-193 - 2001
- [j5]Bertrand Guenin:
A Characterization of Weakly Bipartite Graphs. J. Comb. Theory B 83(1): 112-168 (2001) - [c4]Bertrand Guenin:
Circuit Mengerian Directed Graphs. IPCO 2001: 185-195 - [c3]Bertrand Guenin:
Integral Polyhedra Related to Even Cycle and Even Cut Matroids. IPCO 2001: 196-209 - 2000
- [j4]Bertrand Guenin:
A Characterization of Weakly Bipartite Graphs. Electron. Notes Discret. Math. 5: 149-151 (2000) - [j3]Gérard Cornuéjols, Bertrand Guenin, François Margot:
The packing property. Math. Program. 89(1): 113-126 (2000)
1990 – 1999
- 1998
- [j2]Bertrand Guenin:
Perfect and Ideal 0, ±1 Matrices. Math. Oper. Res. 23(2): 322-338 (1998) - [c2]Gérard Cornuéjols, Bertrand Guenin, François Margot:
The Packing Property. IPCO 1998: 1-8 - [c1]Bertrand Guenin:
A Characterization of Weakly Bipartite Graphs. IPCO 1998: 9-22 - 1997
- [j1]Edoardo Amaldi, Bertrand Guenin:
Two Constructive Methods for Designing Compact Feedforward Networks of Threshold Units. Int. J. Neural Syst. 8(5-6): 629-645 (1997)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
