scientific article; zbMATH DE number 7053259

From MaRDI portal
Publication:5743378

zbMath1421.68072arXiv1812.03155MaRDI QIDQ5743378

Holger Dell, Dániel Marx

Publication date: 10 May 2019

Full work available at URL: https://arxiv.org/abs/1812.03155

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (40)

Hans Bodlaender and the Theory of Kernelization Lower BoundsCrossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower BoundsExploiting $c$-Closure in Kernelization Algorithms for Graph ProblemsUniform Kernelization Complexity of Hitting Forbidden MinorsNew Limits to Classical and Quantum Instance CompressionKernelization of Cycle Packing with Relaxed Disjointness ConstraintsAND-compression of NP-complete problems: streamlined proof and minor observationsDeterministic Algorithms for Matching and Packing Problems Based on Representative SetsKernel for \(K_t\)\textsc{-free Edge Deletion}Parameterized analysis and crossing minimization problemsSparsification upper and lower bounds for graph problems and not-all-equal SATA Shortcut to (Sun)Flowers: Kernels in Logarithmic Space or Linear TimeOn fair covering and hitting problemsKernel bounds for path and cycle problemsKernelization Algorithms for Packing Problems Allowing OverlapsPolynomial Kernel for Interval Vertex DeletionEssentially tight kernels for (weakly) closed graphsUnnamed ItemParameterized complexity of induced graph matching on claw-free graphsThe minimum feasible tileset problemExploiting c-Closure in Kernelization Algorithms for Graph ProblemsParameterized algorithms and kernels for rainbow matchingOn the approximate compressibility of connected vertex coverUnnamed ItemKernelization hardness of connectivity problems in \(d\)-degenerate graphsLossy kernelization of same-size clusteringKernels for packing and covering problemsOptimal data reduction for graph coloring using low-degree polynomialsParameterized certificate dispersal and its variantsLower bounds for the happy coloring problemsOptimal Data Reduction for Graph Coloring Using Low-Degree PolynomialsParameterized Algorithms and Kernels for Rainbow MatchingTriangle packing in (sparse) tournaments: approximation and kernelizationBest-case and worst-case sparsifiability of Boolean CSPsA polynomial kernel for bipartite permutation vertex deletionIntroducing \textsf{lop}-kernels: a framework for kernelization lower boundsLossy kernelization of same-size clusteringUnnamed ItemA completeness theory for polynomial (Turing) kernelizationOn sparsification for computing treewidth



Cites Work


This page was built for publication: