Bert Gerards
 Full Name
 Dr.ir. A.M.H. Gerards
 Function(s)
 Scientific Staff Member
 Telephone
 +31 20 592
 Room
 None
 Department(s)
 Networks and Optimization
Biography
Bert Gerards obtained his PhD from Tilburg University in 1988, where he worked as Assistant Professor from 1984 till he joined Centrum Wiskunde & Informatica as a senior researcher in 1989. He had already started his PhD research in 1982, when he switched from being a high school teacher in Maastricht to become a research assistant of NWO (first at the University of Amsterdam and then at Tilburg University). Bert Gerards did his masters studies at Eindhoven University of Technology from 1972 till 1981. From 1997 till 2009, Bert Gerards held several management positions at CWI: first 8 years as leader of the group Networks & Optimization and then 4 years as leader of a scientific cluster of 5 research groups and as member of the CWI Management Team. While at CWI, Bert Gerards also was parttime Full Professor at the University of Eindhoven (19992009) and the University of Maastricht (20102014). From 2008 till 2012, he held an (honorary) position as Adjoint Professor at the University of Waterloo. From 1997 till 2007, Bert Gerards served at the editorial boards of Mathematical Programming and SIAM Journal on Discrete Mathematics. Bert Gerards is a 2003 Fulkerson Prize recipient and gave an invited lecture at ICM 2006.Research
Bert Gerards works in combinatorial optimization; his main research interest is matroid theory.
Together with Jim Geelen and Geoff Whittle, Bert Gerards works on their joined Matroid Minors Project, which they started in 1999 to develop a structure theory for minor closed classes of matroids over finite fields, primarily because of its own intrinsic value but also as an instrument toward their 2013 proof of Rota’s conjecture; see Solving Rota's conjecture in Notices AMS, August 2014.
Also Peter Nelson and former CWI postdocs Tony Huynh and Stefan van Zwam participate in the Matroid Minors Project.
Publications

Geelen, J, Gerards, A.M.H, & Whittle, G. (2018). Quasigraphic matroids (corrected version of a paper that was previously retracted at the request of the authors). Journal of Graph Theory, 87(2), 253–264. doi:10.1002/jgt.22177

Geelen, J, Gerards, A.M.H, & Whittle, G. (2018). QuasiGraphic Matroids (retracted). Journal of Graph Theory, 87(2), 265–265. doi:10.1002/jgt.22143

Conforti, M, Gerards, A.M.H, & Pashkovich, K. (2015). Stable sets and graphs with no even holes. Mathematical Programming Series B, 153, 13–39. doi:10.1007/s1010701509123

Geelen, J, Gerards, A.M.H, & Whittle, G. (2015). The Highly Connected Matroids in Minorclosed Classes. Annals of Combinatorics, 19(1), 107–123. doi:10.1007/s0002601502513

Geelen, J, Gerards, A.M.H, & Whittle, G. (2014). Solving Rota’s Conjecture. Notices of the AMS, 61(7), 736–743. doi:10.1090/noti1139

Geelen, J, & Gerards, A.M.H. (2013). Characterizing graphic matroids by a system of linear equations. Journal of Combinatorial Theory  Series B, 103(5), 642–646. doi:10.1016/j.jctb.2013.07.00

Geelen, J, Gerards, A.M.H, & Whittle, G. (2013). Structure in minorclosedclasses of matroids. In Surveys in Combinatorics (pp. 327–362). Cambridge University Press. doi:10.1017/CBO9781139506748.009

Geelen, J, Gerards, A.M.H, & Whittle, G. (2010). On inequivalent representations of matroids over nonprime ﬁelds. Journal of Combinatorial Theory  Series B, 100, 740–743.

Geelen, J, Gerards, A.M.H, & Whittle, G. (2009). Tangles, treedecompositions, and grids in matroids. Journal of Combinatorial Theory  Series B, 99, 657–667.

Geelen, J, Gerards, A.M.H, Reed, B, Seymour, P.D, & Vetta, A. (2009). On the oddminor variant of Hadwiger's conjecture. Journal of Combinatorial Theory  Series B, 99(1), 20–29.