The following pages link to Lossy kernelization (Q4977974):
Displaying 43 items.
- On the parameterized complexity of maximum degree contraction problem (Q832521) (← links)
- Time-approximation trade-offs for inapproximable problems (Q1678175) (← links)
- Parameterized approximation via fidelity preserving transformations (Q1686226) (← links)
- On the kernelization complexity of string problems (Q1749539) (← links)
- On the parameterized complexity of contraction to generalization of trees (Q2000005) (← links)
- On the approximate compressibility of connected vertex cover (Q2006945) (← links)
- Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds (Q2093577) (← links)
- Dynamic kernels for hitting sets and set packing (Q2093581) (← links)
- Lossy kernelization of same-size clustering (Q2097218) (← links)
- Partial vertex cover on graphs of bounded degeneracy (Q2097233) (← links)
- To close is easier than to open: dual parameterization to \(k\)-median (Q2117693) (← links)
- The parameterized hardness of the \(k\)-center problem in transportation networks (Q2182096) (← links)
- Refined notions of parameterized enumeration kernels with applications to matching cut enumeration (Q2237892) (← links)
- On approximate preprocessing for domination and hitting subgraphs with connected deletion sets (Q2316936) (← links)
- Revisiting connected vertex cover: FPT algorithms and lossy kernels (Q2322693) (← links)
- \(p\)-edge/vertex-connected vertex cover: parameterized and approximation algorithms (Q2677827) (← links)
- Fixed-parameter algorithms for unsplittable flow cover (Q2701069) (← links)
- (Q3304124) (← links)
- Lossy Kernels for Connected Dominating Set on Sparse Graphs (Q3304128) (← links)
- Fractals for Kernelization Lower Bounds (Q4609787) (← links)
- Parameterized Approximation Algorithms for Bidirected Steiner Network Problems (Q5009577) (← links)
- Hans Bodlaender and the Theory of Kernelization Lower Bounds (Q5042447) (← links)
- Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack (Q5075797) (← links)
- (Q5075825) (← links)
- Lossy Kernels for Hitting Subgraphs (Q5111284) (← links)
- The Parameterized Hardness of the k-Center Problem in Transportation Networks (Q5116483) (← links)
- Packing Cycles Faster Than Erdos--Posa (Q5232148) (← links)
- Lossy Kernels for Connected Dominating Set on Sparse Graphs (Q5234662) (← links)
- Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices (Q5857009) (← links)
- Approximate Turing Kernelization for Problems Parameterized by Treewidth (Q5874531) (← links)
- Parameterized complexity of geometric covering problems having conflicts (Q5919304) (← links)
- The parameterized complexity of cycle packing: indifference is not an issue (Q5919574) (← links)
- On data reduction for dynamic vector bin packing (Q6047700) (← links)
- Parameterized algorithms and data reduction for the short secluded <i>s</i>‐<i>t</i>‐path problem (Q6068532) (← links)
- On the Parameterized Approximability of Contraction to Classes of Chordal Graphs (Q6084414) (← links)
- On approximate data reduction for the Rural Postman Problem: Theory and experiments (Q6092640) (← links)
- Packing arc-disjoint cycles in oriented graphs (Q6126480) (← links)
- Matroid-constrained vertex cover (Q6162073) (← links)
- Lossy kernelization of same-size clustering (Q6174654) (← links)
- On MAX-SAT with cardinality constraint (Q6575388) (← links)
- On MAX-SAT with cardinality constraint (Q6652473) (← links)
- Improved FPT approximation scheme and approximate kernel for biclique-free max \(k\)-weight SAT: greedy strikes back (Q6664061) (← links)
- Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion (Q6670351) (← links)
