| Publication | Date of Publication | Type |
|---|
Dowling geometries representable over rings
Annals of Combinatorics | 2015-05-05 | Paper |
Large non-planar graphs and an application to crossing-critical graphs
Journal of Combinatorial Theory. Series B | 2011-03-14 | Paper |
Unavoidable parallel minors of 4-connected graphs
Journal of Graph Theory | 2009-06-16 | Paper |
An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings
Semigroup Forum | 2007-03-20 | Paper |
The Computational Complexity of Tutte Invariants for Planar Graphs
SIAM Journal on Computing | 2006-06-01 | Paper |
Coloring-flow duality of embedded graphs
Transactions of the American Mathematical Society | 2005-07-26 | Paper |
Latroids and their representation by codes over modules
Transactions of the American Mathematical Society | 2004-08-13 | Paper |
A short proof of non-GF(5)-representability of matroids
Journal of Combinatorial Theory. Series B | 2004-08-06 | Paper |
Excluding any graph as a minor allows a low tree-width 2-coloring
Journal of Combinatorial Theory. Series B | 2004-08-06 | Paper |
Partitioning into graphs with only small components
Journal of Combinatorial Theory. Series B | 2003-08-25 | Paper |
Surfaces, tree-width, clique-minors, and partitions
Journal of Combinatorial Theory. Series B | 2002-12-10 | Paper |
Totally free expansions of matroids.
Journal of Combinatorial Theory. Series B | 2002-12-10 | Paper |
Generalized \(\Delta\text{--}Y\) exchange and \(k\)-regular matroids
Journal of Combinatorial Theory. Series B | 2002-12-10 | Paper |
On the excluded minors for quaternary matroids
Journal of Combinatorial Theory. Series B | 2002-12-10 | Paper |
Infinite antichains of matroids with characteristic set \(\{ p\}\)
Discrete Mathematics | 2002-08-24 | Paper |
Bicycle dimension and special points of the Tutte polynomial
Journal of Combinatorial Theory. Series B | 2000-06-25 | Paper |
Partitioning graphs of bounded tree-width
Combinatorica | 1999-10-31 | Paper |
On maximum-sized near-regular and \(\root 6\of{1}\)-matroids
Graphs and Combinatorics | 1999-06-23 | Paper |
Weak maps and stabilizers of classes of matroids
Advances in Applied Mathematics | 1999-04-06 | Paper |
Unavoidable minors of large 3-connected matroids
Journal of Combinatorial Theory. Series B | 1998-10-05 | Paper |
Lê numbers of arrangements and matroid identities
Journal of Combinatorial Theory. Series B | 1997-11-25 | Paper |
A 2-isomorphism theorem for hypergraphs
Journal of Combinatorial Theory. Series B | 1997-09-15 | Paper |
On inequivalent representations of matroids over finite fields
Journal of Combinatorial Theory. Series B | 1997-02-17 | Paper |
Planar electric networks. II
Commentarii Mathematici Helvetici | 1996-12-03 | Paper |
Unavoidable minors of large 3-connected binary matroids
Journal of Combinatorial Theory. Series B | 1996-11-25 | Paper |
A new approach to solving three combinatorial enumeration problems on planar graphs
Discrete Applied Mathematics | 1996-03-11 | Paper |
The complexity of computing the Tutte polynomial on transversal matroids
Combinatorica | 1995-05-04 | Paper |
scientific article; zbMATH DE number 475610 (Why is no real title available?)
| 1994-05-30 | Paper |
The Computational Complexity of the Tutte Plane: the Bipartite Case
Combinatorics, Probability and Computing | 1994-05-05 | Paper |
Recognizing Polymatroids Associated with Hypergraphs
Combinatorics, Probability and Computing | 1994-04-28 | Paper |
On the computational complexity of the Jones and Tutte polynomials
Mathematical Proceedings of the Cambridge Philosophical Society | 1992-06-25 | Paper |
