Sparse obstructions for minor-covering parameters (Q2174553): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4273870 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A kuratowski theorem for the projective plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden minors characterization of partial 3-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4792909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contraction obstructions for connected graph searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction algorithms for graphs of small treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Meta) Kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with Branchwidth at Most Three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4525262 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial bounds for the grid-minor theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of obstructions to treewidth and pathwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excluded Grid Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Highly connected sets and the excluded grid theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excluded-minor characterization of apex-outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4520532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden minors to graphs with small feedback sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of vertex cover obstructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minor‐order obstructions for the graphs of vertex cover 6 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden graphs for tree-depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: FPT Is Characterized by Useful Obstruction Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bidimensionality and Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The obstructions for toroidal graphs with no \(K_{3,3}\)'s / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform Kernelization Complexity of Hitting Forbidden Minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutwidth: obstructions and algorithmic aspects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective computation of immersion obstructions for unions of graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: 103 graphs that are irreducible for the projective plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5091010 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obstruction set isolation for the gate matrix layout problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth. Computations and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outerplanar obstructions for matroid pathwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds on the size of obstructions and intertwines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obstructions of Connectivity Two for Embedding Graphs into the Torus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of vertex packing and independence system polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Structure and Number of Obstructions to Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XX: Wagner's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quickly excluding a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outerplanar Obstructions for the Feedback Vertex Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal acyclic forbidden minors for the family of graphs with bounded path-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and obstructions for linear-width and related search parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Menger-like property of tree-width: The finite case / rank
 
Normal rank

Revision as of 10:26, 22 July 2024

scientific article
Language Label Description Also known as
English
Sparse obstructions for minor-covering parameters
scientific article

    Statements

    Sparse obstructions for minor-covering parameters (English)
    0 references
    0 references
    0 references
    21 April 2020
    0 references
    obstruction sets
    0 references
    graph minors
    0 references
    apex-extensions
    0 references
    protrusion decompositions
    0 references
    tree decompositions
    0 references
    finite integer index
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references