Jim Geelen

Jim Geelen's AcademicInfluence.com Rankings

Jim Geelen

Mathematics

#1109

World Rank

#1880

Historical Rank

Measure Theory

#4036

World Rank

#4759

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Why Is Jim Geelen Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Jim Geelen is a professor at the Department of Combinatorics and Optimization in the faculty of mathematics at the University of Waterloo, where he holds the Canada Research Chair in Combinatorial optimization. He is known for his work on Matroid theory and the extension of the Graph Minors Project to representable matroids. In 2003, he won the Fulkerson Prize with his co-authors A. M. H. Gerards, and A. Kapoor for their research on Rota's excluded minors conjecture. In 2006, he won the Coxeter–James Prize presented by the Canadian Mathematical Society.

(See a Problem?)

Jim Geelen's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

ON HOW TO DRAW A GRAPH (2012) (389)
Branch-Width and Well-Quasi-Ordering in Matroids and Graphs (2002) (100)
The Excluded Minors for GF(4)-Representable Matroids (1997) (100)
On the odd-minor variant of Hadwiger's conjecture (2009) (69)
Packing Non-Zero A-Paths In Group-Labelled Graphs (2006) (69)
Solving Rota's Conjecture (2014) (63)
Computational methods for the diameter restricted minimum weight spanning tree problem (1994) (60)
The optimal path-matching problem (1996) (52)
On the excluded minors for the matroids of branch-width k (2003) (50)
Excluding a planar graph from GF(q)-representable matroids (2007) (47)
Maximum rank matrix completion (1999) (47)
TOWARDS A MATROID-MINOR STRUCTURE THEORY (2007) (47)
The Highly Connected Matroids in Minor-Closed Classes (2013) (42)
Obstructions to branch-decomposition of matroids (2006) (37)
Tangles, tree-decompositions and grids in matroids (2009) (37)
Growth rates of minor-closed classes of matroids (2009) (36)
An algorithm for packing non-zero A-paths in group-labelled graphs (2008) (34)
Circle graph obstructions under pivoting (2009) (33)
Cliques in dense GF(q)-representable matroids (2003) (31)
Matchings, Matroids and Unimodular Matrices (1995) (31)
The linear delta-matroid parity problem (2003) (30)
Packing Odd Circuits in Eulerian Graphs (2002) (30)
Totally Free Expansions of Matroids (2002) (29)
Some open problems on excluding a uniform matroid (2008) (28)
Embedding grids in surfaces (2004) (28)
On Rota's conjecture and excluded minors containing large projective geometries (2006) (28)
Matroid 4-Connectivity: A Deletion-Contraction Theorem (2001) (28)
Branch-Width and Rota's Conjecture (2002) (26)
The Erdös-Pósa property for matroid circuits (2009) (26)
On Integer Programming and the Branch-Width of the Constraint Matrix (2007) (26)
Rota's Basis Conjecture for Paving Matroids (2006) (26)
On Rota's Basis Conjecture (2007) (26)
Towards a structure theory for matrices and matroids (2006) (26)
Weak Maps and Stabilizers of Classes of Matroids (1998) (25)
A Generalization of Tutte's Characterization of Totally Unimodular Matrices (1997) (24)
A two dimensional Steinhaus theorem (1993) (23)
Matroid Matching Via Mixed Skew-Symmetric Matrices (2005) (22)
Projective geometries in dense matroids (2009) (22)
An Algebraic Matching Algorithm (2000) (19)
Straight line embeddings of cubic planar graphs with integer edge lengths (2008) (19)
A Splitter Theorem for Internally 4-Connected Binary Matroids (2006) (19)
Representation of matroids with a modular plane (2013) (18)
A generalization of the Grid Theorem (2016) (18)
Integral Solutions of Linear Complementarity Problems (1998) (17)
Inequivalent representations of matroids over prime fields (2011) (17)
Principally Unimodular Skew-Symmetric Matrices (1998) (16)
The Grid Theorem for vertex-minors (2019) (16)
Disjoint cocircuits in matroids with large rank (2003) (15)
Generating weakly 4-connected matroids (2008) (14)
Structure in minor-closed classes of matroids (2013) (13)
The critical number of dense triangle-free binary matroids (2014) (12)
Explicit bounds for graph minors (2013) (12)
Quasi‐graphic matroids * (2015) (12)
An analogue of the Erdős-Stone theorem for finite geometries (2015) (11)
The number of points in a matroid with no n-point line as a minor (2010) (11)
Excluding a group-labelled graph (2009) (10)
A density Hales-Jewett theorem for matroids (2012) (9)
Computing Girth and Cogirth in Perturbed Graphic Matroids (2015) (9)
Infinitely many excluded minors for frame matroids and for lifted-graphic matroids (2017) (8)
Improved Bounds for Rota's Basis Conjecture (2017) (8)
Matroids denser than a clique (2014) (8)
Bridging Separations in Matroids (2005) (8)
On the Excluded Minors for Quaternary Matroids (2000) (7)
Matroid $T$-Connectivity (2006) (7)
Characterizing graphic matroids by a system of linear equations (2013) (6)
Inequivalent representations of matroids having no U3, 6-minor (2004) (6)
Matroid 3-connectivity and branch width (2011) (5)
Small cocircuits in matroids (2011) (5)
Lectures on Jump Systems (1996) (5)
Odd circuits in dense binary matroids (2014) (5)
Regular matroid decomposition via signed graphs (2005) (4)
On minor-closed classes of matroids with exponential growth rate (2011) (4)
A short proof of non-GF(5)-representability of matroids (2004) (4)
The projective plane is a stabilizer (2010) (4)
On Rota's Conjecture and nested separations in matroids (2013) (3)
Projective geometries in exponentially dense matroids. I (2012) (3)
On inequivalent representations of matroids over non-prime fields (2010) (3)
On the complex-representable excluded minors for real-representability (2018) (2)
An algebraic approach to matching problems (2007) (2)
Certifying non-representability of matroids over prime fields (2011) (2)
The densest matroids in minor-closed classes with exponential growth rate (2014) (2)
A geometric version of the Andrásfai-Erdős-Sós Theorem (2014) (2)
Naji's characterization of circle graphs (2018) (2)
Alternating paths revisited I: even factors (2004) (1)
Matroid fragility and relaxations of circuit hyperplanes (2018) (1)
On matroids without a non-Fano minor (1999) (1)
On the structure of dense triangle-free binary matroids (2015) (1)
The number of lines in a matroid with no U2, n-minor (2013) (1)
Lectures on Jump Systems Lectures on Jump Systems (1996) (0)
Improved Bounds for Rota's Basis Conjecture (2018) (0)
The Highly Connected Matroids in Minor-Closed Classes (2015) (0)
An analogue of the Erdős-Stone theorem for finite geometries (2014) (0)
An algebraic approach to matching problems (Algorithm Engineering as a New Paradigm) (2001) (0)
A proof of Rado's Theorem via principal extension (2020) (0)
A Sylvester-Gallai-type theorem for complex-representable matroids (2022) (0)
Quasi-Graphic Matroids (retracted) (2018) (0)
Textbook of limnology: Gerald A. Cole. The C.V. Mosby Company, St. Louis, 1975, 283 pp., $13.15, ISBN 0-8016-1015-X (1978) (0)
Growth-Rates of Matroid Classes (2012) (0)
Disjoint non-balanced A-paths in biased graphs (2020) (0)
Odd circuits in dense binary matroids (2015) (0)
Excluding a line from $\mathbb C$-representable matroids (2021) (0)
An analogue of the Erd\H{o}s-Stone theorem for finite geometries (2012) (0)
Representability of matroids with a large projective geometry minor (2013) (0)
The structure of matroids with a spanning clique or projective geometry (2016) (0)
CORR 2000-47 Embedding Grids in Surfaces (0)
C O ] 5 F eb 2 01 8 IMPROVED BOUNDS FOR ROTA ’ S BASIS (2018) (0)
Computing Girth and Cogirth in Perturbed Graphic Matroids (2017) (0)

This paper list is powered by the following services:

Other Resources About Jim Geelen

en.wikipedia.org

What Schools Are Affiliated With Jim Geelen?

Jim Geelen is affiliated with the following schools:

University of Waterloo