scientific article; zbMATH DE number 6515825
From MaRDI portal
Publication:3455032
Recommendations
- scientific article; zbMATH DE number 1508265
- Improved approximation of maximum vertex cover
- An improved fixed-parameter algorithm for vertex cover
- Improved Parameterized Upper Bounds for Vertex Cover
- Improved upper bounds for vertex cover
- scientific article; zbMATH DE number 1420918
- Vertex cover: Further observations and further improvements
- Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs
- scientific article; zbMATH DE number 1445320
- Improved Upper Bounds for Partial Vertex Cover
Cited in
(55)- Local linear set on graphs with bounded twin cover number
- Measuring what matters: a hybrid approach to dynamic programming with treewidth
- Coloring a dominating set without conflicts: \(q\)-subset square coloring
- Parameterized algorithms for book embedding problems
- Computing \(L(p, 1)\)-labeling with combined parameters
- Refined notions of parameterized enumeration kernels with applications to matching cut enumeration
- Optimal data reduction for graph coloring using low-degree polynomials
- Computing the largest bond and the maximum connected cut of a graph
- Computing densest \(k\)-subgraph with structural parameters
- Vertex cover: Further observations and further improvements
- On structural parameterizations of graph motif and chromatic number
- Algorithms and experiments for parameterized approaches to hard graph problems
- scientific article; zbMATH DE number 7029306 (Why is no real title available?)
- Computing L(p,1)-Labeling with Combined Parameters
- Parameterized complexity of fair vertex evaluation problems
- Parameterized algorithms for book embedding problems
- Imbalance parameterized by twin cover revisited
- Subgraph isomorphism on graph classes that exclude a substructure
- Parameterized algorithms for the happy set problem
- Edge-cut width: an algorithmically driven analogue of treewidth based on edge cuts
- Grouped domination parameterized by vertex cover, twin cover, and beyond
- Structural parameterization of cluster deletion
- Colouring a dominating set without conflicts: \(q\)-subset square colouring
- Structural parameterizations for equitable coloring: complexity, FPT algorithms, and kernelization
- Grouped domination parameterized by vertex cover, twin cover, and beyond
- On structural parameterizations of star coloring
- Dominator coloring and CD coloring in almost cluster graphs
- Offensive alliances in graphs
- On Structural Parameterizations of the Harmless Set Problem
- Slim tree-cut width
- The parameterized complexity of maximum betweenness centrality
- Globally minimal defensive alliances: a parameterized perspective
- Enumerating minimal defensive alliances
- The parameterized complexity of strong conflict-free vertex-connection colorability
- On the tractability of defensive alliance problem
- Algorithms for minimum membership dominating set problem
- Bandwidth parameterized by cluster vertex deletion number
- Further parameterized results on weak Grundy coloring
- Parameterized complexity of maximum happy set and densest k-subgraph
- Slim tree-cut width
- Parameterized complexity of coupon coloring of graphs
- Structural parameterization of cluster deletion
- Preprocessing complexity for some graph problems parameterized by structural parameters
- Dynamic coloring on restricted graph classes
- Dominator coloring and CD coloring in almost cluster graphs
- Fine-grained meta-theorems for vertex integrity
- Refined notions of parameterized enumeration kernels with applications to matching cut enumeration
- On the parameterized complexity of s-club cluster edge deletion
- First order logic on pathwidth revisited again
- Parameterized spanning tree congestion
- A characterization of semitwin digraphs
- On the complexity of secluded path problems
- A graph width perspective on partially ordered Hamiltonian paths and cycles ii: vertex and edge deletion numbers
- Structural parameterizations of simultaneous planarity
- Quadratic kernel for cliques or trees vertex deletion
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3455032)
