Implicit branching and parameterized partial cover problems (Q657922): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A refined search tree technique for dominating set on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time data reduction for dominating set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for finding a dominating set of fixed size in degenerated graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \(2+\varepsilon\) approximation algorithm for the \(k\)-MST problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing small partial coverings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Homogeneous Weights for Approximating the Partial Cover Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Meta) Kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth lower bounds with brambles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved upper bounds for vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter algorithms for ( <i>k</i> , <i>r</i> )-center in planar graphs and map graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential parameterized algorithms on bounded-genus graphs and <i>H</i> -minor-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter and treewidth in minor-closed graph families, revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential parameterized algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter and treewidth in minor-closed graph families / 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: Approximation algorithms for partial covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity for Domination Problems on Degenerate Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local tree-width, excluded minors, and approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of Vertex Cover variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial vs. Complete Domination: t-Dominating Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intuitive Algorithms and t-Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. V. Excluding a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quickly excluding a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XVI: Excluding a non-planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Call routing and the ratcatcher / rank
 
Normal rank

Latest revision as of 20:26, 4 July 2024

scientific article
Language Label Description Also known as
English
Implicit branching and parameterized partial cover problems
scientific article

    Statements

    Implicit branching and parameterized partial cover problems (English)
    0 references
    0 references
    0 references
    0 references
    11 January 2012
    0 references
    0 references
    partial covering problems in graphs
    0 references
    implicit branching
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references