The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Dirk Vertigan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Dirk Vertigan
    Minor classes (extended abstract). [Citation Graph (0, 0)][DBLP]
    Graph Structure Theory, 1991, pp:495-510 [Conf]
  2. Charles J. Colbourn, J. Scott Provan, Dirk Vertigan
    The Complexity of Computing the Tutte Polynomial on Transversal Matroids. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1995, v:15, n:1, pp:1-10 [Journal]
  3. Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Dirk Vertigan
    Partitioning Graphs of Bounded Tree-Width. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1998, v:18, n:1, pp:1-12 [Journal]
  4. Dirk Vertigan, Dominic J. A. Welsh
    The Compunational Complexity of the Tutte Plane: the Bipartite Case. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:181-187 [Journal]
  5. Dirk Vertigan, Geoff Whittle
    Recognizing Polymatroids Associated with Hypergraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:519-530 [Journal]
  6. Charles J. Colbourn, J. Scott Provan, Dirk Vertigan
    A New Approach to Solving Three Combinatorial Enumeration Problems on Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:60, n:1-3, pp:119-129 [Journal]
  7. Noga Alon, Guoli Ding, Bogdan Oporowski, Dirk Vertigan
    Partitioning into graphs with only small components. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:87, n:2, pp:231-243 [Journal]
  8. Matt DeVos, Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Bruce A. Reed, Paul D. Seymour, Dirk Vertigan
    Excluding any graph as a minor allows a low tree-width 2-coloring. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2004, v:91, n:1, pp:25-41 [Journal]
  9. Guoli Ding, Bogdan Oporowski, James G. Oxley, Dirk Vertigan
    Unavoidable Minors of Large 3-Connected Binary Matroids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1996, v:66, n:2, pp:334-360 [Journal]
  10. James F. Geelen, James G. Oxley, Dirk Vertigan, Geoffrey P. Whittle
    On the Excluded Minors for Quaternary Matroids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2000, v:80, n:1, pp:57-68 [Journal]
  11. James F. Geelen, James G. Oxley, Dirk Vertigan, Geoffrey P. Whittle
    Totally Free Expansions of Matroids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2002, v:84, n:1, pp:130-179 [Journal]
  12. James F. Geelen, James G. Oxley, Dirk Vertigan, Geoff Whittle
    A short proof of non-GF(5)-representability of matroids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2004, v:91, n:1, pp:105-121 [Journal]

Search in 0.015secs, Finished in 0.017secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002