scientific article; zbMATH DE number 5047784
From MaRDI portal
Publication:5484515
zbMath1115.05001MaRDI QIDQ5484515
Publication date: 21 August 2006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items (only showing first 100 items - show all)
Generalized weights of codes over rings and invariants of monomial ideals ⋮ Fully dynamic clustering and diversity maximization in doubling metrics ⋮ Proto-exact categories of modules over semirings and hyperrings ⋮ The Tutte polynomial of matroids constructed by a family of splitting operations ⋮ Approximation in mechanism design with interdependent values ⋮ Topology of augmented Bergman complexes ⋮ Matroids arising from electrical networks ⋮ On the Complexity of Stackelberg Matroid Pricing Problems ⋮ Homological properties of Orlik-Solomon algebras ⋮ Sublinear circuits for polyhedral sets ⋮ Tight Revenue Gaps among Multiunit Mechanisms ⋮ Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits ⋮ On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids ⋮ Two cryptomorphic formalizations of projective incidence geometry ⋮ Deterministic parameterized algorithms for the graph motif problem ⋮ Matroid bases with cardinality constraints on the intersection ⋮ Formal barriers to simple algorithms for the matroid secretary problem ⋮ Regular Matroids Have Polynomial Extension Complexity ⋮ Greedy-type resistance of combinatorial problems ⋮ Multigraded shifts of matroidal ideals ⋮ Simultaneous feedback edge set: a parameterized perspective ⋮ Pure \(O\)-sequences and matroid \(h\)-vectors ⋮ Signed-graphic matroids with all-graphic cocircuits ⋮ The matroid intersection cover problem ⋮ Finding even subgraphs even faster ⋮ The complexity of degree anonymization by graph contractions ⋮ Computing the largest bond and the maximum connected cut of a graph ⋮ Hopf algebras for matroids over hyperfields ⋮ Extended formulations for matroid polytopes through randomized protocols ⋮ Auctions with interdependence and SOS: improved approximation ⋮ Generalized permutohedra, \(h\)-vectors of cotransversal matroids and pure \(O\)-sequences ⋮ A splitter theorem on 3-connected matroids ⋮ Rotor-Routing Induces the Only Consistent Sandpile Torsor Structure on Plane Graphs ⋮ Polynomial Kernel for Interval Vertex Deletion ⋮ Tutte polynomials for regular oriented matroids ⋮ Tangle bases: Revisited ⋮ Rational roots of all‐terminal reliability ⋮ A combinatorial mapping for the higher-dimensional matrix-tree theorem ⋮ Formalizing Some “Small” Finite Models of Projective Geometry in Coq ⋮ On ideal and weakly-ideal access structures ⋮ Tropical moduli spaces of rational graphically stable curves ⋮ On Fair Division under Heterogeneous Matroid Constraints ⋮ Proto-exact categories of matroids, Hall algebras, and \(K\)-theory ⋮ Rough set methods in feature selection via submodular function ⋮ Broken circuit complexes and hyperplane arrangements ⋮ Higher dimensional electrical circuits ⋮ Spanning trees with specified differences in Cayley graphs ⋮ Unnamed Item ⋮ Structure on the top homology and related algorithms ⋮ Hyperplane arrangements and Milnor fibrations ⋮ Evaluation and interpolation over multivariate skew polynomial rings ⋮ The joints problem for matroids ⋮ Classification of external zonotopal algebras ⋮ VARIETIES OF SIGNATURE TENSORS ⋮ Wei-type duality theorems for matroids ⋮ On minors avoiding elements in matroids ⋮ Stiefel tropical linear spaces ⋮ A matroid-friendly basis for the quasisymmetric functions ⋮ Broken circuit complexes of series-parallel networks ⋮ The algebraic matroid of the finite unit norm tight frame (funtf) variety ⋮ On decomposable correlation matrices ⋮ On graphs uniquely defined by their \(K\)-circular matroids ⋮ Grassmann homomorphism and Hajós-type theorems ⋮ Dilworth truncations and \(k\)-induced matroids ⋮ \(k\)-sum decomposition of strongly unimodular matrices ⋮ \(k\)-circular matroids of graphs ⋮ Ghost symmetry and an analogue of Steinitz's theorem ⋮ Combinatorial optimization with interaction costs: complexity and solvable cases ⋮ On the half-plane property and the Tutte group of a matroid ⋮ On posets and independence spaces ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Triangle-roundedness in matroids ⋮ How many circuits determine an oriented matroid? ⋮ Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees ⋮ Contractible edges in 3-connected graphs that preserve a minor ⋮ Quantitative combinatorial geometry for concave functions ⋮ Buchstaber invariant theory of simplicial complexes and convex polytopes ⋮ Information hiding using matroid theory ⋮ Parameterized complexity of conflict-free set cover ⋮ Diversity, dependence and independence ⋮ Fast exact algorithms for survivable network design with uniform requirements ⋮ Transition operations over plane trees ⋮ P-flag spaces and incidence stratifications ⋮ Detecting binomiality ⋮ Unnamed Item ⋮ Parameterized complexity of geometric covering problems having conflicts ⋮ Subdeterminant Maximization via Nonconvex Relaxations and Anti-Concentration ⋮ Recognizing Cartesian products of matrices and polytopes ⋮ Single Commodity-Flow Algorithms for Lifts of Graphic and CoGraphic Matroids ⋮ On the regularity of orientable matroids ⋮ A family of matrix-tree multijections ⋮ The matroid stratification of the Hilbert scheme of points on \(\mathbb{P}^1\) ⋮ Theory and applications of linearized multivariate skew polynomials ⋮ On Vertices and Facets of Combinatorial 2-Level Polytopes ⋮ On the reliability roots of simplicial complexes and matroids ⋮ Quotients of uniform positroids ⋮ An overview of complex fractal dimensions: from fractal strings to fractal drums, and back ⋮ Electrical networks and hyperplane arrangements ⋮ On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes)
This page was built for publication:
