scientific article; zbMATH DE number 7075869
From MaRDI portal
zbMath1409.68144MaRDI QIDQ4967164
Publication date: 3 July 2019
Full work available at URL: http://bulletin.eatcs.org/index.php/beatcs/article/view/285/267
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
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, Win-win kernelization for degree sequence completion problems, Kernelization of Cycle Packing with Relaxed Disjointness Constraints, Parameterizing edge modification problems above lower bounds, A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter, \(\mathrm{H}\)-index manipulation by merging articles: models, theory, and experiments, A polynomial kernel for funnel arc deletion set, Parameterized and approximation algorithms for the load coloring problem, 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, Approximation and Kernelization for Chordal Vertex Deletion, Interval scheduling and colorful independent sets, Parameterized algorithms and data reduction for the short secluded s‐t‐path problem, Polynomial Kernel for Interval Vertex Deletion, Essentially tight kernels for (weakly) closed graphs, The complexity of degree anonymization by vertex addition, Polynomial kernels for hitting forbidden minors under structural parameterizations, Fractals for Kernelization Lower Bounds, Path-contractions, edge deletions and connectivity preservation, Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments, 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., Refined notions of parameterized enumeration kernels with applications to matching cut enumeration, A Polynomial Kernel for Funnel Arc Deletion Set., On explaining integer vectors by few homogeneous segments, On the approximate compressibility of connected vertex cover, Tree Deletion Set Has a Polynomial Kernel but No $\text{OPT}^\mathcal{O}(1)$ Approximation), Unnamed Item, Parameterized complexity of machine scheduling: 15 open problems, Alternative parameterizations of \textsc{Metric Dimension}, Parameterized certificate dispersal and its variants, Finding large degree-anonymous subgraphs is hard, Bidimensionality and Kernels, On approximate preprocessing for domination and hitting subgraphs with connected deletion sets, On some FPT problems without polynomial Turing compressions, Path-Contractions, Edge Deletions and Connectivity Preservation, Lossy Kernels for Hitting Subgraphs, A polynomial kernel for bipartite permutation vertex deletion, Pure Nash equilibria in graphical games and treewidth, A refined complexity analysis of degree anonymization in graphs
