Graph Layout Problems Parameterized by Vertex Cover
From MaRDI portal
Recommendations
- Parameterized algorithms for linear layouts of graphs with respect to the vertex cover number
- Vertex cover structural parameterization revisited
- Deterministic parameterized connected vertex cover
- Vertex cover problem parameterized above and below tight bounds
- On the parameterized vertex cover problem for graphs with perfect matching
- Parameterized complexity of Vertex Cover variants
- Algorithms and Data Structures
Cited in
(81)- Safe sets in graphs: graph classes and structural parameters
- A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion
- The complexity landscape of decompositional parameters for ILP
- Swapping colored tokens on graphs
- Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications
- Algorithmic meta-theorems for restrictions of treewidth
- Alliances in graphs of bounded clique-width
- On structural parameterizations of the edge disjoint paths problem
- Measuring what matters: a hybrid approach to dynamic programming with treewidth
- Parameterized algorithms for linear layouts of graphs with respect to the vertex cover number
- On the harmless set problem parameterized by treewidth
- Combinatorial \(n\)-fold integer programming and applications
- Parameterized algorithms for book embedding problems
- On structural parameterizations of the bounded-degree vertex deletion problem
- The small set vertex expansion problem
- The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints
- Using decomposition-parameters for QBF: mind the prefix!
- Maximum common induced subgraph parameterized by vertex cover
- FPT algorithms to compute the elimination distance to bipartite graphs and more
- Integer programming in parameterized complexity: five miniatures
- Further parameterized algorithms for the \(\mathcal{F}\)-free edge deletion problem
- Parameterized complexity of envy-free resource allocation in social networks
- Polynomial-time data reduction for weighted problems beyond additive goal functions
- Group activity selection with few agent types
- On cutwidth parameterized by vertex cover
- Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics
- Algorithmic applications of tree-cut width
- Safe sets in graphs: graph classes and structural parameters
- Parameterized Complexity Results for 1-safe Petri Nets
- Graph isomorphism parameterized by elimination distance to bounded degree
- Kernelization using structural parameters on sparse graph classes
- Treewidth and pathwidth parameterized by the vertex cover number
- Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter
- Two-layer planarization parameterized by feedback edge set
- On cutwidth parameterized by vertex cover
- Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem}
- Iterated Type Partitions
- Algorithmic applications of tree-cut width
- Group activity selection with few agent types
- Measuring what matters: a hybrid approach to dynamic programming with treewidth
- Combinatorial \(n\)-fold integer programming and applications
- Parameterized complexity of safe set
- Parameterized algorithms for book embedding problems
- Critical elements in combinatorially closed families of graph classes
- Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring
- Parameterized complexity of coloring problems: treewidth versus vertex cover
- Exploring the gap between treedepth and vertex cover through vertex integrity
- Imbalance parameterized by twin cover revisited
- Exploring the gap between treedepth and vertex cover through vertex integrity
- Edge-cut width: an algorithmically driven analogue of treewidth based on edge cuts
- An algorithmic framework for locally constrained homomorphisms
- Approximation and parameterized algorithms for balanced connected partition problems
- Parameterized complexity for iterated type partitions and modular-width
- Structural parameterization of alliance problems
- Balanced connected partitions of graphs: approximation, parameterization and lower bounds
- Extended MSO model checking via small vertex integrity
- Offensive alliances in graphs
- On Structural Parameterizations of the Harmless Set Problem
- An algorithmic framework for locally constrained homomorphisms
- Parameterized algorithms for minimum sum vertex cover
- Slim tree-cut width
- Vertex-bipartition: a unified approach for kernelization of graph linear layout problems parameterized by vertex cover
- Globally minimal defensive alliances: a parameterized perspective
- (t, r)-broadcast domination in graphs
- On the tractability of defensive alliance problem
- Bandwidth parameterized by cluster vertex deletion number
- Bandwidth parameterized by cluster vertex deletion number
- Slim tree-cut width
- Parameterized complexity of locally minimal defensive alliances
- Preprocessing complexity for some graph problems parameterized by structural parameters
- On the tractability landscape of the conditional minisum approval voting rule
- Parameterized algorithms for minimum sum vertex cover
- Finding vertex-surjective graph homomorphisms
- The complexity ecology of parameters: An illustration using bounded max leaf number
- On integer programs that look like paths
- Solving 4-block integer linear programs faster using affine decompositions of the right-hand sides
- New algorithm for combinatorial n-folds and applications
- Parameterized algorithms for matching integer programs with additional rows and columns
- On the complexity of signed domination
- On bounded-degree vertex deletion parameterized by treewidth
- Parameterized complexity of locally minimal defensive alliances
This page was built for publication: Graph Layout Problems Parameterized by Vertex Cover
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3596727)
