James F. Geelen

Jim Geelen: Small cocircuits in matroids. Eur. J. Comb. 32(6): 795-801 (2011)

Jim Geelen, Geoff Whittle: The projective plane is a stabilizer. J. Comb. Theory, Ser. B 100(2): 128-131 (2010)

Jim Geelen, Peter Nelson: The number of points in a matroid with no n-point line as a minor. J. Comb. Theory, Ser. B 100(6): 625-630 (2010)

Jim Geelen, Bert Gerards, Geoff Whittle: On inequivalent representations of matroids over non-prime fields. J. Comb. Theory, Ser. B 100(6): 740-743 (2010)

Jim Geelen, Kasper Kabell: Projective geometries in dense matroids. J. Comb. Theory, Ser. B 99(1): 1-8 (2009)

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)

Jim Geelen, Bert Gerards: Excluding a group-labelled graph. J. Comb. Theory, Ser. B 99(1): 247-253 (2009)

Jim Geelen, Kasper Kabell: The Erdös-Pósa property for matroid circuits. J. Comb. Theory, Ser. B 99(2): 407-419 (2009)

Jim Geelen, Joseph P. S. Kung, Geoff Whittle: Growth rates of minor-closed classes of matroids. J. Comb. Theory, Ser. B 99(2): 420-427 (2009)

Jim Geelen, Bert Gerards, Geoff Whittle: Tangles, tree-decompositions and grids in matroids. J. Comb. Theory, Ser. B 99(4): 657-667 (2009)

Jim Geelen, Sang-il Oum: Circle graph obstructions under pivoting. Journal of Graph Theory 61(1): 1-11 (2009)

Maria Chudnovsky, William H. Cunningham, Jim Geelen: An algorithm for packing non-zero A -paths in group-labelled graphs. Combinatorica 28(2): 145-161 (2008)

Jim Geelen, Xiangqian Zhou: Generating weakly 4-connected matroids. J. Comb. Theory, Ser. B 98(3): 538-557 (2008)

Jim Geelen, Anjie Guo, David McKinnon: Straight line embeddings of cubic planar graphs with integer edge lengths. Journal of Graph Theory 58(3): 270-274 (2008)

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)

Jim Geelen, Kerri Webb: On Rota's Basis Conjecture. SIAM J. Discrete Math. 21(3): 802-804 (2007)

William H. Cunningham, Jim Geelen: On Integer Programming and the Branch-Width of the Constraint Matrix. IPCO 2007: 158-166

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)

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)

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)

Jim Geelen, Xiangqian Zhou: A Splitter Theorem for Internally 4-Connected Binary Matroids. SIAM J. Discrete Math. 20(3): 578-587 (2006)

Jim Geelen, Bert Gerards, Geoff Whittle: Matroid $T$-Connectivity. SIAM J. Discrete Math. 20(3): 588-596 (2006)

Jim Geelen, Peter J. Humphries: Rota's Basis Conjecture for Paving Matroids. SIAM J. Discrete Math. 20(4): 1042-1045 (2006)

James F. Geelen, Satoru Iwata: Matroid Matching Via Mixed Skew-Symmetric Matrices. Combinatorica 25(2): 187-215 (2005)

James F. Geelen, Bert Gerards: Regular matroid decomposition via signed graphs. Journal of Graph Theory 48(1): 74-84 (2005)

James F. Geelen, R. Bruce Richter, Gelasio Salazar: Embedding grids in surfaces. Eur. J. Comb. 25(6): 785-792 (2004)

James F. Geelen, James G. Oxley, Dirk Vertigan, Geoff Whittle: A short proof of non-GF(5)-representability of matroids. J. Comb. Theory, Ser. B 91(1): 105-121 (2004)

James F. Geelen, Dillon Mayhew, Geoff Whittle: Inequivalent representations of matroids having no U_{3, 6}-minor. J. Comb. Theory, Ser. B 92(1): 55-67 (2004)

James F. Geelen, Petr Hlinený, Geoffrey P. Whittle: Bridging Separations in Matroids. SIAM J. Discrete Math. 18(3): 638-646 (2004)

James F. Geelen, Geoffrey P. Whittle: Cliques in dense GF(q)-representable matroids. J. Comb. Theory, Ser. B 87(2): 264-269 (2003)

James F. Geelen, A. M. H. Gerards, Geoffrey P. Whittle: Disjoint cocircuits in matroids with large rank. J. Comb. Theory, Ser. B 87(2): 270-279 (2003)

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, Ser. B 88(2): 261-265 (2003)

James F. Geelen, Satoru Iwata, Kazuo Murota: The linear delta-matroid parity problem. J. Comb. Theory, Ser. B 88(2): 377-398 (2003)

James F. Geelen, James G. Oxley, Dirk Vertigan, Geoffrey P. Whittle: Totally Free Expansions of Matroids. J. Comb. Theory, Ser. B 84(1): 130-179 (2002)

James F. Geelen, A. M. H. Gerards, Geoff Whittle: Branch-Width and Well-Quasi-Ordering in Matroids and Graphs. J. Comb. Theory, Ser. B 84(2): 270-290 (2002)

James F. Geelen, Bertrand Guenin: Packing Odd Circuits in Eulerian Graphs. J. Comb. Theory, Ser. B 86(2): 280-295 (2002)

James F. Geelen, Geoffrey P. Whittle: Branch-Width and Rota's Conjecture. J. Comb. Theory, Ser. B 86(2): 315-330 (2002)

James F. Geelen, Geoffrey P. Whittle: Matroid 4-Connectivity: A Deletion-Contraction Theorem. J. Comb. Theory, Ser. B 83(1): 15-37 (2001)

James F. Geelen: An Algebraic Matching Algorithm. Combinatorica 20(1): 61-70 (2000)

James F. Geelen, A. M. H. Gerards, Ajai Kapoor: The Excluded Minors for GF(4)-Representable Matroids. J. Comb. Theory, Ser. B 79(2): 247-299 (2000)

James F. Geelen, James G. Oxley, Dirk Vertigan, Geoffrey P. Whittle: On the Excluded Minors for Quaternary Matroids. J. Comb. Theory, Ser. B 80(1): 57-68 (2000)

James F. Geelen: On matroids without a non-Fano minor. Discrete Mathematics 203(1-3): 279-285 (1999)

André Bouchet, William H. Cunningham, James F. Geelen: Principally Unimodular Skew-Symmetric Matrices. Combinatorica 18(4): 461-486 (1998)

William H. Cunningham, James F. Geelen: The Optimal Path-Matching Problem. Combinatorica 17(3): 315-337 (1997)

James F. Geelen: A Generalization of Tutte's Characterization of Totally Unimodular Matrices. J. Comb. Theory, Ser. B 70(1): 101-117 (1997)

William H. Cunningham, James F. Geelen: The Optimal Path-Matching Problem. FOCS 1996: 78-85