scientific article; zbMATH DE number 863480
From MaRDI portal
Publication:4871759
Cited in
(18)- Extension of M-convexity and L-convexity to polyhedral convex functions
- On the complexity of recognizing directed path families
- Combinatorial optimization. Networks and matroids
- Phylogenetic flexibility via Hall-type inequalities and submodularity
- A protocol for cutting matroids like cakes
- Approximate maximin share allocations in matroids
- Algorithms for measuring perturbality in matroid optimization
- Setup optimization problems with matroid structure
- Tree automata and pigeonhole classes of matroids. I
- Matroid optimization problems with monotone monomials in the objective
- Nonseparating Cocircuits in Binary Matroids
- Discrete convex analysis
- A Parameterized View on Matroid Optimization Problems
- Excluding Kuratowski graphs and their duals from binary matroids
- Shifted matroid optimization
- scientific article; zbMATH DE number 3946155 (Why is no real title available?)
- Matroid Theory for Algebraic Geometers
- Obstructions to branch-decomposition of matroids
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4871759)
