The following pages link to (Q5743381):
Displaying 28 items.
- AND-compression of NP-complete problems: streamlined proof and minor observations (Q309801) (← links)
- Kernel bounds for path and cycle problems (Q392032) (← links)
- Parameterized complexity of induced graph matching on claw-free graphs (Q487013) (← links)
- Kernelization hardness of connectivity problems in \(d\)-degenerate graphs (Q713308) (← links)
- Dual parameterization of weighted coloring (Q786042) (← links)
- On the approximate compressibility of connected vertex cover (Q2006945) (← links)
- A polynomial kernel for bipartite permutation vertex deletion (Q2093571) (← links)
- Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds (Q2093577) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- A completeness theory for polynomial (Turing) kernelization (Q2343083) (← links)
- On sparsification for computing treewidth (Q2343087) (← links)
- Sparsification upper and lower bounds for graph problems and not-all-equal SAT (Q2408194) (← links)
- Kernelization of Cycle Packing with Relaxed Disjointness Constraints (Q3174716) (← links)
- Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets (Q3195130) (← links)
- Uniform Kernelization Complexity of Hitting Forbidden Minors (Q3448821) (← links)
- New Limits to Classical and Quantum Instance Compression (Q3449566) (← links)
- Dual parameterization of Weighted Coloring (Q5009474) (← links)
- On the Complexity of Broadcast Domination and Multipacking in Digraphs (Q5041195) (← links)
- Hans Bodlaender and the Theory of Kernelization Lower Bounds (Q5042447) (← links)
- Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems (Q5048305) (← links)
- (Q5075825) (← links)
- Triangle packing in (sparse) tournaments: approximation and kernelization (Q5111699) (← links)
- (Q5743378) (← links)
- (Q5743381) (← links)
- (Q5743382) (← links)
- Exploiting c-Closure in Kernelization Algorithms for Graph Problems (Q5874537) (← links)
- Lower bounds for the happy coloring problems (Q5918935) (← links)
- Essentially tight kernels for (weakly) closed graphs (Q6103524) (← links)
