Available identifiers
zbMath Open van-zwam.stefan-h-mMaRDI QIDQ414651
List of research outcomes
|
On the Highly Connected Dyadic, Near-Regular, and Sixth-Root-of-Unity Matroids | 2021-06-28 | Paper |
The Highly Connected Even-Cycle and Even-Cut Matroids | 2019-01-09 | Paper |
On perturbations of highly connected dyadic matroids | 2018-10-05 | Paper |
Relaxations of \(\mathrm{GF}(4)\)-representable matroids | 2018-06-27 | Paper |
Templates for Binary Matroids | 2017-03-16 | Paper |
The Structure of $\{U_{2,5}, U_{3,5}\}$-Fragile Matroids | 2016-09-06 | Paper |
Fan-extensions in fragile matroids | 2015-06-02 | Paper |
Matroid 3-connectivity and branch width | 2015-05-04 | Paper |
The maximum-likelihood decoding threshold for graphic codes | 2015-04-20 | Paper |
Intertwining Connectivities in Representable Matroids | 2014-06-19 | Paper |
Computer-verification of the structure of some classes of fragile matroids | 2013-12-05 | Paper |
Skew partial fields, multilinear representations of matroids, and a matrix tree theorem | 2013-01-14 | Paper |
On the relative importance of excluded minors | 2013-01-14 | Paper |
The structure of graphs with a vital linkage of order 2 | 2012-09-12 | Paper |
Stability, fragility, and Rota's conjecture | 2012-05-11 | Paper |
An Obstacle to a Decomposition Theorem for Near-Regular Matroids | 2011-10-27 | Paper |
The excluded minors for near-regular matroids | 2011-08-09 | Paper |
https://portal.mardi4nfdi.de/entity/Q3010510 | 2011-07-04 | Paper |
Confinement of matroid representations to subsets of partial fields | 2010-11-05 | Paper |
Lifts of matroid representations over partial fields | 2010-05-05 | Paper |
The Hydra-k partial fields | 2010-03-08 | Paper |
A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game | 2008-10-28 | Paper |
New Korkin–Zolotarev Inequalities | 2008-02-25 | Paper |
Automata, Languages and Programming | 2006-01-10 | Paper |
Research outcomes over time
Doctoral students
No records found.
Known relations from the MaRDI Knowledge Graph
This page was built for person: Stefan H. M. Van Zwam