default search action
Bert Gerards
Person information
- affiliation: National Research Institute for Mathematics and Computer Science, Amsterdam, Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
- [j33]Michele Conforti, Bert Gerards, Kanstantsin Pashkovich:
Stable sets and graphs with no even holes. Math. Program. 153(1): 13-39 (2015) - 2013
- [j32]Jim Geelen, Bert Gerards:
Characterizing graphic matroids by a system of linear equations. J. Comb. Theory B 103(5): 642-646 (2013) - [p1]Jim Geelen, Bert Gerards, Geoff Whittle:
Structure in minor-closed classes of matroids. Surveys in Combinatorics 2013: 327-362 - 2010
- [j31]Jim Geelen, Bert Gerards, Geoff Whittle:
On inequivalent representations of matroids over non-prime fields. J. Comb. Theory B 100(6): 740-743 (2010)
2000 – 2009
- 2009
- [j30]Jim Geelen, Bert Gerards, Bruce A. Reed, Paul D. Seymour
, Adrian Vetta:
On the odd-minor variant of Hadwiger's conjecture. J. Comb. Theory B 99(1): 20-29 (2009) - [j29]Jim Geelen, Bert Gerards:
Excluding a group-labelled graph. J. Comb. Theory B 99(1): 247-253 (2009) - [j28]Jim Geelen, Bert Gerards, Geoff Whittle:
Tangles, tree-decompositions and grids in matroids. J. Comb. Theory B 99(4): 657-667 (2009) - 2007
- [j27]Jim Geelen, Bert Gerards, Geoff Whittle:
Excluding a planar graph from GF(q)-representable matroids. J. Comb. Theory B 97(6): 971-998 (2007) - [j26]Michele Conforti, Bert Gerards:
Packing Odd Circuits. SIAM J. Discret. Math. 21(2): 273-302 (2007) - [c3]Michele Conforti, Bert Gerards, Giacomo Zambelli:
Mixed-Integer Vertex Covers on Bipartite Graphs. IPCO 2007: 324-336 - 2006
- [j25]Maria Chudnovsky
Packing Non-Zero A-Paths In Group-Labelled Graphs. Comb. 26(5): 521-532 (2006) - [j24]James F. Geelen, Bert Gerards, Geoff Whittle:
On Rota's conjecture and excluded minors containing large projective geometries. J. Comb. Theory B 96(3): 405-425 (2006) - [j23]James F. Geelen, Bert Gerards, Neil Robertson, Geoff Whittle:
Obstructions to branch-decomposition of matroids. J. Comb. Theory B 96(4): 560-570 (2006) - [j22]Jim Geelen, Bert Gerards, Geoff Whittle:
Matroid $T$-Connectivity. SIAM J. Discret. Math. 20(3): 588-596 (2006) - 2005
- [j21]James F. Geelen, Bert Gerards:
Regular matroid decomposition via signed graphs. J. Graph Theory 48(1): 74-84 (2005) - 2004
- [e2]Bert Gerards:
Algorithmic MeThods and Models for Optimization of RailwayS, ATMOS 2003, Budapest, Hungary, September 15-20, 2003. Electronic Notes in Theoretical Computer Science 92, Elsevier 2004 [contents] - 2003
- [j20]James F. Geelen, A. M. H. Gerards, Geoffrey P. Whittle:
Disjoint cocircuits in matroids with large rank. J. Comb. Theory B 87(2): 270-279 (2003) - [j19]James F. Geelen, A. M. H. Gerards, Neil Robertson, Geoff Whittle:
On the excluded minors for the matroids of branch-width k. J. Comb. Theory B 88(2): 261-265 (2003) - [j18]A. M. H. Gerards, Gábor Maróti, Alexander Schrijver:
Note On: N. E. Aguilera, M. S. Escalante, G. L. Nasini, "A Generalization of the Perfect Graph Theorem Under the Disjunctive Index". Math. Oper. Res. 28(4): 884-885 (2003) - [c2]Bert Gerards, Alberto Marchetti-Spaccamela
Preface. ATMOS 2003: 1-2 - 2002
- [j17]James F. Geelen, A. M. H. Gerards, Geoff Whittle:
Branch-Width and Well-Quasi-Ordering in Matroids and Graphs. J. Comb. Theory B 84(2): 270-290 (2002) - 2001
- [e1]Karen I. Aardal, Bert Gerards:
Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings. Lecture Notes in Computer Science 2081, Springer 2001, ISBN 3-540-42225-0 [contents] - 2000
- [j16]Michele Conforti, Bert Gerards, Ajai Kapoor:
A Theorem of Truemper. Comb. 20(1): 15-26 (2000) - [j15]James F. Geelen, A. M. H. Gerards, Ajai Kapoor:
The Excluded Minors for GF(4)-Representable Matroids. J. Comb. Theory B 79(2): 247-299 (2000)
1990 – 1999
- 1998
- [j14]A. M. H. Gerards, F. Bruce Shepherd:
Strong orientations without even directed circuits. Discret. Math. 188(1-3): 111-125 (1998) - [j13]A. M. H. Gerards, F. Bruce Shepherd:
The Graphs with All Subgraphs T-Perfect. SIAM J. Discret. Math. 11(4): 524-545 (1998) - 1995
- [j12]A. M. H. Gerards, Monique Laurent:
A Characterization of Box 1/d-Integral Binary Clutters. J. Comb. Theory B 65(2): 186-207 (1995) - [j11]A. M. H. Gerards:
On Tutt's Characterization of graphic matroids - a graphic proof. J. Graph Theory 20(3): 351-359 (1995) - 1994
- [j10]A. M. H. Gerards:
An Orientation Theorem for Graphs. J. Comb. Theory B 62(2): 199-212 (1994) - 1992
- [j9]A. M. H. Gerards:
On shortest T-joins and packing T-cuts. J. Comb. Theory B 55(1): 73-82 (1992) - 1991
- [j8]A. M. H. Gerards:
Book review. ZOR Methods Model. Oper. Res. 35(5): 435-436 (1991) - [j7]A. M. H. Gerards:
Compact systems for T-join and perfect matching polyhedra of graphs with bounded genus. Oper. Res. Lett. 10(7): 377-382 (1991) - 1990
- [c1]Albertus M. H. Gerards:
On Cutting Planes and Matrices. Polyhedral Combinatorics 1990: 29-32
1980 – 1989
- 1989
- [j6]A. M. H. Gerards:
A min-max relation for stable sets in graphs with no odd-K4. J. Comb. Theory B 47(3): 330-348 (1989) - 1988
- [j5]A. M. H. Gerards:
Homomorphisms of graphs into odd cycles. J. Graph Theory 12(1): 73-83 (1988) - 1987
- [j4]Albertus M. H. Gerards, András Sebö:
Total dual integrality implies local strong unimodularity. Math. Program. 38(1): 69-73 (1987) - 1986
- [j3]A. M. H. Gerards, Alexander Schrijver:
Matrices with the Edmonds - Johnson property. Comb. 6(4): 365-379 (1986) - [j2]William J. Cook, A. M. H. Gerards, Alexander Schrijver, Éva Tardos:
Sensitivity theorems in integer linear programming. Math. Program. 34(3): 251-264 (1986) - 1985
- [j1]A. M. H. Gerards:
Testing the Odd Bicycle Wheel Inequalities for the Bipartite Subgraph Polytope. Math. Oper. Res. 10(2): 359-360 (1985)
Coauthor Index
aka: Jim Geelen
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 20:16 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: