On bounded-degree vertex deletion parameterized by treewidth (Q765338): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Clique Relaxations in Social Network Analysis: The Maximum <i>k</i>-Plex Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Making a Distinguished Vertex Minimum Degree by Vertex Deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of candidate control in elections and related digraph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization: New Upper and Lower Bound Techniques / 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: A Linear Kernel for Co-Path/Cycle Packing / 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: Q4268437 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated Domination and Covering: A Parameterized Perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of Nemhauser and Trotter's local optimization theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Layout Problems Parameterized by Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of coloring problems: treewidth versus vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isolation concepts for efficiently enumerating dense subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reflections on Multivariate Algorithmics and Problem Parameterization / 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: Parameterized Algorithms for Generalized Domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph‐theoretic generalization of the clique concept / rank
 
Normal rank

Latest revision as of 00:49, 5 July 2024

scientific article
Language Label Description Also known as
English
On bounded-degree vertex deletion parameterized by treewidth
scientific article

    Statements

    On bounded-degree vertex deletion parameterized by treewidth (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 March 2012
    0 references
    0 references
    parameterized complexity
    0 references
    structural parameterization
    0 references
    tree-likeness
    0 references
    vector dominating set
    0 references
    \(k\)-dependent set
    0 references
    co-\(k\)-plexes
    0 references
    0 references
    0 references
    0 references
    0 references