Recent developments in kernelization: a survey
From MaRDI portal
Recommendations
Cited in
(53)- Path-contractions, edge deletions and connectivity preservation
- Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments
- Parameterized complexity of machine scheduling: 15 open problems
- On the approximate compressibility of connected vertex cover
- On some FPT problems without polynomial Turing compressions
- A polynomial kernel for bipartite permutation vertex deletion
- A polynomial kernel for funnel arc deletion set
- Polynomial kernels for hitting forbidden minors under structural parameterizations
- Refined notions of parameterized enumeration kernels with applications to matching cut enumeration
- On explaining integer vectors by few homogeneous segments
- Alternative parameterizations of \textsc{Metric Dimension}
- On approximate preprocessing for domination and hitting subgraphs with connected deletion sets
- Pure Nash equilibria in graphical games and treewidth
- A refined complexity analysis of degree anonymization in graphs
- Parameterized and approximation algorithms for the load coloring problem
- Linear-vertex kernel for the problem of packing r-stars into a graph without long induced paths
- On polynomial kernels for sparse integer linear programs
- Changes in dense linear algebra kernels: decades-long perspective
- Kernelization -- preprocessing with a guarantee
- Streaming kernelization
- A shortcut to (sun)flowers: kernels in logarithmic space or linear time
- A refined complexity analysis of finding the most vital edges for undirected shortest paths
- Win-win kernelization for degree sequence completion problems
- Kernelization of cycle packing with relaxed disjointness constraints
- A randomized polynomial kernelization for vertex cover with a smaller parameter
- \(\mathrm{H}\)-index manipulation by merging articles: models, theory, and experiments
- Bidimensionality and kernels
- The Lost Continent of Polynomial Time: Preprocessing and Kernelization
- Kernelization: new upper and lower bound techniques
- Approximation and kernelization for chordal vertex deletion
- Fractals for kernelization lower bounds
- A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths
- Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations.
- A Retrospective on (Meta) Kernelization
- An approximate kernel for connected feedback vertex set
- Lossy Kernels for Hitting Subgraphs
- Path-contractions, edge deletions and connectivity preservation
- Tree deletion set has a polynomial kernel but no \(\mathrm{OPT}^\mathcal{O}(1)\) approximation)
- Parameterized certificate dispersal and its variants
- Finding large degree-anonymous subgraphs is hard
- Parameterized algorithms and data reduction for the short secluded s‐t‐path problem
- Polynomial Kernel for Interval Vertex Deletion
- A Polynomial Kernel for Funnel Arc Deletion Set.
- Essentially tight kernels for (weakly) closed graphs
- Search-space reduction via essential vertices
- The role of twins in computing planar supports of hypergraphs
- Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion
- Approximately interpolating between uniformly and non-uniformly polynomial kernels
- Search-space reduction via essential vertices
- Wannabe bounded treewidth graphs admit a polynomial kernel for directed feedback vertex set
- Refined notions of parameterized enumeration kernels with applications to matching cut enumeration
- On kernelization with access to NP-oracles
- The complexity of degree anonymization by vertex addition
This page was built for publication: Recent developments in kernelization: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4967164)
