scientific article; zbMATH DE number 4133491

MaRDI QIDQ3034816zbMATH OpenFDO

Authors Michael R. Fellows

Publication date 1989

zbMATH Keywords

algorithmsRobertson-Seymour theorems

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 795221
• The great theorem of modern combinatorics
• On Well-Partial-Order Theory and Its Application to Combinatorial Problems of VLSI Design
• The complexity of induced minors and related problems
• On the computational complexity of ordered subgraph recognition

Cited in

(22)

• Few induced disjoint paths for \(H\)-free graphs
• Few induced disjoint paths for \(H\)-free graphs
• \(\mathrm P \overset {?} {=} \mathrm{NP}\)
• Non-interfering network flows
• The birth and early years of parameterized complexity
• Comparing trees via crossing minimization
• How I got to like graph polynomials
• The Induced Disjoint Paths Problem
• scientific article; zbMATH DE number 4110103 (Why is no real title available?)
• Mineurs d'arbres avec racines
• Induced disjoint paths in claw-free graphs
• Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths
• A linear time algorithm for the induced disjoint paths problem in planar graphs
• Structure and recognition of graphs with no 6-wheel subdivision
• Chordless paths through three vertices
• Induced disjoint paths in circular-arc graphs in linear time
• Induced disjoint paths and connected subgraphs for \(H\)-free graphs
• Induced disjoint paths and connected subgraphs for \(H\)-free graphs
• The \(k\)-in-a-path problem for claw-free graphs
• Crossing number is hard for cubic graphs
• The complexity of induced minors and related problems
• Fixed-parameter tractability of treewidth and pathwidth

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 Q3034816)