On search, decision, and the efficiency of polynomial-time algorithms
From MaRDI portal
(Redirected from Publication:1342869)
Cites work
- scientific article; zbMATH DE number 4033746 (Why is no real title available?)
- scientific article; zbMATH DE number 3489106 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Graph minors. IV: Tree-width and well-quasi-ordering
- Graph minors. V. Excluding a planar graph
- Graph minors. XIII: The disjoint paths problem
- Nonconstructive advances in polynomial-time complexity
- Nonconstructive tools for proving polynomial-time decidability
- On Well-Partial-Order Theory and Its Application to Combinatorial Problems of VLSI Design
- Riemann's hypothesis and tests for primality
- Theorie der Normalflächen. Ein Isotopiekriterium für den Kreisknoten
Cited in
(25)- On minimum cost edge searching
- scientific article; zbMATH DE number 7471674 (Why is no real title available?)
- On algorithmic applications of the immersion order: An overview of ongoing work presented at the Third Slovenian International Conference on Graph Theory
- Complete graph immersions in dense graphs
- Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
- A brief history of Edward K. Blum and the Journal of Computer and System Sciences
- Graph minors and parameterized algorithm design
- \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions
- Fast minor testing in planar graphs
- Bounding the search number of graph products
- On interval routing schemes and treewidth
- Obtaining a planar graph by vertex deletion
- A note on the self-witnessing property of computational problems
- Confronting intractability via parameters
- Combining intensification and diversification strategies in VNS. An application to the vertex separation problem
- Variable neighborhood search for the vertex separation problem
- Algorithms and obstructions for linear-width and related search parameters
- Low polynomial exclusion of planar graph patterns
- A tight lower bound for vertex planarization on graphs of bounded treewidth
- Explicit linear kernels for packing problems
- A strongly-uniform slicewise polynomial-time algorithm for the embedded planar diameter improvement problem
- Terminal-pairability in complete bipartite graphs with non-bipartite demands. Edge-disjoint paths in complete bipartite graphs
- On Interval Routing Schemes and treewidth
- Fixed-parameter tractability of treewidth and pathwidth
- Forbidden induced subgraphs and the Łoś-Tarski theorem
This page was built for publication: On search, decision, and the efficiency of polynomial-time algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1342869)
