Pages that link to "Item:Q340583"

The following pages link to Kernelization using structural parameters on sparse graph classes (Q340583):

Displaying 31 items.

• On the parameterized complexity of reconfiguration of connected dominating sets (Q832526) (← links)
• Characterising bounded expansion by neighbourhood complexity (Q1621072) (← links)
• Reconfiguration on sparse graphs (Q1747496) (← links)
• Measuring what matters: a hybrid approach to dynamic programming with treewidth (Q2040028) (← links)
• Twin-width and polynomial kernels (Q2093574) (← links)
• Local planar domination revisited (Q2097345) (← links)
• Lower bounds for protrusion replacement by counting equivalence classes (Q2174552) (← links)
• Polynomial kernels for hitting forbidden minors under structural parameterizations (Q2202024) (← links)
• On structural parameterizations of the bounded-degree vertex deletion problem (Q2223699) (← links)
• Turing kernelization for finding long paths in graph classes excluding a topological minor (Q2272596) (← links)
• Alternative parameterizations of \textsc{Metric Dimension} (Q2285127) (← links)
• How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? (Q2324243) (← links)
• Meta-kernelization using well-structured modulators (Q2413976) (← links)
• Towards a polynomial kernel for directed feedback vertex set (Q2663705) (← links)
• Lossy Kernels for Connected Dominating Set on Sparse Graphs (Q3304128) (← links)
• On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem (Q3304132) (← links)
• Approximation and Kernelization for Chordal Vertex Deletion (Q4586151) (← links)
• Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations. (Q5009611) (← links)
• A Retrospective on (Meta) Kernelization (Q5042460) (← links)
• (Q5089197) (← links)
• Elimination Distance to Bounded Degree on Planar Graphs (Q5089238) (← links)
• (Q5092402) (← links)
• Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. (Q5092404) (← links)
• (Q5111250) (← links)
• How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs (Q5111869) (← links)
• Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor (Q5111882) (← links)
• Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness (Q5140724) (← links)
• Lossy Kernels for Connected Dominating Set on Sparse Graphs (Q5234662) (← links)
• On the number of labeled graphs of bounded treewidth (Q5915790) (← links)
• On the Parameterized Complexity of Clique Elimination Distance (Q6068235) (← links)
• (Q6089671) (← links)