Bandwidth parameterized by cluster vertex deletion number
From MaRDI portal
Cites work
- Algorithmic applications of tree-cut width
- Algorithmic meta-theorems for restrictions of treewidth
- An application of simultaneous diophantine approximation in combinatorial optimization
- An exponential time 2-approximation algorithm for bandwidth
- Bandwidth and distortion revisited
- Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy (extended abstract)
- Bin packing with fixed number of bins revisited
- Cluster vertex deletion: a parameterization between vertex cover and clique-width
- Complexity Results for Bandwidth Minimization
- Constant thresholds can make target set selection tractable
- Dominator coloring and CD coloring in almost cluster graphs
- Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time
- Even faster exact bandwidth
- Exact and approximate bandwidth
- Exploring the gap between treedepth and vertex cover through vertex integrity
- FPT algorithms for FVS parameterized by split and cluster vertex deletion sets and other parameters
- Graph Layout Problems Parameterized by Vertex Cover
- Graph theory
- Imbalance parameterized by twin cover revisited
- Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem
- Integer Programming with a Fixed Number of Variables
- Minimum eccentricity shortest path problem with respect to structural parameters
- Minkowski's Convex Body Theorem and Integer Programming
- On cutwidth parameterized by vertex cover
- Optimal Assignments of Numbers to Vertices
- Parameterized algorithms
- Parameterized algorithms for Graph Burning problem
- Parameterized Algorithms for Modular-Width
- Parameterized complexity of \textsc{bandwidth} of \textsc{caterpillars} and \textsc{weighted path emulation}
- Parameterized complexity of bandwidth on trees
- Structural parameterizations for boxicity
- The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete
- The bandwidth minimization problem for cyclic caterpillars with hair length 1 is NP-complete
- The bandwidth problem for graphs and matrices—a survey
- The complexity ecology of parameters: An illustration using bounded max leaf number
- The Firefighter Problem: A Structural Analysis
- The NP-completeness of the bandwidth minimization problem
- Tractable parameterizations for the minimum linear arrangement problem
- Tree-depth, subgraph coloring and homomorphism bounds
- Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics
- When trees grow low: shrubs and fast \(\mathrm{MSO}_{1}\)
Cited in
(2)
This page was built for publication: Bandwidth parameterized by cluster vertex deletion number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6926188)
