Pages that link to "Item:Q1034099"
From MaRDI portal
The following pages link to On problems without polynomial kernels (Q1034099):
Displaying 50 items.
- Parameterizations of test cover with bounded test sizes (Q261370) (← links)
- On polynomial kernels for sparse integer linear programs (Q269481) (← links)
- Parameterized complexity dichotomy for \textsc{Steiner Multicut} (Q295637) (← links)
- Kernelizations for the hybridization number problem on multiple nonbinary trees (Q295644) (← links)
- Incompressible functions, relative-error extractors, and the power of nondeterministic reductions (Q301524) (← links)
- Solving linear equations parameterized by Hamming weight (Q309792) (← links)
- AND-compression of NP-complete problems: streamlined proof and minor observations (Q309801) (← links)
- Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments (Q329279) (← links)
- Polynomial kernels for weighted problems (Q340549) (← links)
- Kernelization using structural parameters on sparse graph classes (Q340583) (← links)
- Parameterized algorithms for the module motif problem (Q342716) (← links)
- Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter (Q372970) (← links)
- The parameterized complexity of local search for TSP, more refined (Q378245) (← 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)
- Parameterized complexity of Min-power multicast problems in wireless ad hoc networks (Q388087) (← links)
- Incremental list coloring of graphs, parameterized by conservation (Q391091) (← links)
- Kernel and fast algorithm for dense triplet inconsistency (Q391097) (← links)
- Kernel bounds for path and cycle problems (Q392032) (← links)
- Parameterized complexity of vertex deletion into perfect graph classes (Q392038) (← links)
- Data reduction for graph coloring problems (Q393081) (← links)
- Polynomial kernels for proper interval completion and related problems (Q393083) (← links)
- Effective computation of immersion obstructions for unions of graph classes (Q395009) (← links)
- On the parameterized complexity of the repetition free longest common subsequence problem (Q413298) (← links)
- Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables (Q414863) (← links)
- Parameterized Eulerian strong component arc deletion problem on tournaments (Q437687) (← links)
- Paths of bounded length and their cuts: parameterized complexity and algorithms (Q456699) (← links)
- Lower bounds on kernelization (Q456702) (← links)
- The parameterized complexity of \(k\)-flip local search for SAT and MAX SAT (Q456705) (← links)
- Guarantees and limits of preprocessing in constraint satisfaction and reasoning (Q460604) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- The kernelization complexity of connected domination in graphs with (no) small cycles (Q476436) (← links)
- On cutwidth parameterized by vertex cover (Q476444) (← links)
- On the parameterized complexity of vertex cover and edge cover with connectivity constraints (Q482281) (← links)
- On the kernel size of clique cover reductions for random intersection graphs (Q491163) (← 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)
- \textsc{Max-Cut} parameterized above the Edwards-Erdős bound (Q494801) (← links)
- Parameterized complexity of critical node cuts (Q517024) (← links)
- A polynomial Turing-kernel for weighted independent set in bull-free graphs (Q521799) (← links)
- Graph editing problems with extended regularity constraints (Q526874) (← 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)
- Infeasibility of instance compression and succinct PCPs for NP (Q619903) (← links)
- Parameterized complexity of even/odd subgraph problems (Q635735) (← links)
- Kernel bounds for disjoint cycles and disjoint paths (Q638521) (← links)
- Quadratic kernelization for convex recoloring of trees (Q639283) (← links)
- Solving MAX-\(r\)-SAT above a tight lower bound (Q644808) (← links)
- Kernels for feedback arc set in tournaments (Q657916) (← links)
