The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Bert Gerards: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Michele Conforti, Bert Gerards, Ajai Kapoor
    A Theorem of Truemper. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2000, v:20, n:1, pp:15-26 [Journal]
  2. James F. Geelen, Bert Gerards, Neil Robertson, Geoff Whittle
    Obstructions to branch-decomposition of matroids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2006, v:96, n:4, pp:560-570 [Journal]
  3. James F. Geelen, Bert Gerards, Geoff Whittle
    On Rota's conjecture and excluded minors containing large projective geometries. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2006, v:96, n:3, pp:405-425 [Journal]
  4. James F. Geelen, Bert Gerards
    Regular matroid decomposition via signed graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:48, n:1, pp:74-84 [Journal]
  5. Michele Conforti, Bert Gerards, Giacomo Zambelli
    Mixed-Integer Vertex Covers on Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    IPCO, 2007, pp:324-336 [Conf]
  6. Maria Chudnovsky, Jim Geelen, Bert Gerards, Luis A. Goddyn, Michael Lohman, Paul D. Seymour
    Packing Non-Zero A-Paths In Group-Labelled Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2006, v:26, n:5, pp:521-532 [Journal]
  7. Jim Geelen, Bert Gerards, Geoff Whittle
    Excluding a planar graph from GF(q)-representable matroids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2007, v:97, n:6, pp:971-998 [Journal]

Search in 0.001secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002