Graph Minors and Parameterized Algorithm Design (Q2908540): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Fast Minor Testing in Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Bounds for Linkages in Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3044360 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy problems for tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree decompositions of graphs: saving memory in dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On obstructions to small face covers in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fourier meets M\"{o}bius: fast subset convolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Meta) Kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beyond <i>NP</i>-completeness for problems of bounded width (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4661878 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of subexponential parameterized algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing graph minor obstruction sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of obstructions to treewidth and pathwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4520519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination Problems in Nowhere-Dense Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bidimensional Parameters and Local Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential parameterized algorithms on bounded-genus graphs and <i>H</i> -minor-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearity of grid minors in treewidth with applications through bidimensionality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bidimensional Theory of Bounded-Genus Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Highly connected sets and the excluded grid theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4520532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming and Fast Matrix Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertex separation and search number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology / rank
 
Normal rank
Property / cites work
 
Property / cites work: On search, decision, and the efficiency of polynomial-time algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contraction obstructions for treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3113683 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential algorithms for partial cover problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bidimensionality and Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of first-order and monadic second-order logic revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3773882 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4793024 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the excluded minors for the matroids of branch-width \(k\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obstructions for Tree-depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced Packing of Odd Cycles in a Planar Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding topological subgraphs is fixed-parameter tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity of Vertex Deletion into Perfect Graph Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2911626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordering by Divisibility in Abstract Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterizing cut sets in a graph by the number of their components / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness column: An ongoing guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2904760 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934714 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planarity Allowing Few Error Vertices in Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417629 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Algorithm for the Half-Disjoint Paths Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The disjoint paths problem in quadratic time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linkless and flat embeddings in 3-space and the unknot problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hadwiger's conjecture is decidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Odd cycle packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Practical Approach to Courcelle's Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Courcelle's theorem -- a game-theoretic approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2857402 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed Nowhere Dense Classes of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Parallel Algorithms for Graphs of Bounded Tree-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds on the size of obstructions and intertwines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365079 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minor theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chordal deletion is fixed-parameter tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obtaining a planar graph by vertex deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5734436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Ordered Division Rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Structure and Number of Obstructions to Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial treewidth forces a large grid-like-minor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. I. Excluding a forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. III. Planar tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. V. Excluding a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. X: Obstructions to tree-decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XXII. Irrelevant vertices in linkage problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XIII: The disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XVII: Taming a vortex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XX: Wagner's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XXI. graphs with unique linkages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors XXIII. Nash-Williams' immersion conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quickly excluding a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming for Graphs on Surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outerplanar Obstructions for the Feedback Vertex Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal acyclic forbidden minors for the family of graphs with bounded path-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and obstructions for linear-width and related search parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Girths of bipartite sextet graphs / rank
 
Normal rank

Latest revision as of 16:13, 5 July 2024

scientific article
Language Label Description Also known as
English
Graph Minors and Parameterized Algorithm Design
scientific article

    Statements

    Graph Minors and Parameterized Algorithm Design (English)
    0 references
    5 September 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    graph minors
    0 references
    parameterized algorithms
    0 references
    treewidth
    0 references
    bidimensionality
    0 references
    irrelevant vertex technique
    0 references
    linkages
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references