The complexity ecology of parameters: An illustration using bounded max leaf number
From MaRDI portal
Recommendations
- The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
- Circumscribed Complexity in Ecological Networks
- Towards fully multivariate algorithmics: some new results and directions in parameter ecology
- Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity
- A complexity-based measure and its application to phylogenetic analysis
- On the generality of stability-complexity relationships in Lotka-Volterra ecosystems
- The [extended] maximum entropy formalism and the statistical structure of ecosystems
- Dynamic complexity of a host-parasitoid ecological model with the hassell growth function for the host
- A search for maximum species abundances in ecological communities under conditional diversity optimization
Cites work
- A Cubic Kernel for Feedback Vertex Set
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Algorithms and Data Structures
- An analysis of ML typability
- Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy (extended abstract)
- Bidimensionality: new connections between FPT algorithms and PTASs
- Easy problems for tree-decomposable graphs
- Fixed-Parameter Tractability and Completeness I: Basic Results
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- Graph Layout Problems Parameterized by Vertex Cover
- Graph minors. XX: Wagner's conjecture
- Graph-Theoretic Concepts in Computer Science
- Graph-Theoretic Concepts in Computer Science
- Graph-Theoretic Concepts in Computer Science
- scientific article; zbMATH DE number 2086260 (Why is no real title available?)
- scientific article; zbMATH DE number 3906520 (Why is no real title available?)
- scientific article; zbMATH DE number 3910446 (Why is no real title available?)
- scientific article; zbMATH DE number 1956210 (Why is no real title available?)
- scientific article; zbMATH DE number 2080462 (Why is no real title available?)
- scientific article; zbMATH DE number 1499087 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- Improved Parameterized Upper Bounds for Vertex Cover
- Mathematical Foundations of Computer Science 2004
- Monadic Second Order Logic on Graphs with Local Cardinality Constraints
- On the Complexity of Some Colorful Problems Parameterized by Treewidth
- On the parameterized complexity of short computation and factorization
- Polynomial-time data reduction for dominating set
- Quickly excluding a forest
- Spanning Trees with Many Leaves
- The complexity of type inference for higher-order typed lambda calculi
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The Traveling-Salesman Problem and Minimum Spanning Trees
- The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel
- Tight lower bounds for certain parameterized NP-hard problems
- Vertex packings: Structural properties and algorithms
- Which problems have strongly exponential complexity?
Cited in
(37)- Bivariate complexity analysis of \textsc{Almost Forest Deletion}
- Sublinear approximation algorithms for boxicity and related problems
- Dominating complex networks by identifying minimum skeletons
- Algorithmic meta-theorems for restrictions of treewidth
- The parameterized complexity of some minimum label problems
- Polynomial kernels for vertex cover parameterized by small degree modulators
- The graph motif problem parameterized by the structure of the input graph
- On polynomial kernels for structural parameterizations of odd cycle transversal
- Kernel bounds for path and cycle problems
- Kernelization -- preprocessing with a guarantee
- Data reduction for graph coloring problems
- Bivariate complexity analysis of \textsc{Almost Forest Deletion}
- On the analysis of the \((1+1)\) evolutionary algorithm for the maximum leaf spanning tree problem
- Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter
- Two-layer planarization parameterized by feedback edge set
- Kernel bounds for path and cycle problems
- Data reduction for graph coloring problems
- Kernelization of graph Hamiltonicity: proper \(H\)-graphs
- Robust connectivity of graphs on surfaces
- A 2-approximation algorithm for finding a spanning tree with maximum number of leaves
- The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
- The parameterized complexity of cycle packing: indifference is not an issue
- Kernelization for feedback vertex set via elimination distance to a forest
- Bounds and algorithms for geodetic hulls
- Packing arc-disjoint cycles in oriented graphs
- Monitoring edge-geodetic sets in graphs
- Kernelization for feedback vertex set via elimination distance to a forest
- Bandwidth parameterized by cluster vertex deletion number
- Bandwidth parameterized by cluster vertex deletion number
- On the tractability landscape of the conditional minisum approval voting rule
- Finding a minimum spanning tree with a small non-terminal set
- Parameterized vertex integrity revisited
- Modularity clustering parameterized by max leaf number
- Boundaried kernelization
- Polynomial-size enumeration kernelizations for long path enumeration
- Parameterized spanning tree congestion
- The parameter report: an orientation guide for data-driven parameterization
This page was built for publication: The complexity ecology of parameters: An illustration using bounded max leaf number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q733736)
