On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem (Q3304132): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
(3 intermediate revisions by 3 users not shown)
label / enlabel / en
 
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4430362 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete parameterized complexity analysis of bounded planning / rank
 
Normal rank
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 bounded-degree vertex deletion parameterized by treewidth / 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: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Meta-kernelization using Well-structured Modulators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Problems on Graphs of High Rank-Width / 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: The multidimensional 0-1 knapsack problem: an overview. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization using structural parameters on sparse graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Applications of Tree-Cut Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Meta-kernelization with structural parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backdoors into heterogeneous classes of SAT and CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: An FPT 2-approximation for tree-cut decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth. Computations and approximations / 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: Integer Programming with a Fixed Number of Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Immersions in Highly Edge Connected Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial algorithms for the maximum \(k\)-plex problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsity. Graphs, structures, and algorithms / 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: A graph‐theoretic generalization of the clique concept / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of graphs not admitting a fixed immersion / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.4230/LIPIcs.STACS.2018.33 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2793933268 / rank
 
Normal rank
Property / title
 
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem (English)
Property / title: On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem (English) / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 09:53, 30 July 2024

scientific article
Language Label Description Also known as
English
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem
scientific article

    Statements

    0 references
    0 references
    0 references
    5 August 2020
    0 references
    bounded-degree vertex deletion
    0 references
    feedback vertex set
    0 references
    parameterized algorithms
    0 references
    treecut width
    0 references
    0 references
    0 references
    0 references
    On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem (English)
    0 references

    Identifiers

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