Pages that link to "Item:Q1034099"

The following pages link to On problems without polynomial kernels (Q1034099):

Displaying 50 items.

• Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization (Q3012824) (← links)
• Domination When the Stars Are Out (Q3012826) (← links)
• On the Kernelization Complexity of Colorful Motifs (Q3058688) (← links)
• On Making a Distinguished Vertex Minimum Degree by Vertex Deletion (Q3075510) (← links)
• Data Reduction for Graph Coloring Problems (Q3088272) (← links)
• Polynomial Kernels for Proper Interval Completion and Related Problems (Q3088286) (← links)
• Planar k-Path in Subexponential Time and Polynomial Space (Q3104782) (← links)
• From Few Components to an Eulerian Graph by Adding Arcs (Q3104786) (← links)
• Basic Terminology, Notation and Results (Q3120433) (← links)
• Kernelization of Cycle Packing with Relaxed Disjointness Constraints (Q3174716) (← links)
• A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter (Q3177162) (← links)
• Towards Non-Black-Box Separations of Public Key Encryption and One Way Function (Q3181026) (← links)
• Finding Two Edge-Disjoint Paths with Length Constraints (Q3181047) (← links)
• New Limits to Classical and Quantum Instance Compression (Q3449566) (← links)
• Known Algorithms for Edge Clique Cover are Probably Optimal (Q3464061) (← links)
• Fractals for Kernelization Lower Bounds (Q4609787) (← links)
• How Bad is the Freedom to Flood-It? (Q4622773) (← links)
• Parameterized Algorithms for Maximum Edge Biclique and Related Problems (Q4632171) (← links)
• Kernelization of Two Path Searching Problems on Split Graphs (Q4632190) (← links)
• Finding Disjoint Dense Clubs in an Undirected Graph (Q4632197) (← links)
• Kernelization of Graph Hamiltonicity: Proper $H$-Graphs (Q4986812) (← links)
• (Q4993600) (← links)
• Dual parameterization of Weighted Coloring (Q5009474) (← links)
• Hans Bodlaender and the Theory of Kernelization Lower Bounds (Q5042447) (← links)
• Algorithms, Complexity, and Hans (Q5042448) (← links)
• Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds (Q5042452) (← links)
• A Retrospective on (Meta) Kernelization (Q5042460) (← links)
• (Q5075825) (← links)
• (Q5090486) (← links)
• A deterministic polynomial kernel for odd cycle transversal and vertex multiway cut in planar graphs (Q5090489) (← links)
• (Q5091010) (← links)
• On the Complexity of Bounded Context Switching. (Q5111714) (← links)
• How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs (Q5111869) (← links)
• Smaller Parameters for Vertex Cover Kernelization (Q5111879) (← links)
• (Q5116487) (← links)
• Parameterized Complexity of Safe Set (Q5119377) (← links)
• The Parameterized Complexity of Motion Planning for Snake-Like Robots (Q5130004) (← links)
• The Maximum Colorful Arborescence problem parameterized by the structure of its color hierarchy graph (Q5140781) (← links)
• A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs (Q5163509) (← links)
• 3-Hitting set on bounded degree hypergraphs: Upper and lower bounds on the kernel size (Q5261045) (← links)
• Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth (Q5266611) (← links)
• Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses (Q5501928) (← links)
• Partially Polynomial Kernels for Set Cover and Test Cover (Q5741085) (← links)
• (Q5743378) (← links)
• (Q5743379) (← links)
• (Q5743380) (← links)
• (Q5743381) (← links)
• (Q5743382) (← links)
• Approximate Turing Kernelization for Problems Parameterized by Treewidth (Q5874531) (← links)
• Parameterized complexity and kernelizability of max ones and exact ones problems (Q5890961) (← links)