Tight complexity bounds for FPT subgraph problems parameterized by the clique-width (Q388791): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+C60
@@ Property / Mathematics Subject Classification ID: 05C60 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q25
@@ Property / Mathematics Subject Classification ID: 68Q25 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6243129
@@ Property / zbMATH DE Number: 6243129 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+parameterized complexity
@@ Property / zbMATH Keywords: parameterized complexity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+clique-width
@@ Property / zbMATH Keywords: clique-width / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+exponential time hypothesis
@@ Property / zbMATH Keywords: exponential time hypothesis / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2013.03.008
+Normal rank
@@ Property / OpenAlex ID @@
+W2164428079
@@ Property / OpenAlex ID: W2164428079 / rank @@
+Normal rank
@@ Property / cites work @@
+On the approximability of some degree-constrained subgraph problems
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of finding small degree-constrained subgraphs
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems
+Normal rank
@@ Property / cites work @@
+Greedily Finding a Dense Subgraph
@@ Property / cites work: Greedily Finding a Dense Subgraph / rank @@
+Normal rank
@@ Property / cites work @@
+Planar Capacitated Dominating Set Is W[1]-Hard
@@ Property / cites work: Planar Capacitated Dominating Set Is W[1]-Hard / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of regular subgraph recognition
@@ Property / cites work: The complexity of regular subgraph recognition / rank @@
+Normal rank
@@ Property / cites work @@
+Tight lower bounds for certain parameterized NP-hard problems
+Normal rank
@@ Property / cites work @@
+On the computational hardness based on linear fpt-reductions
+Normal rank
@@ Property / cites work @@
+Strong computational lower bounds via parameterized complexity
+Normal rank
@@ Property / cites work @@
+Three‐regular subgraphs of four‐regular graphs
+Normal rank
@@ Property / cites work @@
+Clustering and domination in perfect graphs
@@ Property / cites work: Clustering and domination in perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Linear time solvable optimization problems on graphs of bounded clique-width
+Normal rank
@@ Property / cites work @@
+Upper bounds to the clique width of graphs
@@ Property / cites work: Upper bounds to the clique width of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Capacitated Domination and Covering: A Parameterized Perspective
+Normal rank
@@ Property / cites work @@
+Q2843923
@@ Property / cites work: Q2843923 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+The dense \(k\)-subgraph problem
@@ Property / cites work: The dense \(k\)-subgraph problem / rank @@
+Normal rank
@@ Property / cites work @@
+Clique-Width is NP-Complete
@@ Property / cites work: Clique-Width is NP-Complete / rank @@
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Q5417642
@@ Property / cites work: Q5417642 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Branch-Decompositions and Rank-Decompositions
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Q3983251
@@ Property / cites work: Q3983251 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4904144
@@ Property / cites work: Q4904144 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5365079
@@ Property / cites work: Q5365079 / rank @@
+Normal rank
@@ Property / cites work @@
+Editing graphs to satisfy degree constraints: a parameterized approach
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of finding regular induced subgraphs
+Normal rank
@@ Property / cites work @@
+Approximating clique-width and branch-width
@@ Property / cites work: Approximating clique-width and branch-width / rank @@
+Normal rank
@@ Property / cites work @@
+Deciding whether a planar graph has a cubic subgraph is NP-complete
+Normal rank
@@ Property / cites work @@
+Finding regular subgraphs in both arbitrary and planar graphs
+Normal rank
@@ Property / cites work @@
+On locating cubic subgraphs in bounded-degree connected bipartite graphs
+Normal rank
@@ Property / cites work @@
+\(k\)-NLC graphs and polynomial algorithms
@@ Property / cites work: \(k\)-NLC graphs and polynomial algorithms / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:388791