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

@@ Property / DOI @@
-.1016/j.dam.2024.03.009
@@ Property / DOI: 10.1016/j.dam.2024.03.009 / rank @@
-Normal rank
@@ Property / cites work @@
+Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity
+Normal rank
@@ Property / cites work @@
+On the Maximum Weight Clique Problem
@@ Property / cites work: On the Maximum Weight Clique Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Metric Dimension of Bounded Tree-length Graphs
@@ Property / cites work: Metric Dimension of Bounded Tree-length Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Equitable colorings of bounded treewidth graphs
@@ Property / cites work: Equitable colorings of bounded treewidth graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Kernelization Lower Bounds by Cross-Composition
@@ Property / cites work: Kernelization Lower Bounds by Cross-Composition / rank @@
+Normal rank
@@ Property / cites work @@
+Total domination in graphs
@@ Property / cites work: Total domination in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Iterated Type Partitions
@@ Property / cites work: Iterated Type Partitions / rank @@
+Normal rank
@@ Property / cites work @@
+Evangelism in social networks: Algorithms and complexity
+Normal rank
@@ Property / cites work @@
+Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs
+Normal rank
@@ Property / cites work @@
+Linear time solvable optimization problems on graphs of bounded clique-width
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+Target Set Selection in Dense Graph Classes
@@ Property / cites work: Target Set Selection in Dense Graph Classes / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial kernels for weighted problems
@@ Property / cites work: Polynomial kernels for weighted problems / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of some colorful problems parameterized by treewidth
+Normal rank
@@ Property / cites work @@
+Graph Layout Problems Parameterized by Vertex Cover
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of distance labeling and uniform channel assignment problems
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of coloring problems: treewidth versus vertex cover
+Normal rank
@@ Property / cites work @@
+Q4633895
@@ Property / cites work: Q4633895 / rank @@
+Normal rank
@@ Property / cites work @@
+Intractability of Clique-Width Parameterizations
@@ Property / cites work: Intractability of Clique-Width Parameterizations / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms parameterized by vertex cover and modular width, through potential maximal cliques
+Normal rank
@@ Property / cites work @@
+An application of simultaneous diophantine approximation in combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms for Modular-Width
@@ Property / cites work: Parameterized Algorithms for Modular-Width / rank @@
+Normal rank
@@ Property / cites work @@
+Transitiv orientierbare Graphen
@@ Property / cites work: Transitiv orientierbare Graphen / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of conflict-free colorings of graphs
@@ Property / cites work: Complexity of conflict-free colorings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Integer programming in parameterized complexity: five miniatures
+Normal rank
@@ Property / cites work @@
+Q5377224
@@ Property / cites work: Q5377224 / rank @@
+Normal rank
@@ Property / cites work @@
+Mathematical Foundations of Computer Science 2004
@@ Property / cites work: Mathematical Foundations of Computer Science 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3113682
@@ Property / cites work: Q3113682 / rank @@
+Normal rank
@@ Property / cites work @@
+Bin packing with fixed number of bins revisited
@@ Property / cites work: Bin packing with fixed number of bins revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Partitioning graphs into induced subgraphs
@@ Property / cites work: Partitioning graphs into induced subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity
+Normal rank
@@ Property / cites work @@
+Algorithmic meta-theorems for restrictions of treewidth
+Normal rank
@@ Property / cites work @@
+Integer Programming with a Fixed Number of Variables
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Faster algorithms for vertex partitioning problems parameterized by clique-width
+Normal rank
@@ Property / cites work @@
+Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
+Normal rank
@@ Property / cites work @@
+-Player Nash and Nonsymmetric Bargaining Games: Algorithms and Structural Properties
+Normal rank
@@ Property / cites work @@
+Speeding up networks mining via neighborhood diversity
+Normal rank
@@ Property / DOI @@
+.1016/J.DAM.2024.03.009
@@ Property / DOI: 10.1016/J.DAM.2024.03.009 / rank @@
+Normal rank