Subexponential Parameterized Algorithms
From MaRDI portal
Recommendations
- Subexponential parameterized algorithms
- Bidimensionality and parameterized algorithms (invited talk)
- Subexponential-time parameterized algorithm for Steiner tree on planar graphs
- Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs
- Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs
Cited in
(20)- On the existence of subexponential parameterized algorithms
- Optimizations of the subresultant algorithm
- Subexponential parameterized algorithms for bounded-degree connected subgraph problems on planar graphs
- Subexponential-time parameterized algorithm for Steiner tree on planar graphs
- Ranking and drawing in subexponential time
- Fast sub-exponential algorithms and compactness in planar graphs
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs
- Randomized Disposal of Unknowns and Implicitly Enforced Bounds on Parameters
- scientific article; zbMATH DE number 3936499 (Why is no real title available?)
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs
- scientific article; zbMATH DE number 1754598 (Why is no real title available?)
- Subexponential parameterized algorithms
- Decomposition of Map Graphs with Applications.
- Subexponential parameterized algorithms for graphs of polynomial growth
- Sublinear Computation Paradigm
- scientific article; zbMATH DE number 6783431 (Why is no real title available?)
- scientific article; zbMATH DE number 5057523 (Why is no real title available?)
- Dynamic programming for graphs on surfaces
- scientific article; zbMATH DE number 7053390 (Why is no real title available?)
- Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
This page was built for publication: Subexponential Parameterized Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5428794)