Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

MFCS
2004
Springer

favoriteEmaildiscussreport

78views Theoretical Computer Science» more MFCS 2004»

Ubiquitous Parameterization - Invitation to Fixed-Parameter Algorithms

13 years 10 months ago

Ubiquitous Parameterization - Invitation to Fixed-Parameter Algorithms

Download theinf1.informatik.uni-jena.de

Abstract. Problem parameters are ubiquitous. In every area of computer science, we ﬁnd all kinds of “special aspects” to the problems encountered. Hence, the study of parameterized complexity for computationally hard problems is proving highly fruitful. The purpose of this article is to stir the reader’s interest in this ﬁeld by providing a gentle

Rolf Niedermeier

Real-time Traffic

MFCS 2004 | Parameterized Complexity | Problem Parameters | Special Aspects |

claim paper

Related Content

» Constant Ratio FixedParameter Approximation of the Edge Multicut Problem

» FixedParameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints

» FixedParameter Complexity of Minimum Profile Problems

» FixedParameter Complexity of Semantics for Logic Programs

» FixedParameter Algorithms for the k rCenter in Planar Graphs and Map Graphs

» FixedParameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing

» FixedParameter Tractability of Anonymizing Data by Suppressing Entries

» Reflections on Multivariate Algorithmics and Problem Parameterization

» Parameterized Complexity of the Clique Partition Problem

» Algorithmic Lower Bounds for Problems Parameterized by Cliquewidth

Post Info
More Details (n/a)

Added	02 Jul 2010
Updated	02 Jul 2010
Type	Conference
Year	2004
Where	MFCS
Authors	Rolf Niedermeier

Comments (0)