11 search results - page 1 / 3 » Reflections on Multivariate Algorithmics and Problem Paramet... |
STACS
2010
Springer
13 years 11 months ago
2010
Springer
Research on parameterized algorithmics for NP-hard problems has steadily grown over the last years. We survey and discuss how parameterized complexity analysis naturally develops i...
JDA
2011
12 years 11 months ago
2011
The NP-hard Interval Constrained Coloring (ICC) problem appears in the interpretation of experimental data in biochemistry dealing with protein fragments. Given a set of m integer...
ISSAC
1999
Springer
13 years 9 months ago
1999
Springer
In this paper we study the generic setting of the modular GCD algorithm. We develop the algorithm for multivariate polynomials over Euclidean domains which have a special kind of ...
ECCV
2002
Springer
14 years 6 months ago
2002
Springer
Abstract. Computing reflective symmetries of 2D and 3D shapes is a classical problem in computer vision and computational geometry. Most prior work has focused on finding the main ...
RECOMB
2009
Springer
14 years 5 months ago
2009
Springer
The combination of fully sequence genomes and new technologies for high density arrays and ultra-rapid sequencing enables the mapping of generegulatory and epigenetics marks on a g...