Graph minors and parameterized algorithm design
From MaRDI portal
Publication:2908540
Recommendations
Cites work
- scientific article; zbMATH DE number 6381752 (Why is no real title available?)
- scientific article; zbMATH DE number 2086260 (Why is no real title available?)
- scientific article; zbMATH DE number 5764786 (Why is no real title available?)
- scientific article; zbMATH DE number 5764900 (Why is no real title available?)
- scientific article; zbMATH DE number 4033746 (Why is no real title available?)
- scientific article; zbMATH DE number 4060712 (Why is no real title available?)
- scientific article; zbMATH DE number 1142299 (Why is no real title available?)
- scientific article; zbMATH DE number 1543064 (Why is no real title available?)
- scientific article; zbMATH DE number 1543076 (Why is no real title available?)
- scientific article; zbMATH DE number 2149351 (Why is no real title available?)
- scientific article; zbMATH DE number 1870413 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- scientific article; zbMATH DE number 6783430 (Why is no real title available?)
- scientific article; zbMATH DE number 6783431 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- scientific article; zbMATH DE number 3198033 (Why is no real title available?)
- (Meta) Kernelization
- A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A Practical Approach to Courcelle's Theorem
- Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction
- Algorithms and obstructions for linear-width and related search parameters
- An improved algorithm for the half-disjoint paths problem
- Approximation algorithms for treewidth
- Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
- Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy (extended abstract)
- Bidimensional Parameters and Local Treewidth
- Bidimensionality and kernels
- Bidimensionality: new connections between FPT algorithms and PTASs
- Chordal deletion is fixed-parameter tractable
- Contraction checking in graphs on surfaces
- Contraction obstructions for treewidth
- Courcelle's theorem -- a game-theoretic approach
- Directed Nowhere Dense Classes of Graphs
- Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up
- Domination problems in nowhere-dense classes of graphs
- Dynamic Programming and Fast Matrix Multiplication
- Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
- Dynamic programming for graphs on surfaces
- Easy problems for tree-decomposable graphs
- Efficient Parallel Algorithms for Graphs of Bounded Tree-Width
- Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions
- Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
- Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus
- Fast minor testing in planar graphs
- Finding topological subgraphs is fixed-parameter tractable
- Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
- Fourier meets M\"{o}bius: fast subset convolution
- Girths of bipartite sextet graphs
- Graph minor theory
- Graph minors XXIII. Nash-Williams' immersion conjecture
- Graph minors. I. Excluding a forest
- Graph minors. II. Algorithmic aspects of tree-width
- Graph minors. III. Planar tree-width
- Graph minors. V. Excluding a planar graph
- Graph minors. X: Obstructions to tree-decomposition
- Graph minors. XIII: The disjoint paths problem
- Graph minors. XVII: Taming a vortex
- Graph minors. XX: Wagner's conjecture
- Graph minors. XXI. graphs with unique linkages
- Graph minors. XXII. Irrelevant vertices in linkage problems
- Hadwiger's conjecture is decidable
- Highly connected sets and the excluded grid theorem
- Hitting forbidden minors: approximation and kernelization
- Improved bounds on the planar branchwidth with respect to the largest grid minor size
- Induced Packing of Odd Cycles in a Planar Graph
- Linearity of grid minors in treewidth with applications through bidimensionality
- Linkless and flat embeddings in 3-space and the unknot problem
- Minimal acyclic forbidden minors for the family of graphs with bounded path-width
- Obstructions for tree-depth
- Obtaining a bipartite graph by contracting few edges
- Obtaining a planar graph by vertex deletion
- Odd cycle packing
- On Ordered Division Rings
- On computing graph minor obstruction sets
- On obstructions to small face covers in planar graphs
- On search, decision, and the efficiency of polynomial-time algorithms
- On the excluded minors for the matroids of branch-width \(k\)
- On the existence of subexponential parameterized algorithms
- Ordering by Divisibility in Abstract Algebras
- Outerplanar obstructions for matroid pathwidth
- Outerplanar obstructions for the feedback vertex set
- Parameterized complexity of vertex deletion into perfect graph classes
- Parameterizing cut sets in a graph by the number of their components
- Planarity Allowing Few Error Vertices in Linear Time
- Polynomial treewidth forces a large grid-like-minor
- Quickly excluding a planar graph
- Recognizing a totally odd \(K_{4}\)-subdivision, parity 2-disjoint rooted paths and a parity cycle through specified elements
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- Subexponential algorithms for partial cover problems
- Subexponential parameterized algorithms on bounded-genus graphs and \(H\)-minor-free graphs
- The Bidimensional Theory of Bounded-Genus Graphs
- The NP-completeness column: An ongoing guide
- The Structure and Number of Obstructions to Treewidth
- The complexity of first-order and monadic second-order logic revisited
- The disjoint paths problem in quadratic time
- The edge disjoint paths problem in Eulerian graphs and 4-edge-connected graphs
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- The structure of obstructions to treewidth and pathwidth
- The vertex separation and search number of a graph
- Tight bounds for linkages in planar graphs
- Towards fully multivariate algorithmics: some new results and directions in parameter ecology
- Tree decompositions of graphs: saving memory in dynamic programming
- Upper bounds on the size of obstructions and intertwines
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
Cited in
(16)- Compactors for parameterized counting problems
- Contraction bidimensionality of geometric intersection graphs
- A Retrospective on (Meta) Kernelization
- Parameterized computational geometry via decomposition theorems
- scientific article; zbMATH DE number 5874803 (Why is no real title available?)
- Elimination Distance to Bounded Degree on Planar Graphs
- \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions
- Contraction-bidimensionality of geometric intersection graphs
- Elimination distance to bounded degree on planar graphs preprint
- A Simple Algorithm for the Graph Minor Decomposition − Logic meets Structural Graph Theory–
- scientific article; zbMATH DE number 7378361 (Why is no real title available?)
- A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph
- Dynamic Programming for H-minor-free Graphs
- Combing a Linkage in an Annulus
- Quickly deciding minor-closed parameters in general graphs
- Bidimensionality and kernels
This page was built for publication: Graph minors and parameterized algorithm design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2908540)
