790 search results - page 9 / 158 » Subexponential Parameterized Algorithms |
122
click to vote
IWOCA
2009
Springer
15 years 11 months ago
2009
Springer
The notion of submodular partition functions generalizes many of well-known tree decompositions of graphs. For fixed k, there are polynomial-time algorithms to determine whether ...
141
click to vote
CAD
2004
Springer
15 years 4 months ago
2004
Springer
This paper presents a novel approach for 3D surface filtering over two-manifold meshes. A robust spherical parameterization algorithm is proposed to transform the input surface in...
124
click to vote
ANTS
2004
Springer
15 years 10 months ago
2004
Springer
We present a technique to recover f ∈ Q(ζp) where ζp is a primitive pth root of unity for a prime p, given its norm g = f ∗ ¯f in the totally real field Q(ζp + ζ−1 p )....
143
click to vote
WG
2005
Springer
15 years 10 months ago
2005
Springer
The Tutte polynomial is a notoriously hard graph invariant, and efficient algorithms for it are known only for a few special graph classes, like for those of bounded tree-width. Th...
132
click to vote
SODA
2004
ACM
15 years 5 months ago
2004
ACM
Asian options are path-dependent derivatives. How to price them efficiently and accurately has been a longstanding research and practical problem. Asian options can be priced on t...