Jim Geelen Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJim Geelen, Kasper Kabell: Projective geometries in dense matroids. J. Comb. Theory, Ser. B 99(1): 1-8 (2009)
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJim 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)
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJim Geelen, Bert Gerards: Excluding a group-labelled graph. J. Comb. Theory, Ser. B 99(1): 247-253 (2009)
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJim Geelen, Kasper Kabell: The Erdös-Pósa property for matroid circuits. J. Comb. Theory, Ser. B 99(2): 407-419 (2009)
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJim 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)
2008
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMaria Chudnovsky, William H. Cunningham, Jim Geelen: An algorithm for packing non-zero A -paths in group-labelled graphs. Combinatorica 28(2): 145-161 (2008)
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJim Geelen, Xiangqian Zhou: Generating weakly 4-connected matroids. J. Comb. Theory, Ser. B 98(3): 538-557 (2008)
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJim 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)
2007
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWilliam H. Cunningham, Jim Geelen: On Integer Programming and the Branch-Width of the Constraint Matrix. IPCO 2007: 158-166
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJim Geelen, Bert Gerards, Geoff Whittle: Excluding a planar graph from GF(q)-representable matroids. J. Comb. Theory, Ser. B 97(6): 971-998 (2007)
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJim Geelen, Kerri Webb: On Rota's Basis Conjecture. SIAM J. Discrete Math. 21(3): 802-804 (2007)
2006
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMaria 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)
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJim Geelen, Xiangqian Zhou: A Splitter Theorem for Internally 4-Connected Binary Matroids. SIAM J. Discrete Math. 20(3): 578-587 (2006)
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJim Geelen, Bert Gerards, Geoff Whittle: Matroid $T$-Connectivity. SIAM J. Discrete Math. 20(3): 588-596 (2006)
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJim Geelen, Peter J. Humphries: Rota's Basis Conjecture for Paving Matroids. SIAM J. Discrete Math. 20(4): 1042-1045 (2006)

Coauthor Index

1Maria Chudnovsky [4] [10]
2William H. Cunningham [7] [10]
3Bert Gerards [2] [4] [6] [13] [14]
4Luis A. Goddyn [4]
5Anjie Guo [8]
6Peter J. Humphries [1]
7Kasper Kabell [12] [15]
8Joseph P. S. Kung [11]
9Michael Lohman [4]
10David McKinnon [8]
11Bruce A. Reed [14]
12Paul D. Seymour [4] [14]
13Adrian Vetta [14]
14Kerri Webb [5]
15Geoff Whittle (Geoffrey P. Whittle) [2] [6] [11]
16Xiangqian Zhou [3] [9]

Colors in the list of coauthors

Copyright © Sat Nov 28 20:06:51 2009 by Michael Ley (ley@uni-trier.de)