| Publication | Date of Publication | Type |
|---|
| A primer on delta-matroids and multimatroids | 2026-02-10 | Paper |
The complexity of the greedoid Tutte polynomial
The Electronic Journal of Combinatorics | 2025-09-25 | Paper |
| The complexity of the greedoid Tutte polynomial | 2023-09-08 | Paper |
| Tensor products of multimatroids and a Brylawski-type formula for the transition polynomial | 2023-09-01 | Paper |
| The critical group of a combinatorial map | 2023-08-25 | Paper |
The U, V, and W polynomials
Handbook of the Tutte Polynomial and Related Topics | 2023-04-28 | Paper |
Irreducibility of the Tutte polynomial of an embedded graph
Algebraic Combinatorics | 2022-12-20 | Paper |
| Topological graph theory through matroid theory | 2022-01-12 | Paper |
Delta-matroids as subsystems of sequences of Higgs lifts
Advances in Applied Mathematics | 2021-04-23 | Paper |
Delta-matroids as subsystems of sequences of Higgs lifts
Advances in Applied Mathematics | 2021-04-23 | Paper |
The excluded 3-minors for vf-safe delta-matroids
Advances in Applied Mathematics | 2021-04-23 | Paper |
The excluded 3-minors for vf-safe delta-matroids
Advances in Applied Mathematics | 2021-04-23 | Paper |
The complexity of solution-free sets of integers for general linear equations
Discrete Applied Mathematics | 2019-11-06 | Paper |
The complexity of solution-free sets of integers for general linear equations
Discrete Applied Mathematics | 2019-11-06 | Paper |
Matroids, delta-matroids and embedded graphs
Journal of Combinatorial Theory. Series A | 2019-08-15 | Paper |
Matroids, delta-matroids and embedded graphs
Journal of Combinatorial Theory. Series A | 2019-08-15 | Paper |
On the interplay between embedded graphs and delta-matroids
Proceedings of the London Mathematical Society | 2019-05-16 | Paper |
On the interplay between embedded graphs and delta-matroids
Proceedings of the London Mathematical Society | 2019-05-16 | Paper |
The \(e\)-exchange basis graph and matroid connectedness
Discrete Mathematics | 2019-01-22 | Paper |
The structure of delta-matroids with width one twists
The Electronic Journal of Combinatorics | 2018-01-15 | Paper |
The structure of delta-matroids with width one twists
The Electronic Journal of Combinatorics | 2018-01-15 | Paper |
On the complexity of generalized chromatic polynomials
Advances in Applied Mathematics | 2018-01-11 | Paper |
On the complexity of generalized chromatic polynomials
Advances in Applied Mathematics | 2018-01-11 | Paper |
How many delta-matroids are there?
European Journal of Combinatorics | 2017-12-21 | Paper |
How many delta-matroids are there?
European Journal of Combinatorics | 2017-12-21 | Paper |
Inductive tools for connected delta-matroids and multimatroids
European Journal of Combinatorics | 2017-06-19 | Paper |
Inductive tools for connected delta-matroids and multimatroids
European Journal of Combinatorics | 2017-06-19 | Paper |
On zeros of the characteristic polynomial of matroids of bounded tree-width
European Journal of Combinatorics | 2016-11-07 | Paper |
The Merino-Welsh conjecture holds for series-parallel graphs
European Journal of Combinatorics | 2014-02-10 | Paper |
| The Tutte polynomial characterizes simple outerplanar graphs | 2013-11-01 | Paper |
Minimizing the oriented diameter of a planar graph
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
On the structure of the \(h\)-vector of a paving matroid
European Journal of Combinatorics | 2012-09-12 | Paper |
On plane graphs with link component number equal to the nullity
Discrete Applied Mathematics | 2012-05-30 | Paper |
The complexity of two graph orientation problems
Discrete Applied Mathematics | 2012-05-04 | Paper |
Maximizing edge-ratio is NP-complete
Discrete Applied Mathematics | 2012-03-19 | Paper |
The Tutte polynomial characterizes simple outerplanar graphs
Combinatorics, Probability and Computing | 2011-08-16 | Paper |
The clustering coefficient of a scale-free random graph
Discrete Applied Mathematics | 2011-06-28 | Paper |
Some inequalities for the Tutte polynomial
European Journal of Combinatorics | 2011-03-04 | Paper |
\(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\)
Discrete Applied Mathematics | 2010-11-05 | Paper |
The equivalence of two graph polynomials and a symmetric function
Combinatorics, Probability and Computing | 2010-04-22 | Paper |
Finding next-to-shortest paths in a graph
Information Processing Letters | 2009-08-27 | Paper |
Evaluating a weighted graph polynomial for graphs of bounded tree-width
The Electronic Journal of Combinatorics | 2009-07-08 | Paper |
Evaluating a weighted graph polynomial for graphs of bounded tree-width
The Electronic Journal of Combinatorics | 2009-07-08 | Paper |
| Counting cocircuits and convex two-colourings is #P-complete | 2008-10-11 | Paper |
| Complexity of graph polynomials | 2007-06-28 | Paper |
Evaluating the Rank Generating Function of a Graphic 2-Polymatroid
Combinatorics, Probability and Computing | 2006-07-06 | Paper |
Cyclic labellings with constraints at two distances
The Electronic Journal of Combinatorics | 2004-10-13 | Paper |
Cyclic labellings with constraints at two distances
The Electronic Journal of Combinatorics | 2004-10-13 | Paper |
Domination analysis of greedy heuristics for the frequency assignment problem.
Discrete Mathematics | 2004-02-02 | Paper |
Improved bounds for the number of forests and acyclic orientations in the square lattice
The Electronic Journal of Combinatorics | 2003-05-13 | Paper |
Improved bounds for the number of forests and acyclic orientations in the square lattice
The Electronic Journal of Combinatorics | 2003-05-13 | Paper |
Optimal arrangement of data in a tree directory
Discrete Applied Mathematics | 2001-01-01 | Paper |
| scientific article; zbMATH DE number 1462935 (Why is no real title available?) | 2000-10-18 | Paper |
A weighted graph polynomial from chromatic invariants of knots
Annales de l’institut Fourier | 1999-07-12 | Paper |
A weighted graph polynomial from chromatic invariants of knots
Annales de l’institut Fourier | 1999-07-12 | Paper |
Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width
Combinatorics, Probability and Computing | 1999-02-02 | Paper |
Recognising a partitionable simplicial complex is in \(\text{NP}\)
Discrete Mathematics | 1997-02-03 | Paper |
A coarse Tutte polynomial for hypermaps
(available as arXiv preprint) | N/A | Paper |
