| 2009 |
|---|
| 12 | EE | Jim Geelen,
Bert Gerards,
Bruce A. Reed,
Paul D. Seymour,
Adrian Vetta:
On the odd-minor variant of Hadwiger's conjecture.
J. Comb. Theory, Ser. B 99(1): 20-29 (2009) |
| 11 | EE | Jim Geelen,
Bert Gerards:
Excluding a group-labelled graph.
J. Comb. Theory, Ser. B 99(1): 247-253 (2009) |
| 2007 |
|---|
| 10 | EE | Michele Conforti,
Bert Gerards,
Giacomo Zambelli:
Mixed-Integer Vertex Covers on Bipartite Graphs.
IPCO 2007: 324-336 |
| 9 | EE | Jim Geelen,
Bert Gerards,
Geoff Whittle:
Excluding a planar graph from GF(q)-representable matroids.
J. Comb. Theory, Ser. B 97(6): 971-998 (2007) |
| 8 | EE | Michele Conforti,
Bert Gerards:
Packing Odd Circuits.
SIAM J. Discrete Math. 21(2): 273-302 (2007) |
| 2006 |
|---|
| 7 | EE | Maria Chudnovsky,
Jim Geelen,
Bert Gerards,
Luis A. Goddyn,
Michael Lohman,
Paul D. Seymour:
Packing Non-Zero A-Paths In Group-Labelled Graphs.
Combinatorica 26(5): 521-532 (2006) |
| 6 | EE | James F. Geelen,
Bert Gerards,
Geoff Whittle:
On Rota's conjecture and excluded minors containing large projective geometries.
J. Comb. Theory, Ser. B 96(3): 405-425 (2006) |
| 5 | EE | James F. Geelen,
Bert Gerards,
Neil Robertson,
Geoff Whittle:
Obstructions to branch-decomposition of matroids.
J. Comb. Theory, Ser. B 96(4): 560-570 (2006) |
| 4 | EE | Jim Geelen,
Bert Gerards,
Geoff Whittle:
Matroid $T$-Connectivity.
SIAM J. Discrete Math. 20(3): 588-596 (2006) |
| 2005 |
|---|
| 3 | EE | James F. Geelen,
Bert Gerards:
Regular matroid decomposition via signed graphs.
Journal of Graph Theory 48(1): 74-84 (2005) |
| 2001 |
|---|
| 2 | | Karen Aardal,
Bert Gerards:
Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings
Springer 2001 |
| 2000 |
|---|
| 1 | EE | Michele Conforti,
Bert Gerards,
Ajai Kapoor:
A Theorem of Truemper.
Combinatorica 20(1): 15-26 (2000) |
