Q5009610 (Q5009610): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Colorings and orientations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on graph colorings and graph polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4607947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5369515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for exact satisfiability and number of perfect matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Partitioning via Inclusion-Exclusion / 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: Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Hamiltonicity Checking Via Bases of Perfect Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gröbner bases and graph colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intractability of Clique-Width Parameterizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms for Modular-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutwidth: obstructions and algorithmic aspects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4607896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge dominating set and colorings on graphs with fixed clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-width, path-width, and cutwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365080 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding the Independence Number of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133994 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching is as easy as matrix inversion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247451 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Between treewidth and clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Vertex Partitioning Problems on Partial k-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutwidth I: A linear time fixed parameter algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutwidth II: Algorithms for partial w-trees of bounded degree / rank
 
Normal rank

Revision as of 07:50, 26 July 2024

scientific article; zbMATH DE number 7378717
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7378717

    Statements

    0 references
    0 references
    4 August 2021
    0 references
    parameterized complexity
    0 references
    chromatic number
    0 references
    graph decompositions
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers