Bert Gerards

According to our database, Bert Gerards authored at least 37 papers between 1985 and 2015.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2015

Stable sets and graphs with no even holes.

Michele Conforti, Bert Gerards, Kanstantsin Pashkovich

Math. Program., 2015

2013

Characterizing graphic matroids by a system of linear equations.

Jim Geelen, Bert Gerards

J. Comb. Theory, Ser. B, 2013

Structure in minor-closed classes of matroids.

Jim Geelen, Bert Gerards, Geoff Whittle

Proceedings of the Surveys in Combinatorics 2013, 2013

2010

On inequivalent representations of matroids over non-prime fields.

Jim Geelen, Bert Gerards, Geoff Whittle

J. Comb. Theory, Ser. B, 2010

2009

Tangles, tree-decompositions and grids in matroids.

Jim Geelen, Bert Gerards, Geoff Whittle

J. Comb. Theory, Ser. B, 2009

On the odd-minor variant of Hadwiger's conjecture.

Jim Geelen, Bert Gerards, Bruce A. Reed, Paul D. Seymour, Adrian Vetta

J. Comb. Theory, Ser. B, 2009

Excluding a group-labelled graph.

Jim Geelen, Bert Gerards

J. Comb. Theory, Ser. B, 2009

2007

Packing Odd Circuits.

Michele Conforti, Bert Gerards

SIAM J. Discret. Math., 2007

Excluding a planar graph from GF(q)-representable matroids.

Jim Geelen, Bert Gerards, Geoff Whittle

J. Comb. Theory, Ser. B, 2007

Mixed-Integer Vertex Covers on Bipartite Graphs.

Michele Conforti, Bert Gerards, Giacomo Zambelli

Proceedings of the Integer Programming and Combinatorial Optimization, 2007

2006

Matroid $T$-Connectivity.

Jim Geelen, Bert Gerards, Geoff Whittle

SIAM J. Discret. Math., 2006

On Rota's conjecture and excluded minors containing large projective geometries.

James F. Geelen, Bert Gerards, Geoff Whittle

J. Comb. Theory, Ser. B, 2006

Obstructions to branch-decomposition of matroids.

James F. Geelen, Bert Gerards, Neil Robertson, Geoff Whittle

J. Comb. Theory, Ser. B, 2006

Packing Non-Zero A-Paths In Group-Labelled Graphs.

Maria Chudnovsky, Jim Geelen, Bert Gerards, Luis A. Goddyn, Michael Lohman, Paul D. Seymour

Comb., 2006

2005

Regular matroid decomposition via signed graphs.

James F. Geelen, Bert Gerards

J. Graph Theory, 2005

2003

Note On: N. E. Aguilera, M. S. Escalante, G. L. Nasini, "A Generalization of the Perfect Graph Theorem Under the Disjunctive Index".

A. M. H. Gerards, Gábor Maróti, Alexander Schrijver

Math. Oper. Res., 2003

Disjoint cocircuits in matroids with large rank.

James F. Geelen, A. M. H. Gerards, Geoffrey P. Whittle

J. Comb. Theory, Ser. B, 2003

On the excluded minors for the matroids of branch-width <i>k</i>.

James F. Geelen, A. M. H. Gerards, Neil Robertson, Geoff Whittle

J. Comb. Theory, Ser. B, 2003

Preface.

Bert Gerards, Alberto Marchetti-Spaccamela

Proceedings of the Algorithmic MeThods and Models for Optimization of RailwayS, 2003

2002

Branch-Width and Well-Quasi-Ordering in Matroids and Graphs.

James F. Geelen, A. M. H. Gerards, Geoff Whittle

J. Comb. Theory, Ser. B, 2002

2000

The Excluded Minors for GF(4)-Representable Matroids.

James F. Geelen, A. M. H. Gerards, Ajai Kapoor

J. Comb. Theory, Ser. B, 2000

A Theorem of Truemper.

Michele Conforti, Bert Gerards, Ajai Kapoor

Comb., 2000

1998

The Graphs with All Subgraphs T-Perfect.

A. M. H. Gerards, F. Bruce Shepherd

SIAM J. Discret. Math., 1998

Strong orientations without even directed circuits.

A. M. H. Gerards, F. Bruce Shepherd

Discret. Math., 1998

1995

On Tutt's Characterization of graphic matroids - a graphic proof.

A. M. H. Gerards

J. Graph Theory, 1995

A Characterization of Box 1/d-Integral Binary Clutters.

A. M. H. Gerards, Monique Laurent

J. Comb. Theory, Ser. B, 1995

1994

An Orientation Theorem for Graphs.

A. M. H. Gerards

J. Comb. Theory, Ser. B, 1994

1992

On shortest <i>T</i>-joins and packing <i>T</i>-cuts.

A. M. H. Gerards

J. Comb. Theory, Ser. B, 1992

1991

Compact systems for T-join and perfect matching polyhedra of graphs with bounded genus.

A. M. H. Gerards

Oper. Res. Lett., 1991

Book review.

A. M. H. Gerards

ZOR Methods Model. Oper. Res., 1991

1990

On Cutting Planes and Matrices.

Albertus M. H. Gerards

Proceedings of the Polyhedral Combinatorics, 1990

1989

A min-max relation for stable sets in graphs with no odd-<i>K</i>₄.

A. M. H. Gerards

J. Comb. Theory, Ser. B, 1989

1988

Homomorphisms of graphs into odd cycles.

A. M. H. Gerards

J. Graph Theory, 1988

1987

Total dual integrality implies local strong unimodularity.

Albertus M. H. Gerards, András Sebö

Math. Program., 1987

1986

Sensitivity theorems in integer linear programming.

William J. Cook, A. M. H. Gerards, Alexander Schrijver, Éva Tardos

Math. Program., 1986

Matrices with the Edmonds - Johnson property.

A. M. H. Gerards, Alexander Schrijver

Comb., 1986

1985

Testing the Odd Bicycle Wheel Inequalities for the Bipartite Subgraph Polytope.

A. M. H. Gerards

Math. Oper. Res., 1985