The following pages link to (Meta) Kernelization (Q5171201):
Displaying 50 items.
- On polynomial kernels for sparse integer linear programs (Q269481) (← links)
- \((1, j)\)-set problem in graphs (Q294556) (← links)
- Win-win kernelization for degree sequence completion problems (Q295647) (← links)
- Kernelization using structural parameters on sparse graph classes (Q340583) (← links)
- Planar graph vertex partition for linear problem kernels (Q355502) (← links)
- A polynomial kernel for \textsc{Feedback Arc Set} on bipartite tournaments (Q385516) (← links)
- Preprocessing subgraph and minor problems: when does a small vertex cover help? (Q386050) (← links)
- Improved linear problem kernel for planar connected dominating set (Q392013) (← links)
- Effective computation of immersion obstructions for unions of graph classes (Q395009) (← links)
- Lower bounds on kernelization (Q456702) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- The kernelization complexity of connected domination in graphs with (no) small cycles (Q476436) (← links)
- Finding disjoint paths in split graphs (Q493652) (← links)
- On the parameterized complexity of finding separators with non-hereditary properties (Q494799) (← links)
- Improved kernel results for some FPT problems based on simple observations (Q507431) (← links)
- A linear kernel for planar red-blue dominating set (Q516887) (← links)
- A linear kernel for a planar connected dominating set (Q534569) (← links)
- Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms (Q547307) (← links)
- On the small cycle transversal of planar graphs (Q551170) (← links)
- Kernels for feedback arc set in tournaments (Q657916) (← links)
- Spanners in sparse graphs (Q657919) (← links)
- Implicit branching and parameterized partial cover problems (Q657922) (← links)
- Kernelization hardness of connectivity problems in \(d\)-degenerate graphs (Q713308) (← links)
- A single-exponential FPT algorithm for the \(K_4\)-\textsc{minor cover} problem (Q743120) (← links)
- Meta-kernelization with structural parameters (Q896025) (← links)
- Characterising bounded expansion by neighbourhood complexity (Q1621072) (← links)
- On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability (Q1680511) (← links)
- An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\) (Q1751097) (← links)
- Algorithms, kernels and lower bounds for the flood-it game parameterized by the vertex cover number (Q1752485) (← links)
- Algorithmic meta-theorems for restrictions of treewidth (Q1759681) (← links)
- Minimum fill-in of sparse graphs: kernelization and approximation (Q2258069) (← links)
- Contraction obstructions for treewidth (Q2275894) (← links)
- How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? (Q2324243) (← links)
- Minors in graphs of large \(\theta_r\)-girth (Q2400974) (← links)
- Recent techniques and results on the Erdős-Pósa property (Q2403789) (← links)
- Linear kernels for \(k\)-tuple and liar's domination in bounded genus graphs (Q2403794) (← links)
- On kernelization and approximation for the vector connectivity problem (Q2408198) (← links)
- Linear kernels for outbranching problems in sparse digraphs (Q2408200) (← links)
- Parameterized and approximation algorithms for the load coloring problem (Q2408202) (← links)
- Quick but odd growth of cacti (Q2408205) (← links)
- Polynomial kernelizations for MIN \(F^{+}\Pi _{1}\) and MAX NP (Q2429346) (← links)
- On the hardness of losing width (Q2441542) (← links)
- Contracting graphs to paths and trees (Q2441588) (← links)
- Edge-disjoint packing of stars and cycles (Q2629232) (← links)
- Hitting Forbidden Minors: Approximation and Kernelization (Q2790404) (← links)
- FPT is characterized by useful obstruction sets (Q2828222) (← links)
- On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal (Q2891343) (← links)
- On the Hardness of Losing Width (Q2891345) (← links)
- Simpler Linear-Time Kernelization for Planar Dominating Set (Q2891347) (← links)
- Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs (Q2891348) (← links)