James F. Geelen

Orcid: 0000-0003-0411-7903

Affiliations:
  • University of Waterloo, Department of Combinatorics and Optimization, Canada


According to our database1, James F. Geelen authored at least 77 papers between 1993 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
The Grid Theorem for vertex-minors.
J. Comb. Theory B, 2023

2021
Disjoint non-balanced <i>A</i>-paths in biased graphs.
Adv. Appl. Math., 2021

A proof of Rado's Theorem via principal extension.
Adv. Appl. Math., 2021

2020
Naji's characterization of circle graphs.
J. Graph Theory, 2020

Matroid fragility and relaxations of circuit hyperplanes.
J. Comb. Theory B, 2020

On the complex-representable excluded minors for real-representability.
J. Comb. Theory B, 2020

2019
Improved Bounds for Rota's Basis Conjecture.
Comb., 2019

2018
Explicit bounds for graph minors.
J. Comb. Theory B, 2018

Infinitely many excluded minors for frame matroids and for lifted-graphic matroids.
J. Comb. Theory B, 2018

Computing Girth and Cogirth in Perturbed Graphic Matroids.
Comb., 2018

2017
The structure of matroids with a spanning clique or projective geometry.
J. Comb. Theory B, 2017

Odd circuits in dense binary matroids.
Comb., 2017

2016
Certifying non-representability of matroids over prime fields.
J. Comb. Theory B, 2016

The critical number of dense triangle-free binary matroids.
J. Comb. Theory B, 2016

On Rota's Conjecture and nested separations in matroids.
J. Comb. Theory B, 2016

2015
Matroid 3-connectivity and branch width.
J. Comb. Theory B, 2015

Matroids denser than a clique.
J. Comb. Theory B, 2015

Projective geometries in exponentially dense matroids. I.
J. Comb. Theory B, 2015

A density Hales-Jewett theorem for matroids.
J. Comb. Theory B, 2015

Representability of matroids with a large projective geometry minor.
J. Comb. Theory B, 2015

The number of lines in a matroid with no <sub>U</sub><sub>2</sub><sub>, </sub><sub>n</sub>-minor.
Eur. J. Comb., 2015

An analogue of the Erdős-Stone theorem for finite geometries.
Comb., 2015

2014
A geometric version of the Andrásfai-Erdős-Sós Theorem.
Adv. Appl. Math., 2014

2013
Characterizing graphic matroids by a system of linear equations.
J. Comb. Theory B, 2013

Inequivalent representations of matroids over prime fields.
Adv. Appl. Math., 2013

On minor-closed classes of matroids with exponential growth rate.
Adv. Appl. Math., 2013

Structure in minor-closed classes of matroids.
Proceedings of the Surveys in Combinatorics 2013, 2013

2011
Small cocircuits in matroids.
Eur. J. Comb., 2011

2010
The projective plane is a stabilizer.
J. Comb. Theory B, 2010

The number of points in a matroid with no n-point line as a minor.
J. Comb. Theory B, 2010

On inequivalent representations of matroids over non-prime fields.
J. Comb. Theory B, 2010

2009
Circle graph obstructions under pivoting.
J. Graph Theory, 2009

Growth rates of minor-closed classes of matroids.
J. Comb. Theory B, 2009

The Erdös-Pósa property for matroid circuits.
J. Comb. Theory B, 2009

Projective geometries in dense matroids.
J. Comb. Theory B, 2009

Tangles, tree-decompositions and grids in matroids.
J. Comb. Theory B, 2009

On the odd-minor variant of Hadwiger's conjecture.
J. Comb. Theory B, 2009

Excluding a group-labelled graph.
J. Comb. Theory B, 2009

2008
Straight line embeddings of cubic planar graphs with integer edge lengths.
J. Graph Theory, 2008

Generating weakly 4-connected matroids.
J. Comb. Theory B, 2008

An algorithm for packing non-zero <i>A</i> -paths in group-labelled graphs.
Comb., 2008

Some open problems on excluding a uniform matroid.
Adv. Appl. Math., 2008

2007
On Rota's Basis Conjecture.
SIAM J. Discret. Math., 2007

Excluding a planar graph from GF(q)-representable matroids.
J. Comb. Theory B, 2007

On Integer Programming and the Branch-Width of the Constraint Matrix.
Proceedings of the Integer Programming and Combinatorial Optimization, 2007

2006
A Splitter Theorem for Internally 4-Connected Binary Matroids.
SIAM J. Discret. Math., 2006

Rota's Basis Conjecture for Paving Matroids.
SIAM J. Discret. Math., 2006

Matroid $T$-Connectivity.
SIAM J. Discret. Math., 2006

On Rota's conjecture and excluded minors containing large projective geometries.
J. Comb. Theory B, 2006

Obstructions to branch-decomposition of matroids.
J. Comb. Theory B, 2006

Packing Non-Zero A-Paths In Group-Labelled Graphs.
Comb., 2006

2005
The neural basis for novel semantic categorization.
NeuroImage, 2005

Regular matroid decomposition via signed graphs.
J. Graph Theory, 2005

Matroid Matching Via Mixed Skew-Symmetric Matrices.
Comb., 2005

2004
Bridging Separations in Matroids.
SIAM J. Discret. Math., 2004

A short proof of non-GF(5)-representability of matroids.
J. Comb. Theory B, 2004

Inequivalent representations of matroids having no U<sub>3, 6</sub>-minor.
J. Comb. Theory B, 2004

Embedding grids in surfaces.
Eur. J. Comb., 2004

2003
Cliques in dense GF(q)-representable matroids.
J. Comb. Theory B, 2003

The linear delta-matroid parity problem.
J. Comb. Theory B, 2003

Disjoint cocircuits in matroids with large rank.
J. Comb. Theory B, 2003

On the excluded minors for the matroids of branch-width <i>k</i>.
J. Comb. Theory B, 2003

2002
Branch-Width and Rota's Conjecture.
J. Comb. Theory B, 2002

Totally Free Expansions of Matroids.
J. Comb. Theory B, 2002

Branch-Width and Well-Quasi-Ordering in Matroids and Graphs.
J. Comb. Theory B, 2002

Packing Odd Circuits in Eulerian Graphs.
J. Comb. Theory B, 2002

2001
Matroid 4-Connectivity: A Deletion-Contraction Theorem.
J. Comb. Theory B, 2001

2000
On the Excluded Minors for Quaternary Matroids.
J. Comb. Theory B, 2000

The Excluded Minors for GF(4)-Representable Matroids.
J. Comb. Theory B, 2000

An Algebraic Matching Algorithm.
Comb., 2000

1999
On matroids without a non-Fano minor.
Discret. Math., 1999

1998
Integral Solutions of Linear Complementarity Problems.
Math. Oper. Res., 1998

Principally Unimodular Skew-Symmetric Matrices.
Comb., 1998

1997
A Generalization of Tutte's Characterization of Totally Unimodular Matrices.
J. Comb. Theory B, 1997

The Optimal Path-Matching Problem.
Comb., 1997

1994
Computational methods for the diameter restricted minimum weight spanning tree problem.
Australas. J Comb., 1994

1993
A two dimensional Steinhaus theorem.
Australas. J Comb., 1993


  Loading...