scientific article; zbMATH DE number 7559435
From MaRDI portal
Publication:5089236
DOI10.4230/LIPIcs.MFCS.2020.64MaRDI QIDQ5089236
Ignasi Sau, Uéverton S. Souza, Vinícius Fernandes dos Santos, Paloma T. Lima
Publication date: 18 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
vertex coverfeedback vertex setparameterized complexityedge contractionodd cycle transversalblocker problemgraph transversal
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- Minimum \(d\)-blockers and \(d\)-transversals in graphs
- The most vital nodes with respect to independent set and vertex cover
- Blockers for the stability number and the chromatic number
- Nonempty intersection of longest paths in series-parallel graphs
- Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid
- Graph minors. V. Excluding a planar graph
- The node-deletion problem for hereditary properties is NP-complete
- Hadwiger's conjecture is true for almost every graph
- Which problems have strongly exponential complexity?
- Critical vertices and edges in \(H\)-free graphs
- Contraction and deletion blockers for perfect graphs and \(H\)-free graphs
- On the NP-hardness of edge-deletion and -contraction problems
- Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs
- Hitting forbidden subgraphs in graphs of bounded treewidth
- Contracting graphs to paths and trees
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Hadwiger Number of Graphs with Small Chordality
- Easy problems for tree-decomposable graphs
- Lossy Kernels for Graph Contraction Problems
- Minimum vertex blocker clique problem
- Transversals of Longest Paths and Cycles
- Node-and edge-deletion NP-complete problems
- Obtaining a Bipartite Graph by Contracting Few Edges
- Parameterized Algorithms
- Intersection of longest paths in graph classes
- Transversals of longest paths
- On the complexity of \(k\)-SAT
This page was built for publication:
