The following pages link to (Q4871759):
Displaying 19 items.
- On the complexity of recognizing directed path families (Q967290) (← links)
- Setup optimization problems with matroid structure (Q1092934) (← links)
- Discrete convex analysis (Q1290668) (← links)
- Algorithms for measuring perturbality in matroid optimization (Q1297736) (← links)
- Shifted matroid optimization (Q1694792) (← links)
- Phylogenetic flexibility via Hall-type inequalities and submodularity (Q1736949) (← links)
- Extension of M-convexity and L-convexity to polyhedral convex functions (Q1841175) (← links)
- Matroid optimization problems with monotone monomials in the objective (Q2064281) (← links)
- Tree automata and pigeonhole classes of matroids. I (Q2149094) (← links)
- Excluding Kuratowski graphs and their duals from binary matroids (Q2396894) (← links)
- Obstructions to branch-decomposition of matroids (Q2496205) (← links)
- Combinatorial optimization. Networks and matroids (Q2718910) (← links)
- Matroid Theory for Algebraic Geometers (Q2833351) (← links)
- On Vertices and Facets of Combinatorial 2-Level Polytopes (Q2835675) (← links)
- A Protocol for Cutting Matroids Like Cakes (Q2937759) (← links)
- A Parameterized View on Matroid Optimization Problems (Q3613798) (← links)
- (Q3717069) (← links)
- Nonseparating Cocircuits in Binary Matroids (Q5020847) (← links)
- Approximate Maximin Share Allocations in Matroids (Q5283377) (← links)