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

Authors:
Michael Fellows
Affiliations:
University of Newcastle, Callaghan, Australia
Venue:
Combinatorial Algorithms
Year:
2009

Citing 0
Cited 15

Efficient algorithms for Eulerian extension

WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring

Journal of Discrete Algorithms
Average parameterization and partial kernelization for computing medians

Journal of Computer and System Sciences
Pattern-guided data anonymization and clustering

MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
On Bounded-Degree Vertex Deletion parameterized by treewidth

Discrete Applied Mathematics
On families of categorial grammars of bounded value, their learnability and related complexity questions

Theoretical Computer Science
Graph minors and parameterized algorithm design

The Multivariate Algorithmic Revolution and Beyond
Studies in computational aspects of voting: open problems of downey and fellows

The Multivariate Algorithmic Revolution and Beyond
Exploiting a hypergraph model for finding golomb rulers

ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
New races in parameterized algorithmics

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Restricted and swap common superstring: a parameterized view

IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Efficient algorithms for the max k-vertex cover problem

TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Incremental list coloring of graphs, parameterized by conservation

Theoretical Computer Science
Two-Layer Planarization parameterized by feedback edge set

Theoretical Computer Science
The effect of homogeneity on the computational complexity of combinatorial data anonymization

Data Mining and Knowledge Discovery

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper reports on three recent research directions that begin to explore the subject of fully multivariate algorithmics, meaning by this the largely uncharted theoretical landscape that lies beyond parameterized complexity and algorithmics -- itself a natural two-dimensional generalization of the familiar one-dimensional framework of $\mathcal{P}$ versus $\mathcal{NP}$.