default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJames F. Geelen
Person information
- affiliation: University of Waterloo, Department of Combinatorics and Optimization, Canada
- award (2003): Fulkerson Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j75]Jim Geelen, O-joung Kwon
, Rose McCarty, Paul Wollan:
The Grid Theorem for vertex-minors. J. Comb. Theory B 158(Part): 93-116 (2023)- 2021
- [j74]Jim Geelen, Hao Sun:
A proof of Rado's Theorem via principal extension. Adv. Appl. Math. 126: 102013 (2021) - [j73]Jim Geelen, Cynthia A. Rodríguez Villalobos:
Disjoint non-balanced A-paths in biased graphs. Adv. Appl. Math. 126: 102014 (2021) - 2020
- [j72]Jim Geelen, Florian Hoersch:
Matroid fragility and relaxations of circuit hyperplanes. J. Comb. Theory B 142: 36-42 (2020) - [j71]Rutger Campbell, Jim Geelen:
On the complex-representable excluded minors for real-representability. J. Comb. Theory B 143: 16-28 (2020) - [j70]Jim Geelen, Edward Lee:
Naji's characterization of circle graphs. J. Graph Theory 93(1): 21-33 (2020) - 2019
- [j69]Sally Dong, Jim Geelen:
Improved Bounds for Rota's Basis Conjecture. Comb. 39(2): 265-272 (2019) - 2018
- [j68]Jim Geelen, Rohan Kapadia:
Computing Girth and Cogirth in Perturbed Graphic Matroids. Comb. 38(1): 167-191 (2018) - [j67]Jim Geelen, Tony Huynh, R. Bruce Richter:
Explicit bounds for graph minors. J. Comb. Theory B 132: 80-106 (2018) - [j66]Rong Chen, Jim Geelen:
Infinitely many excluded minors for frame matroids and for lifted-graphic matroids. J. Comb. Theory B 133: 46-53 (2018) - 2017
- [j65]Jim Geelen, Peter Nelson:
Odd circuits in dense binary matroids. Comb. 37(1): 41-47 (2017) - [j64]Jim Geelen, Peter Nelson:
The structure of matroids with a spanning clique or projective geometry. J. Comb. Theory B 127: 65-81 (2017) - 2016
- [j63]Jim Geelen, Peter Nelson:
The critical number of dense triangle-free binary matroids. J. Comb. Theory B 116: 238-249 (2016) - [j62]Jim Geelen, Geoff Whittle:
Certifying non-representability of matroids over prime fields. J. Comb. Theory B 117: 22-33 (2016) - [j61]Shalev Ben-David, Jim Geelen:
On Rota's Conjecture and nested separations in matroids. J. Comb. Theory B 119: 1-11 (2016) - 2015
- [j60]Jim Geelen, Peter Nelson:
An analogue of the Erdős-Stone theorem for finite geometries. Comb. 35(2): 209-214 (2015) - [j59]Jim Geelen, Peter Nelson:
The number of lines in a matroid with no U2, n-minor. Eur. J. Comb. 50: 115-122 (2015) - [j58]Jim Geelen, Peter Nelson:
A density Hales-Jewett theorem for matroids. J. Comb. Theory B 112: 70-77 (2015) - [j57]Jim Geelen, Stefan H. M. van Zwam:
Matroid 3-connectivity and branch width. J. Comb. Theory B 112: 104-123 (2015) - [j56]Jim Geelen, Rohan Kapadia:
Representability of matroids with a large projective geometry minor. J. Comb. Theory B 112: 154-161 (2015) - [j55]Jim Geelen, Peter Nelson:
Projective geometries in exponentially dense matroids. I. J. Comb. Theory B 113: 185-207 (2015) - [j54]Jim Geelen, Peter Nelson:
Matroids denser than a clique. J. Comb. Theory B 114: 51-69 (2015) - 2014
- [j53]Jim Geelen:
A geometric version of the Andrásfai-Erdős-Sós Theorem. Adv. Appl. Math. 59: 1-7 (2014) - 2013
- [j52]Jim Geelen, Peter Nelson:
On minor-closed classes of matroids with exponential growth rate. Adv. Appl. Math. 50(1): 142-154 (2013) - [j51]Jim Geelen, Geoff Whittle:
Inequivalent representations of matroids over prime fields. Adv. Appl. Math. 51(1): 1-175 (2013) - [j50]Jim Geelen, Bert Gerards:
Characterizing graphic matroids by a system of linear equations. J. Comb. Theory B 103(5): 642-646 (2013) - 2011
- [j49]Jim Geelen:
Small cocircuits in matroids. Eur. J. Comb. 32(6): 795-801 (2011) - 2010
- [j48]Jim Geelen, Geoff Whittle:
The projective plane is a stabilizer. J. Comb. Theory B 100(2): 128-131 (2010) - [j47]Jim Geelen, Peter Nelson:
The number of points in a matroid with no n-point line as a minor. J. Comb. Theory B 100(6): 625-630 (2010) - [j46]Jim Geelen, Bert Gerards, Geoff Whittle:
On inequivalent representations of matroids over non-prime fields. J. Comb. Theory B 100(6): 740-743 (2010) - 2009
- [j45]Jim Geelen, Kasper Kabell:
Projective geometries in dense matroids. J. Comb. Theory B 99(1): 1-8 (2009) - [j44]Jim Geelen, Bert Gerards, Bruce A. Reed, Paul D. Seymour, Adrian Vetta:
On the odd-minor variant of Hadwiger's conjecture. J. Comb. Theory B 99(1): 20-29 (2009) - [j43]Jim Geelen, Bert Gerards:
Excluding a group-labelled graph. J. Comb. Theory B 99(1): 247-253 (2009) - [j42]Jim Geelen, Kasper Kabell:
The Erdös-Pósa property for matroid circuits. J. Comb. Theory B 99(2): 407-419 (2009) - [j41]Jim Geelen, Joseph P. S. Kung, Geoff Whittle:
Growth rates of minor-closed classes of matroids. J. Comb. Theory B 99(2): 420-427 (2009) - [j40]Jim Geelen, Bert Gerards, Geoff Whittle:
Tangles, tree-decompositions and grids in matroids. J. Comb. Theory B 99(4): 657-667 (2009) - [j39]Jim Geelen, Sang-il Oum:
Circle graph obstructions under pivoting. J. Graph Theory 61(1): 1-11 (2009) - 2008
- [j38]Jim Geelen:
Some open problems on excluding a uniform matroid. Adv. Appl. Math. 41(4): 628-637 (2008) - [j37]Maria Chudnovsky, William H. Cunningham, Jim Geelen:
An algorithm for packing non-zero A -paths in group-labelled graphs. Comb. 28(2): 145-161 (2008) - [j36]Jim Geelen, Xiangqian Zhou:
Generating weakly 4-connected matroids. J. Comb. Theory B 98(3): 538-557 (2008) - [j35]Jim Geelen, Anjie Guo, David McKinnon:
Straight line embeddings of cubic planar graphs with integer edge lengths. J. Graph Theory 58(3): 270-274 (2008) - 2007
- [j34]Jim Geelen, Bert Gerards, Geoff Whittle:
Excluding a planar graph from GF(q)-representable matroids. J. Comb. Theory B 97(6): 971-998 (2007) - [j33]Jim Geelen, Kerri Webb:
On Rota's Basis Conjecture. SIAM J. Discret. Math. 21(3): 802-804 (2007) - 2006
- [j32]Maria Chudnovsky, Jim Geelen, Bert Gerards, Luis A. Goddyn, Michael Lohman, Paul D. Seymour:
Packing Non-Zero A-Paths In Group-Labelled Graphs. Comb. 26(5): 521-532 (2006) - [j31]James F. Geelen, Bert Gerards, Geoff Whittle:
On Rota's conjecture and excluded minors containing large projective geometries. J. Comb. Theory B 96(3): 405-425 (2006) - [j30]James F. Geelen, Bert Gerards, Neil Robertson, Geoff Whittle:
Obstructions to branch-decomposition of matroids. J. Comb. Theory B 96(4): 560-570 (2006) - [j29]Jim Geelen, Xiangqian Zhou:
A Splitter Theorem for Internally 4-Connected Binary Matroids. SIAM J. Discret. Math. 20(3): 578-587 (2006) - [j28]Jim Geelen, Bert Gerards, Geoff Whittle:
Matroid $T$-Connectivity. SIAM J. Discret. Math. 20(3): 588-596 (2006) - [j27]Jim Geelen, Peter J. Humphries:
Rota's Basis Conjecture for Paving Matroids. SIAM J. Discret. Math. 20(4): 1042-1045 (2006) - 2005
- [j26]James F. Geelen, Satoru Iwata:
Matroid Matching Via Mixed Skew-Symmetric Matrices. Comb. 25(2): 187-215 (2005) - [j25]James F. Geelen, Bert Gerards:
Regular matroid decomposition via signed graphs. J. Graph Theory 48(1): 74-84 (2005) - [j24]Phyllis Koenig, Edward E. Smith, Guila Glosser, Christian Devita, Peachie Moore, Corey McMillan, James F. Geelen, Murray Grossman:
The neural basis for novel semantic categorization. NeuroImage 24(2): 369-383 (2005) - 2004
- [j23]James F. Geelen, R. Bruce Richter, Gelasio Salazar:
Embedding grids in surfaces. Eur. J. Comb. 25(6): 785-792 (2004) - [j22]James F. Geelen, James G. Oxley, Dirk Vertigan, Geoff Whittle:
A short proof of non-GF(5)-representability of matroids. J. Comb. Theory B 91(1): 105-121 (2004) - [j21]James F. Geelen, Dillon Mayhew, Geoff Whittle:
Inequivalent representations of matroids having no U3, 6-minor. J. Comb. Theory B 92(1): 55-67 (2004) - [j20]James F. Geelen, Petr Hlinený, Geoffrey P. Whittle:
Bridging Separations in Matroids. SIAM J. Discret. Math. 18(3): 638-646 (2004) - 2003
- [j19]James F. Geelen, Geoffrey P. Whittle:
Cliques in dense GF(q)-representable matroids. J. Comb. Theory B 87(2): 264-269 (2003) - [j18]James F. Geelen, A. M. H. Gerards, Geoffrey P. Whittle:
Disjoint cocircuits in matroids with large rank. J. Comb. Theory B 87(2): 270-279 (2003) - [j17]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 B 88(2): 261-265 (2003) - [j16]James F. Geelen, Satoru Iwata, Kazuo Murota:
The linear delta-matroid parity problem. J. Comb. Theory B 88(2): 377-398 (2003) - 2002
- [j15]James F. Geelen, James G. Oxley, Dirk Vertigan, Geoffrey P. Whittle:
Totally Free Expansions of Matroids. J. Comb. Theory B 84(1): 130-179 (2002) - [j14]James F. Geelen, A. M. H. Gerards, Geoff Whittle:
Branch-Width and Well-Quasi-Ordering in Matroids and Graphs. J. Comb. Theory B 84(2): 270-290 (2002) - [j13]James F. Geelen, Bertrand Guenin:
Packing Odd Circuits in Eulerian Graphs. J. Comb. Theory B 86(2): 280-295 (2002) - [j12]James F. Geelen, Geoffrey P. Whittle:
Branch-Width and Rota's Conjecture. J. Comb. Theory B 86(2): 315-330 (2002) - 2001
- [j11]James F. Geelen, Geoffrey P. Whittle:
Matroid 4-Connectivity: A Deletion-Contraction Theorem. J. Comb. Theory B 83(1): 15-37 (2001) - 2000
- [j10]James F. Geelen:
An Algebraic Matching Algorithm. Comb. 20(1): 61-70 (2000) - [j9]James F. Geelen, A. M. H. Gerards, Ajai Kapoor:
The Excluded Minors for GF(4)-Representable Matroids. J. Comb. Theory B 79(2): 247-299 (2000) - [j8]James F. Geelen, James G. Oxley, Dirk Vertigan, Geoffrey P. Whittle:
On the Excluded Minors for Quaternary Matroids. J. Comb. Theory B 80(1): 57-68 (2000) - 1999
- [j7]James F. Geelen:
On matroids without a non-Fano minor. Discret. Math. 203(1-3): 279-285 (1999) - 1998
- [j6]André Bouchet, William H. Cunningham, James F. Geelen:
Principally Unimodular Skew-Symmetric Matrices. Comb. 18(4): 461-486 (1998) - [j5]William H. Cunningham, James F. Geelen:
Integral Solutions of Linear Complementarity Problems. Math. Oper. Res. 23(1): 61-68 (1998) - 1997
- [j4]William H. Cunningham, James F. Geelen:
The Optimal Path-Matching Problem. Comb. 17(3): 315-337 (1997) - [j3]James F. Geelen:
A Generalization of Tutte's Characterization of Totally Unimodular Matrices. J. Comb. Theory B 70(1): 101-117 (1997) - 1994
- [j2]N. R. Achuthan, Lou Caccetta, P. Caccetta, James F. Geelen:
Computational methods for the diameter restricted minimum weight spanning tree problem. Australas. J Comb. 10: 51-72 (1994) - 1993
- [j1]James F. Geelen, R. Jaime Simpson:
A two dimensional Steinhaus theorem. Australas. J Comb. 8: 169-198 (1993)
Conference and Workshop Papers
- 2007
- [c2]William H. Cunningham, Jim Geelen:
On Integer Programming and the Branch-Width of the Constraint Matrix. IPCO 2007: 158-166 - 1996
- [c1]William H. Cunningham, James F. Geelen:
The Optimal Path-Matching Problem. FOCS 1996: 78-85
Parts in Books or Collections
- 2013
- [p1]Jim Geelen, Bert Gerards, Geoff Whittle:
Structure in minor-closed classes of matroids. Surveys in Combinatorics 2013: 327-362
Informal and Other Publications
- 2015
- [i1]Jim Geelen, Rohan Kapadia:
Computing girth and cogirth in perturbed graphic matroids. CoRR abs/1504.07647 (2015)
Coauthor Index
aka: A. M. H. Gerards
aka: Geoffrey P. Whittle
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
