Parameterized complexity for iterated type partitions and modular-width (Q6126724): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Maximum Weight Clique Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metric Dimension of Bounded Tree-length Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable colorings of bounded treewidth graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization Lower Bounds by Cross-Composition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated Type Partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evangelism in social networks: Algorithms and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Target Set Selection in Dense Graph Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial kernels for weighted problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of some colorful problems parameterized by treewidth / 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 distance labeling and uniform channel assignment problems / 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: Q4633895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intractability of Clique-Width Parameterizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms parameterized by vertex cover and modular width, through potential maximal cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of simultaneous diophantine approximation in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms for Modular-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitiv orientierbare Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of conflict-free colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer programming in parameterized complexity: five miniatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5377224 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3113682 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing with fixed number of bins revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning graphs into induced subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic meta-theorems for restrictions of treewidth / 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: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster algorithms for vertex partitioning problems parameterized by clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-Player Nash and Nonsymmetric Bargaining Games: Algorithms and Structural Properties / rank
 
Normal rank

Revision as of 21:01, 29 August 2024

scientific article; zbMATH DE number 7829715
Language Label Description Also known as
English
Parameterized complexity for iterated type partitions and modular-width
scientific article; zbMATH DE number 7829715

    Statements

    Parameterized complexity for iterated type partitions and modular-width (English)
    0 references
    0 references
    0 references
    0 references
    10 April 2024
    0 references
    parameterized complexity
    0 references
    neighborhood diversity
    0 references
    modular-width
    0 references
    fixed-parameter tractability
    0 references
    kernelization algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references