scientific article; zbMATH DE number 4133491
From MaRDI portal
zbMATH Open0692.68030MaRDI QIDQ3034816FDOQ3034816
Authors: Michael R. Fellows 
Publication date: 1989
Title of this publication is not available (Why is that?)
Recommendations
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Analysis of algorithms and problem complexity (68Q25)
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
- How I got to like graph polynomials
- Comparing trees via crossing minimization
- The Induced Disjoint Paths Problem
- Title not available (Why is that?)
- Mineurs d'arbres avec racines
- Induced disjoint paths in claw-free graphs
- Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths
- Structure and recognition of graphs with no 6-wheel subdivision
- A linear time algorithm for the induced disjoint paths problem in planar graphs
- Induced disjoint paths and connected subgraphs for \(H\)-free graphs
- Induced disjoint paths and connected subgraphs for \(H\)-free graphs
- Chordless paths through three vertices
- Induced disjoint paths in circular-arc graphs in linear time
- 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)
