The parameter report: an orientation guide for data-driven parameterization
From MaRDI portal
Cites work
- k-Degenerate Graphs
- A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
- A contraction-recursive algorithm for treewidth
- A decomposition theorem for partially ordered sets
- A faster algorithm for vertex cover parameterized by solution size
- Algorithmic meta-theorems for restrictions of treewidth
- Bounded search tree algorithms for parametrized cograph deletion: efficient branching rules by exploiting structures of special graph classes
- Cluster vertex deletion: a parameterization between vertex cover and clique-width
- Decomposition of Directed Graphs
- Detecting Feedback Vertex Sets of Size k in O ⋆ (2.7 k ) Time
- Finding cliques in social networks: a new distribution-free model
- Finer tight bounds for coloring on clique-width
- Fixed-parameter algorithms for cluster vertex deletion
- Graph minors. II. Algorithmic aspects of tree-width
- Graph theory (to appear)
- Half-integrality, LP-branching, and FPT algorithms
- scientific article; zbMATH DE number 4162911 (Why is no real title available?)
- scientific article; zbMATH DE number 4053662 (Why is no real title available?)
- scientific article; zbMATH DE number 1496855 (Why is no real title available?)
- scientific article; zbMATH DE number 7764125 (Why is no real title available?)
- Improved analysis of highest-degree branching for feedback vertex set
- Isolation concepts for efficiently enumerating dense subgraphs
- Linear time split decomposition revisited
- Linear-time kernelization for feedback vertex set
- Minimum \(k\)-path vertex cover
- Multivariate algorithmics for finding cohesive subnetworks
- Multivariate algorithmics for NP-hard string problems
- New races in parameterized algorithmics
- Note on Dilworth's Decomposition Theorem for Partially Ordered Sets
- On bounded-degree vertex deletion parameterized by treewidth
- On polynomial kernels for structural parameterizations of odd cycle transversal
- On structural parameterizations for the 2-club problem
- On structural parameterizations of the bounded-degree vertex deletion problem
- On the computational complexity of vertex integrity and component order connectivity
- PACE Solver Description: Tree Depth with FlowCutter
- Parameterized Algorithms for Modular-Width
- Parameterized complexity of vertex colouring
- Positive-instance driven dynamic programming for treewidth
- Recognition algorithms for orders of small width and graphs of small Dilworth number
- S-functions for graphs
- Serial and parallel kernelization of multiple hitting set parameterized by the Dilworth number, implemented on the GPU
- Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
- Structural parameterizations for boxicity
- Structural parameterizations of vertex integrity (best paper)
- The complexity ecology of parameters: An illustration using bounded max leaf number
- The h-Index of a Graph and its Application to Dynamic Subgraph Statistics
- The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth.
- Tight Algorithms for Connectivity Problems Parameterized by Modular-Treewidth
- Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity
- Tree-depth, subgraph coloring and homomorphism bounds
This page was built for publication: The parameter report: an orientation guide for data-driven parameterization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7357282)
