Pages that link to "Item:Q1034099"
From MaRDI portal
The following pages link to On problems without polynomial kernels (Q1034099):
Displaying 50 items.
- Finding, hitting and packing cycles in subexponential time on unit disk graphs (Q2334507) (← links)
- Kernelization lower bound for permutation pattern matching (Q2339595) (← links)
- On structural parameterizations for the 2-club problem (Q2341718) (← links)
- Backdoors to tractable answer set programming (Q2341833) (← links)
- A completeness theory for polynomial (Turing) kernelization (Q2343083) (← links)
- Pure Nash equilibria in graphical games and treewidth (Q2343086) (← links)
- On sparsification for computing treewidth (Q2343087) (← links)
- Incompressibility of \(H\)-free edge modification problems (Q2343091) (← links)
- On the kernelization of ranking \(r\)-CSPs: linear vertex-kernels for generalizations of feedback arc set and betweenness in tournaments (Q2345613) (← links)
- Modifying a graph using vertex elimination (Q2345941) (← links)
- A complete parameterized complexity analysis of bounded planning (Q2353405) (← links)
- Sparsification upper and lower bounds for graph problems and not-all-equal SAT (Q2408194) (← links)
- Parameterized complexity of sparse linear complementarity problems (Q2408196) (← links)
- Extending the kernel for planar Steiner tree to the number of Steiner vertices (Q2408201) (← links)
- Parameterized complexity of secluded connectivity problems (Q2408560) (← links)
- Tractability, hardness, and kernelization lower bound for and/or graph solution (Q2410230) (← links)
- Meta-kernelization using well-structured modulators (Q2413976) (← links)
- Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion (Q2429325) (← links)
- Polynomial kernelizations for MIN \(F^{+}\Pi _{1}\) and MAX NP (Q2429346) (← links)
- Parameterized domination in circle graphs (Q2441539) (← links)
- On the hardness of losing width (Q2441542) (← links)
- Contracting graphs to paths and trees (Q2441588) (← links)
- Parameterized algorithms for load coloring problem (Q2448120) (← links)
- Parameterized complexity of firefighting (Q2453548) (← links)
- Finding disjoint dense clubs in a social network (Q2636493) (← links)
- On the kernelization of split graph problems (Q2636501) (← links)
- Satisfying more than half of a system of linear equations over GF(2): a multivariate approach (Q2637641) (← links)
- Finding a maximum minimal separator: graph classes and fixed-parameter tractability (Q2661784) (← links)
- Parameterized complexity of \textsc{bandwidth} of \textsc{caterpillars} and \textsc{weighted path emulation} (Q2672420) (← links)
- Building large \(k\)-cores from sparse graphs (Q2678255) (← links)
- FPT and kernelization algorithms for the induced tree problem (Q2692722) (← links)
- A multistage view on 2-satisfiability (Q2692727) (← links)
- Hitting forbidden minors: approximation and kernelization (Q2790404) (← links)
- FPT is characterized by useful obstruction sets: connecting algorithms, kernels, and quasi-orders (Q2828222) (← links)
- Kernel lower bounds using co-nondeterminism: finding induced hereditary subgraphs (Q2828227) (← links)
- Parameterized Complexity of Firefighting Revisited (Q2891334) (← links)
- On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal (Q2891343) (← links)
- Kernel Bounds for Path and Cycle Problems (Q2891344) (← links)
- On the Hardness of Losing Width (Q2891345) (← links)
- Mike Fellows: Weaving the Web of Mathematics and Adventure (Q2908534) (← links)
- A Basic Parameterized Complexity Primer (Q2908536) (← links)
- Kernelization – Preprocessing with a Guarantee (Q2908537) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey (Q2908541) (← links)
- Backdoors to Satisfaction (Q2908542) (← links)
- Studies in Computational Aspects of Voting (Q2908543) (← links)
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
- Clique Cover and Graph Separation (Q2943572) (← links)
- On the (Parameterized) Complexity of Recognizing Well-Covered $$(r,\ell )$$ -graphs (Q2958335) (← links)
- Complexity with Rod (Q2970952) (← links)