Pages that link to "Item:Q638521"
From MaRDI portal
The following pages link to Kernel bounds for disjoint cycles and disjoint paths (Q638521):
Displaying 50 items.
- Parameterized complexity dichotomy for \textsc{Steiner Multicut} (Q295637) (← links)
- Win-win kernelization for degree sequence completion problems (Q295647) (← links)
- Scattered packings of cycles (Q306707) (← links)
- Kernelization of edge perfect code and its variants (Q317422) (← links)
- Polynomial kernels for weighted problems (Q340549) (← links)
- Preprocessing subgraph and minor problems: when does a small vertex cover help? (Q386050) (← links)
- Incremental list coloring of graphs, parameterized by conservation (Q391091) (← links)
- Parameterized complexity of \(k\)-Chinese postman problem (Q391983) (← links)
- Kernel bounds for path and cycle problems (Q392032) (← links)
- Parameterized complexity of vertex deletion into perfect graph classes (Q392038) (← links)
- The kernelization complexity of connected domination in graphs with (no) small cycles (Q476436) (← links)
- On cutwidth parameterized by vertex cover (Q476444) (← links)
- Finding disjoint paths in split graphs (Q493652) (← links)
- Restricted and swap common superstring: a multivariate algorithmic perspective (Q494787) (← links)
- On the parameterized complexity of finding separators with non-hereditary properties (Q494799) (← links)
- On making a distinguished vertex of minimum degree by vertex deletion (Q528861) (← links)
- Fixed-parameter tractability of satisfying beyond the number of variables (Q528862) (← links)
- Kernelization hardness of connectivity problems in \(d\)-degenerate graphs (Q713308) (← links)
- Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization (Q722549) (← links)
- Best-case and worst-case sparsifiability of Boolean CSPs (Q786033) (← links)
- Dual parameterization of weighted coloring (Q786042) (← links)
- Linear kernel for \textsc{Rooted Triplet Inconsistency} and other problems based on conflict packing technique (Q896028) (← links)
- Two edge modification problems without polynomial kernels (Q1662097) (← links)
- Explicit linear kernels for packing problems (Q1739112) (← links)
- On the kernelization complexity of string problems (Q1749539) (← 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)
- New algorithms for maximum disjoint paths based on tree-likeness (Q1785205) (← links)
- On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems (Q1949740) (← links)
- On the complexity of broadcast domination and multipacking In digraphs (Q1979448) (← links)
- On the parameterized complexity of contraction to generalization of trees (Q2000005) (← links)
- Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds (Q2093577) (← links)
- Parameterized complexity of graph burning (Q2161013) (← links)
- Reoptimization of parameterized problems (Q2170282) (← links)
- Consensus strings with small maximum distance and small distance sum (Q2309476) (← links)
- Two edge-disjoint paths with length constraints (Q2330117) (← links)
- A completeness theory for polynomial (Turing) kernelization (Q2343083) (← links)
- Incompressibility of \(H\)-free edge modification problems (Q2343091) (← links)
- Using patterns to form homogeneous teams (Q2346970) (← links)
- Sparsification upper and lower bounds for graph problems and not-all-equal SAT (Q2408194) (← links)
- Tractability, hardness, and kernelization lower bound for and/or graph solution (Q2410230) (← 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)
- On the kernelization of split graph problems (Q2636501) (← links)
- Metrics induced by Jensen-Shannon and related divergences on positive definite matrices (Q2656633) (← links)
- Packing arc-disjoint cycles in tournaments (Q2663711) (← links)
- An improved kernel for planar vertex-disjoint triangle packing (Q2672577) (← links)
- The structural complexity landscape of finding balance-fair shortest paths (Q2676473) (← links)
- \(p\)-edge/vertex-connected vertex cover: parameterized and approximation algorithms (Q2677827) (← links)
