Subexponential parameterized algorithms
From MaRDI portal
Recommendations
- Subexponential Parameterized Algorithms
- On the existence of subexponential parameterized algorithms
- Sublinear-time Algorithms
- Sublinear time algorithms
- scientific article; zbMATH DE number 5057523
- Parameterized complexity and subexponential-time computability
- Parameterized (in)approximability of subset problems
- Subexponential parameterized algorithms for graphs of polynomial growth
- Subexponential parameterized algorithm for interval completion
Cites work
- scientific article; zbMATH DE number 1617251 (Why is no real title available?)
- scientific article; zbMATH DE number 5764900 (Why is no real title available?)
- scientific article; zbMATH DE number 16300 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 566078 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 1361465 (Why is no real title available?)
- scientific article; zbMATH DE number 1929955 (Why is no real title available?)
- scientific article; zbMATH DE number 1834643 (Why is no real title available?)
- scientific article; zbMATH DE number 6297711 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- A Cubic Kernel for Feedback Vertex Set
- Algorithms – ESA 2005
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
- Automata, Languages and Programming
- Automata, Languages and Programming
- Bidimensional Parameters and Local Treewidth
- Bidimensionality: new connections between FPT algorithms and PTASs
- Call routing and the ratcatcher
- Constructive linear time algorithms for branchwidth
- Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up
- Dynamic Programming and Fast Matrix Multiplication
- Exact algorithms for the Hamiltonian cycle problem in planar graphs
- Exponential speedup of fixed-parameter algorithms for classes of graphs excluding single-crossing graphs as minors
- Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus
- Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
- Fixed-parameter algorithms for ( k , r )-center in planar graphs and map graphs
- Fourier meets M\"{o}bius: fast subset convolution
- Graph minors. X: Obstructions to tree-decomposition
- Graph minors. XI: Circuits on a surface
- Graph minors. XII: Distance on a surface
- Graph minors. XIII: The disjoint paths problem
- Graph minors. XVI: Excluding a non-planar graph
- Graph-Theoretic Concepts in Computer Science
- Graphs on surfaces
- Improved approximation algorithms for minimum-weight vertex separators
- Kernels in planar digraphs
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- Linearity of grid minors in treewidth with applications through bidimensionality
- Mathematical Foundations of Computer Science 2004
- New upper bounds on the decomposability of planar graphs
- On Linear Time Minor Tests with Depth-First Search
- On the existence of subexponential parameterized algorithms
- Parameterized complexity: exponential speed-up for planar graph problems
- Parametrized complexity theory.
- Polynomial-time data reduction for dominating set
- Quickly excluding a planar graph
- STACS 2005
- Subexponential parameterized algorithms on bounded-genus graphs and \(H\)-minor-free graphs
- The Bidimensional Theory of Bounded-Genus Graphs
- The complexity of graph contractions.
- Which problems have strongly exponential complexity?
Cited in
(36)- Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions
- Confronting intractability via parameters
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs
- Faster parameterized algorithms for minor containment
- Spanners in sparse graphs
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs
- scientific article; zbMATH DE number 6783431 (Why is no real title available?)
- Subexponential parameterized algorithms for bounded-degree connected subgraph problems on planar graphs
- Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
- Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms
- Linear-time computation of a linear problem kernel for dominating set on planar graphs
- Implicit branching and parameterized partial cover problems
- scientific article; zbMATH DE number 7204413 (Why is no real title available?)
- On the existence of subexponential parameterized algorithms
- Practical algorithms for branch-decompositions of planar graphs
- scientific article; zbMATH DE number 7053390 (Why is no real title available?)
- scientific article; zbMATH DE number 3936499 (Why is no real title available?)
- Optimizations of the subresultant algorithm
- Coverability and sub-exponential parameterized algorithms in planar graphs
- Graph minors and parameterized algorithm design
- Fast minor testing in planar graphs
- Catalan structures and dynamic programming in \(H\)-minor-free graphs
- Computational study on planar dominating set problem
- Fast sub-exponential algorithms and compactness in planar graphs
- A quartic kernel for pathwidth-one vertex deletion
- Planar \(k\)-path in subexponential time and polynomial space
- Subexponential parameterized algorithms for graphs of polynomial growth
- New analysis and computational study for the planar connected dominating set problem
- Towards a Taxonomy of Techniques for Designing Parameterized Algorithms
- Subexponential Parameterized Algorithms
- Subexponential-time parameterized algorithm for Steiner tree on planar graphs
- Bidimensionality and kernels
- Sublinear Computation Paradigm
- scientific article; zbMATH DE number 5057523 (Why is no real title available?)
- Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms
- Subexponential algorithms for partial cover problems
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 Q458457)
