scientific article; zbMATH DE number 3561367
From MaRDI portal
Publication:4133994
Cited in
(only showing first 100 items - show all)- A parameterized view on matroid optimization problems
- An extremal problem for sets with applications to graph theory
- Critical hypergraphs and interesting set-pair systems
- Linear and combinatorial sharing problems
- On the kernel of intersecting families
- Generalized polymatroids and submodular flows
- Helly-type theorems for varieties
- Amalgamation of matroids and its applications
- An extremal problem for two families of sets
- Polymatroids: Construction and random algorithms
- Stable sets and polynomials
- Some combinatorial-algebraic problems from complexity theory
- A randomized polynomial kernel for subset feedback vertex set
- Point-hyperplane frameworks, slider joints, and rigidity preserving transformations
- Matchings and covers in hypergraphs
- A Helly type theorem for hypersurfaces
- On two set-systems with restricted cross-intersections
- Arrangements, channel assignments, and associated polynomials
- Flattening rank and its combinatorial applications
- A generalization of the Bollobás set pairs inequality
- Bollobás-type theorems for hemi-bundled two families
- Weak saturation numbers of \(K_{2, t}\) and \(K_p \bigcup K_q\)
- Set systems related to a house allocation problem
- Weak saturation numbers of complete bipartite graphs in the clique
- Minimum clique-free subgraphs of Kneser graphs
- Metrical service systems with multiple servers
- Intersecting families of discrete structures are typically trivial
- Exact bounds for some hypergraph saturation problems
- Computing the chromatic number using graph decompositions via matrix rank
- Unavoidable minors for connected 2-polymatroids
- On the number of maximal intersecting \(k\)-uniform families and further applications of Tuza's set pair method
- Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- A splitter theorem for 3-connected 2-polymatroids
- Matroid matching with Dilworth truncation
- On the exterior algebra method applied to restricted set addition
- On the number of zero-patterns of a sequence of polynomials
- A wheels-and-whirls theorem for 3-connected 2-polymatroids
- Graphic submodular function minimization: a graphic approach and applications
- A randomized polynomial kernelization for vertex cover with a smaller parameter
- Subspace arrangements, graph rigidity and derandomization through submodular optimization
- Matroids of gain graphs in applied discrete geometry
- Bounds on the Maximum Number of Vectors with given Scalar Products
- On Generic Rigidity in the Plane
- Bounding the payment of approximate truthful mechanisms
- \(K_{s,t}\)-saturated bipartite graphs
- Minimizing the number of edges in \(K_{(s,t)}\)-saturated bipartite graphs
- Parameterized algorithms for zero extension and metric labelling problems
- Computing the Chromatic Number Using Graph Decompositions via Matrix Rank
- Combinatorics in the exterior algebra and the Bollobás two families theorem
- Rank vertex cover as a natural problem for algebraic compression
- Duality for balanced submodular flows
- Weakly saturated hypergraphs and a conjecture of Tuza
- Long running times for hypergraph bootstrap percolation
- Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank
- Weak saturation stability
- On the running time of hypergraph bootstrap percolation
- Weak saturation number of a complete bipartite graph
- Rainbow Saturation for Complete Graphs
- Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022
- The Excluded Minors for Three Classes of 2-Polymatroids Having Special Types of Natural Matroids
- The Natural Matroid of an Integer Polymatroid
- Inclusion matrices for rainbow subsets
- Tolerance in Helly-type theorems
- The rainbow saturation number is linear
- Almost intersecting families for vector spaces
- Matroid products in tropical geometry
- The weak saturation number of \(K_{2,t}\)
- Variations on the Bollobás set-pair theorem
- The edge covering number of the intersection of two matroids
- Representing matroids over the reals is \(\exists \mathbb{R}\)-complete
- Saturation numbers of joins of graphs
- Computing paths of large rank in planar frameworks deterministically
- \(K_r\)-saturated graphs and the two families theorem
- Weak saturation numbers in random graphs
- On quasipolynomial multicut-mimicking networks and kernelization of multiway cut problems
- Poset saturation of unions of chains
- Weak saturation numbers for the union of disjoint graphs
- Some new Bollobás-type inequalities
- Bounded degrees and prescribed distances in graphs
- On Bollobás-type theorems of d-tuples
- Variations on Bollobás systems of d-partitions
- Stability in graphs with matroid constraints
- Combinatorial flats and Schubert varieties of subspace arrangements
- Determinantal sieving
- Bollobás set pair inequalities for compositions
- Computing paths of large rank in planar frameworks deterministically
- Analysis of the two-for-one swap heuristic for approximating the maximum independent set in a k-polymatroid
- Weak saturation in graphs: a combinatorial approach
- Fixed-parameter tractability of maximum colored path and beyond
- The Bergman fan of a polymatroid
- q-analogues of Fisher's inequality and oddtown theorem
- Cuts in graphs with matroid constraints
- A note on weak saturation number of trees
- Dilworth truncations and Hadamard products of linear spaces
- Weak saturation numbers for multiple copies
- Intersection patterns of convex sets
- An algebraic and combinatorial approach to the analysis of line drawings of polyhedra
- Geometrical solution of an intersection problem for two hypergraphs
- Representative families: a unified tradeoff-based approach
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 Q4133994)
