Pages that link to "Item:Q1034099"
From MaRDI portal
The following pages link to On problems without polynomial kernels (Q1034099):
Displaying 50 items.
- Spanners in sparse graphs (Q657919) (← links)
- Kernelization hardness of connectivity problems in \(d\)-degenerate graphs (Q713308) (← links)
- Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems (Q719315) (← links)
- Fréchet distance between a line and avatar point set (Q722543) (← links)
- Turing kernelization for finding long paths and cycles in restricted graph classes (Q730497) (← links)
- Parameterized algorithm for eternal vertex cover (Q765521) (← links)
- Dual parameterization of weighted coloring (Q786042) (← links)
- Meta-kernelization with structural parameters (Q896025) (← links)
- Linear kernel for \textsc{Rooted Triplet Inconsistency} and other problems based on conflict packing technique (Q896028) (← links)
- Obtaining split graphs by edge contraction (Q897961) (← links)
- Extremal kernelization: a commemorative paper (Q1642680) (← links)
- Two edge modification problems without polynomial kernels (Q1662097) (← links)
- Kernelization lower bounds for finding constant-size subgraphs (Q1670739) (← links)
- Note on maximal bisection above tight lower bound (Q1675768) (← links)
- Multivariate complexity analysis of geometric \textsc{Red Blue Set Cover} (Q1679222) (← links)
- On the kernelization complexity of string problems (Q1749539) (← links)
- Algorithms, kernels and lower bounds for the flood-it game parameterized by the vertex cover number (Q1752485) (← links)
- Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs (Q1755775) (← links)
- Parameterized computational complexity of finding small-diameter subgraphs (Q1758028) (← links)
- Parameterized complexity of length-bounded cuts and multicuts (Q1799212) (← links)
- On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems (Q1949740) (← links)
- Parameterized two-player Nash equilibrium (Q1949741) (← links)
- The parameterized complexity of some minimum label problems (Q1959420) (← links)
- On the parameterized complexity of contraction to generalization of trees (Q2000005) (← links)
- On the approximate compressibility of connected vertex cover (Q2006945) (← links)
- Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization (Q2032346) (← links)
- On the parametrized complexity of Read-once refutations in UTVPI+ constraint systems (Q2049975) (← links)
- On some FPT problems without polynomial Turing compressions (Q2072079) (← links)
- On the complexity of approximately matching a string to a directed graph (Q2084771) (← links)
- A polynomial kernel for bipartite permutation vertex deletion (Q2093571) (← links)
- Twin-width and polynomial kernels (Q2093574) (← links)
- Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds (Q2093577) (← links)
- Multistage vertex cover (Q2135630) (← links)
- From the \(W\)-hierarchy to XNLP. Classes of fixed parameter intractability (Q2154075) (← links)
- The parameterized complexity of \(s\)-club with triangle and seed constraints (Q2169965) (← links)
- Reoptimization of parameterized problems (Q2170282) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- Parameterized aspects of strong subgraph closure (Q2182097) (← links)
- Finding connected secluded subgraphs (Q2186823) (← links)
- Polynomial kernels for hitting forbidden minors under structural parameterizations (Q2202024) (← links)
- Parameterized low-rank binary matrix approximation (Q2218414) (← links)
- Refined notions of parameterized enumeration kernels with applications to matching cut enumeration (Q2237892) (← links)
- Kernels for packing and covering problems (Q2272393) (← links)
- Facility location problems: a parameterized view (Q2275913) (← links)
- Partitioning graphs into induced subgraphs (Q2283104) (← links)
- On the computational complexity of length- and neighborhood-constrained path problems (Q2294439) (← links)
- On the parameterized complexity of graph modification to first-order logic properties (Q2300624) (← links)
- Hitting minors on bounded treewidth graphs. III. Lower bounds (Q2301360) (← links)
- How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? (Q2324243) (← links)
- Two edge-disjoint paths with length constraints (Q2330117) (← links)
