The following pages link to (Q5743378):
Displaying 40 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)
- The minimum feasible tileset problem (Q666670) (← links)
- Kernelization hardness of connectivity problems in \(d\)-degenerate graphs (Q713308) (← links)
- Best-case and worst-case sparsifiability of Boolean CSPs (Q786033) (← links)
- Parameterized algorithms and kernels for rainbow matching (Q1739114) (← 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)
- Lossy kernelization of same-size clustering (Q2097218) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- Kernels for packing and covering problems (Q2272393) (← links)
- Optimal data reduction for graph coloring using low-degree polynomials (Q2272594) (← 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)
- Kernel for \(K_t\)\textsc{-free Edge Deletion} (Q2656346) (← links)
- On fair covering and hitting problems (Q2672421) (← links)
- A Shortcut to (Sun)Flowers: Kernels in Logarithmic Space or Linear Time (Q2946401) (← links)
- Kernelization Algorithms for Packing Problems Allowing Overlaps (Q2948487) (← 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)
- (Q5009477) (← links)
- Hans Bodlaender and the Theory of Kernelization Lower Bounds (Q5042447) (← links)
- Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds (Q5042452) (← links)
- Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems (Q5048305) (← links)
- (Q5075825) (← links)
- Parameterized Algorithms and Kernels for Rainbow Matching (Q5111288) (← links)
- Triangle packing in (sparse) tournaments: approximation and kernelization (Q5111699) (← links)
- Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials (Q5111881) (← links)
- (Q5743381) (← links)
- Exploiting c-Closure in Kernelization Algorithms for Graph Problems (Q5874537) (← links)
- Lower bounds for the happy coloring problems (Q5918935) (← links)
- Parameterized certificate dispersal and its variants (Q5964075) (← links)
- Essentially tight kernels for (weakly) closed graphs (Q6103524) (← links)
- Lossy kernelization of same-size clustering (Q6174654) (← links)
- Improved FPT approximation scheme and approximate kernel for biclique-free max \(k\)-weight SAT: greedy strikes back (Q6664061) (← links)
