Pages that link to "Item:Q3583575"

The following pages link to Polynomial-time data reduction for dominating set (Q3583575):

Displaying 50 items.

• A \(13k\)-kernel for planar feedback vertex set via region decomposition (Q306250) (← links)
• New analysis and computational study for the planar connected dominating set problem (Q328712) (← links)
• Kernelization using structural parameters on sparse graph classes (Q340583) (← links)
• Planar graph vertex partition for linear problem kernels (Q355502) (← links)
• A \(9k\) kernel for nonseparating independent set in planar graphs (Q385964) (← links)
• Improved linear problem kernel for planar connected dominating set (Q392013) (← links)
• Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs (Q411223) (← links)
• A strengthened analysis of an algorithm for dominating set in planar graphs (Q415281) (← links)
• Lower bounds on kernelization (Q456702) (← links)
• Subexponential parameterized algorithms (Q458457) (← links)
• Confronting intractability via parameters (Q465686) (← links)
• The kernelization complexity of connected domination in graphs with (no) small cycles (Q476436) (← links)
• Independent dominating set problem revisited (Q476836) (← links)
• A linear kernel for planar red-blue dominating set (Q516887) (← links)
• A linear kernel for a planar connected dominating set (Q534569) (← links)
• On the small cycle transversal of planar graphs (Q551170) (← links)
• Quadratic kernelization for convex recoloring of trees (Q639283) (← links)
• Implicit branching and parameterized partial cover problems (Q657922) (← links)
• The complexity ecology of parameters: An illustration using bounded max leaf number (Q733736) (← links)
• Packing stars in fullerenes (Q830899) (← links)
• Parameterized dominating set problem in chordal graphs: Complexity and lower bound (Q839675) (← links)
• Experiments on data reduction for optimal domination in networks (Q863574) (← links)
• Improved algorithms and complexity results for power domination in graphs (Q958210) (← links)
• Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles (Q958211) (← links)
• A cubic kernel for feedback vertex set and loop cutset (Q968273) (← links)
• Linear kernelizations for restricted 3-Hitting Set problems (Q989471) (← links)
• A more effective linear kernelization for cluster editing (Q1006044) (← links)
• The parameterized complexity of the induced matching problem (Q1028465) (← links)
• On problems without polynomial kernels (Q1034099) (← links)
• Computational study on planar dominating set problem (Q1040587) (← links)
• Characterising bounded expansion by neighbourhood complexity (Q1621072) (← links)
• Computational study on a PTAS for planar dominating set problem (Q1736542) (← links)
• Explicit linear kernels for packing problems (Q1739112) (← links)
• Towards optimal kernel for connected vertex cover in planar graphs (Q1949125) (← links)
• Twin-width and polynomial kernels (Q2093574) (← links)
• On the parameterized complexity of the expected coverage problem (Q2135628) (← links)
• On the \(\Delta \)-interval and the \(\Delta \)-convexity numbers of graphs and graph products (Q2161271) (← links)
• Minimum fill-in of sparse graphs: kernelization and approximation (Q2258069) (← links)
• New kernels for several problems on planar graphs (Q2285156) (← links)
• On approximate preprocessing for domination and hitting subgraphs with connected deletion sets (Q2316936) (← links)
• Capacitated domination: problem complexity and approximation algorithms (Q2345937) (← links)
• On connected dominating sets of restricted diameter (Q2356248) (← links)
• Linear kernels for \(k\)-tuple and liar's domination in bounded genus graphs (Q2403794) (← links)
• Linear kernels for outbranching problems in sparse digraphs (Q2408200) (← links)
• Extending the kernel for planar Steiner tree to the number of Steiner vertices (Q2408201) (← links)
• Kernels in planar digraphs (Q2485283) (← links)
• A refined search tree technique for dominating set on planar graphs (Q2575830) (← links)
• Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825) (← links)
• Edge-disjoint packing of stars and cycles (Q2629232) (← links)
• Genus characterizes the complexity of certain graph problems: Some tight results (Q2641866) (← links)