A polynomial-time approximation algorithm for complete interval minors
From MaRDI portal
Cites work
- Approximating the maximum clique minor and some subgraph homeomorphism problems
- Better upper bounds on the Füredi-Hajnal limits of permutations
- Bounded twin-width graphs are polynomially -bounded
- Chromatic number of ordered graphs with forbidden ordered subgraphs
- Davenport-Schinzel theory of matrices
- Excluded permutation matrices and the Stanley-Wilf conjecture
- Extensions of the linear bound in the Füredi-Hajnal conjecture
- Extremal functions of forbidden multidimensional matrices
- Factoring pattern-free permutations into separable ones
- Finding Large Clique Minors is Hard
- Finding small patterns in permutations in linear time
- Graph minors. XIII: The disjoint paths problem
- Graph minors. XVI: Excluding a non-planar graph
- Graphs of bounded twin-width are quasi-polynomially -bounded
- Interval minors of complete bipartite graphs
- List-3-coloring ordered graphs with a forbidden induced subgraphs
- Minor containment and disjoint paths in almost-linear time
- On the complexity of approximating the Hadwiger number
- On the structure of matrices avoiding interval-minor patterns
- Substitution and \(\chi\)-boundedness
- The disjoint paths problem in quadratic time
- Transitiv orientierbare Graphen
- Twin-width II: small classes
- Twin-width. I: Tractable FO model checking
- Twin-width. IV: Ordered graphs and matrices
This page was built for publication: A polynomial-time approximation algorithm for complete interval minors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7346843)
