Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology

DOI10.1007/978-3-642-10217-2_2zbMath1267.68302OpenAlexW1527254034WikidataQ57359836 ScholiaQ57359836MaRDI QIDQ3651529

Publication date: 11 December 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10217-2_2

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) General topics in the theory of algorithms (68W01)

Related Items

Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs ⋮ Graph Minors and Parameterized Algorithm Design ⋮ Studies in Computational Aspects of Voting ⋮ The complexity of probabilistic lobbying ⋮ Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter ⋮ The parameterized complexity of local search for TSP, more refined ⋮ Incremental list coloring of graphs, parameterized by conservation ⋮ Two-layer planarization parameterized by feedback edge set ⋮ Aspects of a multivariate complexity analysis for rectangle tiling ⋮ Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} ⋮ Vertex cover problem parameterized above and below tight bounds ⋮ The effect of homogeneity on the computational complexity of combinatorial data anonymization ⋮ Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem} ⋮ Restricted and swap common superstring: a multivariate algorithmic perspective ⋮ On making a distinguished vertex of minimum degree by vertex deletion ⋮ Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring ⋮ Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications ⋮ Algorithmic meta-theorems for restrictions of treewidth ⋮ On families of categorial grammars of bounded value, their learnability and related complexity questions ⋮ Average parameterization and partial kernelization for computing medians ⋮ Efficient Algorithms for Eulerian Extension ⋮ On bounded-degree vertex deletion parameterized by treewidth

This page was built for publication: Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology